(Chinese Remainder Theorem for two congruences) Let r and s be positive integers such that gcd(r, s) = 1. Use the isomorphism in Example 18.15 to show that for m, n ∊ ℤ, there exists an integer .v such that X ≡ m (mod r) and X ≡ n (mod s).
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.