The Euclidean Algorithm is a technique for quickly finding the GCD of two integers. It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

**Background**

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the original two numbers. By reversing the steps, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g., 21 = 5 × 105 + (−2) × 252.

The algorithm is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).

### Related

Forward–backward algorithmThe forward-backward algorithm is an algorithm for computing posterior marginals in a hidden Markov model (HMM). It is based on…

Kruskal's algorithmKruskal's algorithm will grow a solution from the cheapest edge by adding the next cheapest edge, provided that it doesn't…