MathCastle
Number TheoryHardThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Hard problem

How many positive integers n≤100n \le 100 satisfy x≡2(mod7),x≡4(mod8)x \equiv 2 \pmod{7},\quad x \equiv 4 \pmod{8}?