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