Find the greatest common divisor (GCD) of 252 and 198.
Note
Using the Euclidean algorithm repeatedly reduces the pair to a final non-zero remainder of 18, so the GCD is 18.
Find the greatest common divisor (GCD) of 252 and 198.
Using the Euclidean algorithm repeatedly reduces the pair to a final non-zero remainder of 18, so the GCD is 18.