Prove that the congruences
admit a simultaneous solution if and only if gcd(n, m) | a − b; if a solution exists, confirm that it is unique modulo lcm(n, 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.