Erdős Problem #160
Statement
Let be the smallest such that can be coloured with colours so that every four-term arithmetic progression must contain at least three distinct colours. Estimate .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.