If we subtract smaller number from larger (we reduce larger number), GCD doesn’t change. So if we keep subtracting repeatedly the larger of two, we end up with GCD. Now instead of subtraction, if we ...

Euclid's algorithm is an ancient and efficient method for finding the GCD of two numbers. The algorithm is based on the observation that the GCD of two numbers does not change if the smaller number is ...