MathCastle
AIMEChallengeAdvanced Number Theory

Advanced Number Theory · Challenge problem

Find the number of integers nn with 1≤n≤24001 \le n \le 2400 such that n≡6(mod13)n \equiv 6 \pmod{13} and gcd⁡(n,14)=1\gcd(n, 14) = 1.