Skip to content

Erdős Problem #187

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, ramsey theory, 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

Colour the positive integers red and blue. For each positive common difference \(d\), let \(L(d)\) be the maximum length of a monochromatic arithmetic progression with difference \(d\); it may be infinite. Erdős and Cohen asked for the strongest growth guarantee \(f(d)\) such that in every two-colouring there are infinitely many differences \(d\) for which \(L(d)\ge f(d)\).

The quantifiers are central: one colouring must be tested across infinitely many values of \(d\). Requiring a long progression for every \(d\), or allowing a different colouring for each \(d\), would be a different problem.

A small example

The alternating colouring of the positive integers has no monochromatic two-term progression of odd difference, but every arithmetic progression of even difference is monochromatic, of arbitrarily large length. Thus the example gives large \(L(d)\) on even differences. It does not establish a universal result across arbitrary colourings.

For a finite colouring prefix, calculate maximal same-colour runs on each residue class modulo \(d\); consecutive terms in such a run are a progression of difference \(d\). A finite prefix cannot certify infinitely many good differences.

What is known

The optimal universal growth remains OPEN. Van der Waerden's theorem forces any valid universal growth threshold to tend to infinity along appropriate differences. Erdős observed that a colouring based on the fractional parts of \(\sqrt2 n\) limits an achievable universal \(f(d)\) to \(O(d)\); Petruska and Szemerédi improved this to \(O(\sqrt d)\).

Beck's 1980 probabilistic construction improves the obstruction sharply: it produces a colouring showing that one cannot force more than approximately

\[ (1+o(1))\log_2 d \]

as a universal threshold. This is an upper obstruction on what can be guaranteed, not a lower guarantee of logarithmic monochromatic progressions. Erdős conjectured an upper scale \(d^{o(1)}\), consistent with Beck's result but much weaker. The maintained #187, updated April 2026, still labels the best possible guaranteed growth open.

GCL's current state

The pinned and maintained status is OPEN. Original issue: #1456. Full proofs of the Petruska–Szemerédi and Beck constructions were not independently replayed. The source has no admitted formal statement at the locked provider revision.

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 constructs the alternating-colouring example and a second periodic colouring, enumerates monochromatic runs for differences \(d\le12\) on finite prefixes, and checks the exact definition of \(L(d)\). Acceptance: odd-difference two-term progressions fail under alternating colours, while even differences have unbounded monochromatic runs. Stop before extrapolating finite data into a guarantee for infinitely many \(d\).

Sources and claim boundaries

No new universal growth theorem, independent Beck proof or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1456 — 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.

Back to catalogue · Compendium introduction