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