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