1. ## congruence

Prove that:

If a ≡ b (mod n) and m|n then, a ≡ b (mod m).

2. by def, $a \equiv b \bmod n$ is the same as $a = rn + b$ for some integer $r$

$m|n$ implies $n = km$ for some integer $k$.

combine the facts..