Erdős Problem #948
Statement
Is there a function and a such that in any -colouring of the integers there exists a sequence such that for infinitely many and the set does not contain all colours?
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.