Example: Use the Euclidean Algorithm to find the greatest common divisor of 52 and 180. ... Note that 5·3 = 15 = 2·7 + 1 ≡ 1 (mod 7) ← Note that -2 would ...
