Erdős Problem #483 — Let f(k) be the minimal N such that if 1,…,N is k-coloured then there is a monochromatic solution to a+b=c.
Statement
Let be the minimal such that if is -coloured then there is a monochromatic solution to . Estimate . In particular, is it true that for some constant ?
Record
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.