Show that if a. b, m. and n are integers such that m > 0. n > 0. n | m. and a ≡ b (mod m), then a ≡b (mod n).
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.