MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

What is the least positive solution of the pair x≡11(mod15)x \equiv 11 \pmod{15}, x≡5(mod24)x \equiv 5 \pmod{24}?