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$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

10 retained statements2415f78e850a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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$?

Open exact source location

Sources

Search problems.science