Erdős Problem #3
Editorial depth: Legacy authored exemplar — not separately admitted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, additive combinatorics, arithmetic progressions.
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.
Legacy editorial exemplar
This early authored explanation predates the manuscript-acceptance ledger. It is provided as a qualified educational exemplar, not a separate source-verified editorial acceptance or mathematical certification.
The question in plain language
An arithmetic progression is a regularly spaced sequence, such as \(5, 11, 17, 23\). Erdős asked whether a thin infinite set of positive integers must nevertheless contain progressions of every finite length whenever the sum of the reciprocals of its members diverges:
The condition measures abundance without demanding that the set contain any fixed proportion of the positive integers.
A small example
The positive integers have a divergent reciprocal (harmonic) series and plenty of progressions. The powers of two have a convergent reciprocal sum and no three-term nonconstant progression.
The primes are much sparser than all integers, but their reciprocal sum diverges; the Green–Tao theorem establishes arbitrarily long progressions among them. Erdős proposed the much stronger conclusion for any set with divergent reciprocal sum, whether prime-like or not.
What is known
The general conjecture remains open. The three-term case follows from deep quantitative progress on progression-free sets; the four-term case is a key unresolved barrier. Szemerédi's theorem proves that positive-density sets contain arbitrarily long progressions, but divergent reciprocal sum is strictly weaker than positive density.
Define \(r_k(N)\) as the largest size of a subset of \(\{1, \ldots, N\}\) containing no nonconstant progression of length \(k\). A rigorous reduction rewrites the fixed-length Erdős assertion as the convergence problem
It is not enough to know merely that \(r_k(N)/N \to 0\); the rate must be sufficiently strong.
GCL's current state
GCL already has an active mathematics campaign inherited from OPENMATH-2026. Its protected mathematical frontier records proved and checked finite reductions and focuses on the four-term series.
The present frontier asks for a genuine density-dependent loss between nearby dyadic scales—an improvement that would make the displayed series converge. Several plausible stronger recurrence rules have been ruled out or shown unsupported. One later independent verification assignment expired without a return; its absence is not a successful theorem verification.
The separate catalogue editorial task provides a completed source-audit and bounded-design return; its review does not launch an unselected Solve campaign or alter the open problem status.
What remains
The missing mathematical breakthrough is a sufficiently strong four-term-progression-free density estimate—or another genuinely new route to the reciprocal-divergence conclusion. Improving calculations or re-proving existing reductions does not, by itself, cross the boundary.
Sources and claim boundaries
- Erdős Problems #3 — statement and literature.
- GCL-ERDOS3 mathematical frontier — the canonical current theorem/debt record.
- GCL campaign state — operations, not an assertion of the conjecture.
- GCL catalogue issue #1272 — source and bounded research design audit.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1272 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: ACTIVE_EXISTING_CAMPAIGN.
- 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.