Skip to content

Erdős problem 200

Does the longest arithmetic progression of primes in {1,,N}\{1,\ldots,N\} have length o(logN)o(\log N)?
Retained from Formal Conjectures · not edited here
Formal statements
1 open · 1 solved
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 2 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page