MathCastle
Number TheoryEasyThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Easy problem

Find the smallest positive integer xx with x≡2(mod5)x \equiv 2 \pmod 5 and x≡3(mod4)x \equiv 3 \pmod 4.