Erdős Problem #54 — Growth of Ramsey 2-complete sequences
Statement
A sequence is Ramsey 2-complete if every two-colouring of makes every sufficiently large positive integer a sum of distinct terms of one colour. Improve the known lower and upper growth restrictions, represented in the source by the exponents and in the bounds for its enumerating function.
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.