Erdős Problem #169
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: 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.
The question in plain language
Let \(k\ge3\) be fixed. Among all sets \(A\) of positive integers containing no \(k\) term arithmetic progression, consider the largest possible sum of their reciprocals:
Erdős asked for the growth of \(f(k)\) as \(k\) grows, especially whether
where \(W(k)\) is the ordinary two-colour van der Waerden number. A finite large initial sum is not enough: the supremum ranges over all, possibly infinite, progression-free sets.
A small example
The finite set \(A=\{1,2,4\}\) has no three-term arithmetic progression: neither \(1,2,4\) nor any of its reorderings has a common nonzero step. Its reciprocal sum equals \(1+1/2+1/4=7/4\). Adding \(3\) would create the progression \(1,2,3\) and invalidate the set for \(k=3\).
A set that avoids three-term progressions also avoids every longer arithmetic progression, so \(f(k)\) is nondecreasing in \(k\). This elementary relation does not determine its order of growth.
What is known
The conjectured divergence is OPEN. Berlekamp (1968) established \(f(k)\ge(\log2)k/2\). Gerver (1977) improved this to
The maintained Erdős #169, updated 4 April 2026, records the elementary comparison \(f(k)/\log W(k)\ge1/2\), but even a uniform improvement of the constant beyond \(1/2\) remains open.
For individual parameters, Wróblewski obtained \(f(3)\ge3.00849\) and Walker (2025) obtained \(f(4)\ge4.43975\). Walker also shows that progression-free Kempner sets, specified by permitted digits in a fixed base, approximate the supremum arbitrarily closely. This is a structural reduction, not a proof of the conjectured van der Waerden-normalized limit.
GCL's current state
Pinned and maintained status: OPEN. The original source task is #1438. The live page, historical references and Walker's attributed 2025 results were reviewed, but the complete proof of the Kempner-set approximation was not independently reconstructed. Its original triage requires statement capture rather than treating a newer formal file as admitted.
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 enumerates subsets of \([1,18]\) without nonconstant three- or four-term arithmetic progressions, computes exact reciprocal sums, and verifies monotonicity in \(k\). Acceptance: the fixture \(\{1,2,4\}\) passes with reciprocal sum \(7/4\), no duplicate or zero-step progressions are counted, and finite partial optima are not confused with \(f(k)\).
Sources and claim boundaries
- Erdős #169, references [Be68], [Ge77], [Wr84], [Wa25].
- Original GCL source issue #1438.
No proof of the divergent ratio, independent Kempner-set theorem or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1438 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.