Compute gcd of 123,451 and 708,677.

Answer 1

To compute the gcd of 123,451 and 708,677, we can use the Euclidean algorithm.

708,677 = 123,451 * 5 + 34,382
123,451 = 34,382 * 3 + 20,305
34,382 = 20,305 * 1 + 14,077
20,305 = 14,077 * 1 + 6,228
14,077 = 6,228 * 2 + 1,621
6,228 = 1,621 * 3 + 1,365
1,621 = 1,365 * 1 + 256
1,365 = 256 * 5 + 105
256 = 105 * 2 + 46
105 = 46 * 2 + 13
46 = 13 * 3 + 7
13 = 7 * 1 + 6
7 = 6 * 1 + 1

Since the gcd is the last non-zero remainder in the Euclidean algorithm, the gcd of 123,451 and 708,677 is 1.