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