Find the greatest common divisor (GCD) of 792 and 660.
Note
The GCD is 132 because 792 − 660 = 132 and 660 is divisible by 132, so the Euclidean algorithm shows GCD(792,660)=132.
Find the greatest common divisor (GCD) of 792 and 660.
The GCD is 132 because 792 − 660 = 132 and 660 is divisible by 132, so the Euclidean algorithm shows GCD(792,660)=132.