Best Answer

Euclid's algorithm is a popular algorithm to compute the GCD of two numbers.

Algorithm:

Gcd(a,b) = Gcd(b, a mod b), where a>=b and

Gcd(a,0) = a

Say we want to find the GCD of 72 and 105. 105 mod 72 = 33, so GCD(72,105) = GCD(33,72) 72 mod 33 = 6, so GCD(33,72) = GCD(6,33) 33 mod 6 = 3 so GCD(6,33) = GCD(3,6) 6 mod 3 = 0 so GCD(3,6) = GCD(0,3) = 3. So the GCD of 72 and 105 is 3.

Study guides

☆☆

Q: What is Euclid's Algorithm?

Write your answer...

Submit

Still have questions?

Continue Learning about Other Math

eetrgrv

euclids elements

There are 13 books in Euclid's Elements.

Euclid of Alexandria or Eukleides

They are different because standard algorithm is more common then the expanded algorithm

Related questions

need a simple explanation of Euclids theory.

eetrgrv

euclids elements

geometry

geometry

compositions

euclids elements

His major accomplishment was in philosophy and mathematics

There are 13 books in Euclid's Elements.

'Elements' was written by Euclid.

Euclids has expertise in server transaction performance monitor(Internet operations services for enterprise) for its expertise yodlee has selected Euclids for its transaction management performance monitoring.For more query and problems related to any educational to your assignments just log on to tutorchrome.com for online homework help and online assignment help.

Euclid of Alexandria or Eukleides