Question

(a) Let n and m be relatively prime integers, and let a and b be arbitrary integers. Prove that there is an integer x that solves the simultaneous congruence x = a modulo m and x = b modulo n. (b) Determine all solutions of these two congruences.