MathCastle
AIMEChallengeAdvanced Number Theory

Advanced Number Theory · Challenge problem

Find the number of integers nn with 1≤n≤26001 \le n \le 2600 such that n≡1(mod6)n \equiv 1 \pmod{6} and gcd⁡(n,7)=1\gcd(n, 7) = 1.