0

# What is Euclid's Algorithm?

Updated: 4/28/2022

Wiki User

14y ago

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.

Wiki User

14y ago
Study guides

14 cards

## Which of the following is not a step in the inquiry process

➡️
See all cards
3.89
148 Reviews

Earn +20 pts
Q: What is Euclid's Algorithm?
Submit
Still have questions?
Related questions

### What is euclids theory?

need a simple explanation of Euclids theory.

eetrgrv

euclids elements

geometry

geometry

compositions

euclids elements

### What were some of euclids accomplishments?

His major accomplishment was in philosophy and mathematics

### How many books in euclids eiements?

There are 13 books in Euclid's Elements.

### What is the name of the guy who wrote Euclids elements?

'Elements' was written by Euclid.

### What is euclids area of expertise?

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.

### What is euclids full name?

Euclid of Alexandria or Eukleides