The Euclidean algorithm is an efficient method for computing the greatest common divisor of two natural numbers (or polynomials, or any other object with the necessary structure), and was one of the first known algorithms to be described formally. It is based on the two identities:
- a > b implies: gcd(a, b) = gcd(b, a mod b)
- gcd(a, 0) = a
Pages in category "Euclidean algorithm"
The following 8 pages are in this category, out of 8 total.