Register

(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.

(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.
asked 152k views
2 votes
(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.

asked
User Nuclearnova
by
7.5k points

1 Answer

1 vote

3019=273*11+16

273=16*17+\underline1

\implies\mathrm{gcd}(3019,273)=1
answered
User Rogier Werschkull
by
8.5k points
← Prev Question Next Question →

Related questions

User Stmax
asked Dec 4, 2024 126k views
What is Euclid's algorithm for finding the greatest common divisor between two numbers?
Stmax asked Dec 4, 2024
by Stmax
7.8k points
1 answer
0 votes
126k views
Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

Other Questions

How do you can you solve this problem 37 + y = 87; y =
What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
Link Copied!