MathCastle
Number TheoryMediumThe Chinese Remainder Theorem

The Chinese Remainder Theorem · Medium problem

An integer NN satisfies N≡3(mod5)N \equiv 3 \pmod 5 and N≡5(mod7)N \equiv 5 \pmod 7. What is the remainder when N2N^2 is divided by 3535?