MathCastle
Number TheoryMediumThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Medium problem

The moduli 1212 and 1818 share the factor 66. Find the smallest positive integer xx with x≡5(mod12)x \equiv 5 \pmod{12} and x≡11(mod18)x \equiv 11 \pmod{18}.