MathCastle
Number TheoryMediumModular Arithmetic

Modular Arithmetic · Medium problem

How many integers nn with 6≤n≤4386 \le n \le 438 satisfy n≡0(mod4)n \equiv 0 \pmod{4}?