Show that if a ≡ b (mod m) and c ≡ d (mod m), where a, b, c, d, and m are integers with m ≥2, then a -c≡ b- d (mod 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.