How do you find the greatest common divisor (GCD) of two numbers?

To find the greatest common divisor (GCD) of two numbers, use the Euclidean algorithm: divide the larger number by the smaller one, take the remainder, and repeat with the smaller number and the remainder until the remainder is zero. The last non-zero remainder is the GCD.