Erdős problem 138 · problems.science

If $W(k)$ is the least $N$ such that every two-colouring of $\{1, \dots, N\}$ contains a monochromatic $k$ -term arithmetic progression, must $W(k+1) - W(k) \to \infty$ ?

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#138
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI standalone
Erdős AI contributions wiki · 10 Apr, 2026
Machine
DeepMind prover agent
Open the source record
AI collaborating with humans
Erdős AI contributions wiki · 10 Apr, 2026
Machine
GPT-5.4 Thinking
People
Nat Sothanaphan
Open the source record
argument
VibeMathed
Machine
AlphaProof Nexus
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science