Find gcd( 1180, 482). Use the Euclidean algorithm.

Answer 1

1180 divided by 482 = 2 with remainder 216

482 divided by 216 = 2 with remainder 50

216 divided by 50 = 4 with remainder 16

50 divided by 16 = 3 with remainder 2

16 divided by 2 = 8 with no remainder

the last divisor is the gcf, which is 2

482/1180 = 241/590 <--- divides by 2 to reduce to lowest terms