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