6. Use the Euclidean algorithm to determine the greatest common divisor of 1078 and 2541.  Show your work.

GCD (1078, 2541)

2541 = 2 * 1078 + 385

1078 = 2 * 385 +308

385 = 1 * 308 + 77

308 = 4 * 77 + 0

GCD (1078, 2541) = GCD (1078, 385) = GCD (385, 308) = GCD (308, 77) = GCD (77, 0) = 77