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

FormalConjectures/ErdosProblems/

138.lean

Retained formal statement9 of 9

FormalConjectures/ErdosProblems/138.leanErdos138.monoAPNumber_two_two1 lineExact file

1Erdos138.W 2 = 3

TestProof has a holeformal conjecturesexternal proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Sources

Search problems.science