Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
OPEN
Does the longest arithmetic progression of primes in $\{1,\ldots,N\}$ have length $o(\log N)$?
#200
:
[ErGr79]
[ErGr80]
primes
,
arithmetic progressions
It follows from the prime number theorem that such a progression has length $\leq(1+o(1))\log N$.
Previous
Next