Number TheorySuperchallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Superchallenge problemHow many triples (a,b,c)(a, b, c)(a,b,c) with 0≤a<40 \le a < 40≤a<4, 0≤b<60 \le b < 60≤b<6, 0≤c<90 \le c < 90≤c<9 make the system x≡a(mod4)x \equiv a \pmod 4x≡a(mod4), x≡b(mod6)x \equiv b \pmod 6x≡b(mod6), x≡c(mod9)x \equiv c \pmod 9x≡c(mod9) solvable?Check Show answer Walk through it step by step Practice more like this Review this concept