Erdős Problem #894 — Colouring the integers against lacunary differences
Statement
Let satisfy for some . Is there a finite colouring of with no monochromatic pair whose difference belongs to ?
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.