alt Hacker NewsKimi 2.6 gives the answer ""By Dirichlet's theorem on arithmetic progressions, since gcd(6,35)=1 , there are infinitely many primes of the form 35k+6 . So the answer is: infinitely many primes give a remainder of 6 when divided by 35.
Kimi 2.6 gives the answer ""By Dirichlet's theorem on arithmetic progressions, since gcd(6,35)=1 , there are infinitely many primes of the form 35k+6 . So the answer is: infinitely many primes give a remainder of 6 when divided by 35.