MathCastle
Number TheoryMediumThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Medium problem

Find the smallest positive integer xx with x≡3(mod6)x \equiv 3 \pmod 6 and x≡7(mod10)x \equiv 7 \pmod{10}.