MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

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