Erdős Problem #984 — A two-colouring with only subpolynomial monochromatic progressions
Can the positive integers be coloured with two colours so that, for every , every monochromatic arithmetic progression with first term has length ?
References
Primary source
Additional references
P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.