MathCastle
Number TheoryEasyModular Arithmetic

Modular Arithmetic · Easy problem

How many integers nn with 1≤n≤501 \le n \le 50 satisfy n≡3(mod7)n \equiv 3 \pmod 7?