MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

Find the smallest positive integer xx with x≡7(mod12)x \equiv 7 \pmod{12} and x≡13(mod18)x \equiv 13 \pmod{18}.