If x ≡ a (mod n), prove that either x ≡ a (mod 2n) or x ≡ a + n (mod 2n).
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.
Request! (Login Required)
Post an Article +5 Coins
Post an Answer +5 Coins
Post a Question with Answer +5 Coins