(a) [4]Show that if n divides m where m and n are positive integers greater than 1, then a ≡ b (mod m) implies a ≡ b (mod n) for any positive integers a and b. (b) [3]Show that a·c ≡ b·c (mod m) with a, b, c and m integers with m≥2 does not […]
Tag Archives: Euclidean Algorithm
