The Euclidean algorithm is a method to find the Greatest Common Divisor (GCD) of two numbers. The GCD of two numbers is the largest number that divides both of them without leaving a remainder. The ...

Result: • The last non-zero remainder obtained is the GCD of 𝑎a and 𝑏b. • The coefficients 𝑥x and 𝑦y at that step represent the Bézout coefficients satisfying 𝑎𝑥+𝑏𝑦=gcd(𝑎,𝑏)ax+by=gcd(a,b).

Learn how to find the greatest common divisor (GCD) of two numbers using three different algorithms: the Euclidean, the binary, and the Lehmer's algorithm.