MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

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