Why does the Euclidean algorithm for finding GCD work?
Oct 3, 2019 · why the Euclidean algorithm for finding the GCD of two numbers always works by using a standard argument in number theory: showing that a problem is equivalent to the same problem for smaller numbers.