MathCastle
Number TheoryMediumThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Medium problem

Find the smallest positive integer xx with x≡1(mod4)x \equiv 1 \pmod 4 and x≡4(mod9)x \equiv 4 \pmod 9.