Erdős problem 200 · problems.science

Does the longest arithmetic progression of primes in $\{1,\ldots,N\}$ have length $o(\log N)$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:d4032e269aa702ca1741f045ccdae8c7fd05fe2cd18aa0756235cc566a66cfc2
Metadata: sha256:7b3eb351a3c2e0dcb1fe6b61c7c46a216dda59cb1eea530e967431c5eb9ba476
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:43c6ac06503a95b749373da43db930f95f9d3a28d1279a0dbf752991fa1205b0

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207