Number TheoryChallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Challenge problemFor how many pairs (a,b)(a, b)(a,b) with 0≤a<120 \le a < 120≤a<12 and 0≤b<180 \le b < 180≤b<18 does the system x≡a(mod12)x \equiv a \pmod{12}x≡a(mod12), x≡b(mod18)x \equiv b \pmod{18}x≡b(mod18) have a solution?Check Show answer Walk through it step by step Practice more like this Review this concept