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