MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

Find the smallest positive xx with x≡1(mod4)x \equiv 1 \pmod 4, x≡3(mod6)x \equiv 3 \pmod 6 and x≡5(mod10)x \equiv 5 \pmod{10}.