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.

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.

Extended-Euclidean-Algorithm The Extended Euclidean Algorithm (EEA) is an extension of the Euclidean Algorithm used to find the greatest common divisor (GCD) of two integers 𝑎a and 𝑏b, as well as ...