Erdős Problem #138
Prior state unknown→proved
the stronger question $W(k)^{1/k} \to \infty$ remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Ramsey Theory
Erdős Problem #138
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$?
14Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
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$?
the stronger question $W(k)^{1/k} \to \infty$ remains open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.