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

User Nuclearnova
by
7.5k points

1 Answer

1 vote

3019=273*11+16

273=16*17+\underline1

\implies\mathrm{gcd}(3019,273)=1
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
8.3k points
1 answer
0 votes
126k views
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.5m questions

12.2m answers

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
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
Link Copied!