MathCastle
Number TheoryEasyModular Arithmetic

Modular Arithmetic · Easy problem

An integer nn satisfies n≡3(mod4)n \equiv 3 \pmod 4. What is the remainder when n2n^2 is divided by 44?