MathCastle
Number TheoryChallengeModular Arithmetic

Modular Arithmetic · Challenge problem

Find the sum of all integers xx with 1≤x≤5001 \le x \le 500 satisfying 35x≡21(mod56)35x \equiv 21 \pmod{56}.