Skip to content

Erdős problem 138

If W(k)W(k) is the least NN such that every two-colouring of {1,,N}\{1, \dots, N\} contains a monochromatic kk-term arithmetic progression, must W(k+1)W(k)W(k+1) - W(k) \to \infty?
Retained from Erdős Problems · not edited here
Formal statements
3 open · 4 solved · 2 test
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 9 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page