MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

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