AIMEChallengeAdvanced Number Theory ShareAdvanced Number Theory · Challenge problemFind the number of integers nnn with 1≤n≤26001 \le n \le 26001≤n≤2600 such that n≡1(mod6)n \equiv 1 \pmod{6}n≡1(mod6) and gcd(n,7)=1\gcd(n, 7) = 1gcd(n,7)=1.Check Show answer Walk through it step by step Practice more like this Review this concept