MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

Find the smallest positive integer xx with x≡1(mod5)x \equiv 1 \pmod{5}, x≡3(mod7)x \equiv 3 \pmod{7} and x≡7(mod9)x \equiv 7 \pmod{9}.