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