Prove that: If a ≡ b (mod n) and m|n then, a ≡ b (mod m).
Follow Math Help Forum on Facebook and Google+
Originally Posted by porterhv Prove that: If a ≡ b (mod n) and m|n then, a ≡ b (mod m). you are asked to prove if $\displaystyle n \mid (a - b)$ and $\displaystyle m \mid n$ then $\displaystyle m \mid (a - b)$
View Tag Cloud