(a) Prove that x ≡ y (mod m) if and only if x = km + y for some integer k.
(b) Prove that x ≡ y (mod m) if and only if x and y have the same remainder when divided by m.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.