If a ≡ b (mod n1) and a ≡ c (mod n2), prove that b ≡ c (mod n), where the integer n = gcd (n1,n2).
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