Erdős Problem #201
Statement
Let be such that any set of integers contains a subset of size at least which does not contain a -term arithmetic progression. Determine the size of . How does it relate to , the size of the largest subset of without a -term arithmetic progression? Is it true that
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.