Verify that if a ≡ b (mod n1) and a = b (mod n2), then a ≡ b (mod n), where the integer n = lcm(n1, n2). Hence, whenever n1 and n2 are relatively prime, a ≡ b (mod n1n2).
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.