Erdős Problem #238
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Fix any two positive real constants \(c_1,c_2\). Erdős asked whether, for every sufficiently large \(x\), one can find more than \(c_1\log x\) consecutive primes no larger than \(x\) with every two distinct primes in the chosen block separated by more than \(c_2\).
Because these primes occur in increasing order, the condition on every pair is equivalent to requiring every adjacent gap within the block to exceed \(c_2\). Here “consecutive primes” means a contiguous segment in the entire prime sequence, not merely primes forming a progression.
A small example
The consecutive primes \(7,11,13,17\) have gaps \(4,2,4\). They constitute a block with every pair farther than one, but not a block with every pair farther than two, because the gap from \(11\) to \(13\) equals two. The inequality is strict.
A block of \(m\) consecutive primes has \(m-1\) internal gaps. Replacing the desired number of primes by the number of gaps causes an off-by-one error in the finite search.
What is known
OPEN for arbitrary \(c_1,c_2>0\). Erdős (1949) proved the assertion for any fixed \(c_2>0\) provided \(c_1\) is sufficiently small depending on \(c_2\). The maintained Erdős #238, last updated July 2026, preserves the stronger two-parameter conjecture as open.
The existence of arbitrarily large prime gaps is insufficient by itself: the question concerns a run of many consecutive prime gaps all longer than the threshold. A proof of isolated gaps, or a positive density of individually long gaps, does not immediately imply a contiguous run of length growing as \(\log x\).
GCL's current state
Pinned and live classification: OPEN. Original issue #1507. The source's dependence of the proven small constant \(c_1\) on \(c_2\) is retained; the original 1949 analytic proof was not independently reviewed.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task sieves primes to selected cutoffs and computes the longest run of consecutive gaps strictly above \(c_2\) for several fixed thresholds. Acceptance: count the primes as one more than the number of gaps and preserve strict greater-than comparisons. Finite runs do not establish the all-constant asymptotic assertion.
Sources and claim boundaries
- Erdős #238, original [Er49c], [Er55c].
- Original issue #1507.
No universal long-gap-run theorem, independent source proof or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1507 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.