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