MathCastle
Number TheoryEasyThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Easy problem

The moduli 66 and 99 share the factor 33. Find the smallest positive integer xx with x≡4(mod6)x \equiv 4 \pmod 6 and x≡1(mod9)x \equiv 1 \pmod 9.