← All problems

Erdős Problem #966 — Arithmetic-progression-free sets forcing monochromatic progressions

50 years old · documented by

For every k,r∈Nk,r\in\mathbb N with k≥2k\ge2 and r≥2r\ge2, does there exist a set A⊆NA\subseteq\mathbb N containing no non-trivial arithmetic progression of length k+1k+1, such that every colouring of AA with rr colours contains a monochromatic non-trivial arithmetic progression of length kk?

References

Progress summary

Refreshed
Open · solution reported

An affirmative construction was announced in February 2026, but it has not been independently verified, so the problem is not settled.

For k,r≥2k,r\geq 2, the problem asks whether there is a set A⊆NA\subseteq\mathbb{N} with no nontrivial progression of length k+1k+1, while every rr-colouring of AA contains a monochromatic progression of length kk. Erdős reported in 1975 that Spencer had shown such a sequence exists, but no proof was supplied.

Known results

  • Spencer, as reported by Erdős in 1975, allegedly established existence; the reference and proof remain unavailable.

February 2026 claimed solution

A construction based on the Hales–Jewett theorem and a base-qq embedding was discussed on February 25, 2026, but the discussion did not verify it.

Current status (as of February 2026): Existence was reported by Erdős in 1975, and an affirmative AI-generated construction was claimed in 2026, but no independently verified proof is recorded.

Sources

Solutions 0

No solutions have been posted yet.