Erdős–Sárközy question
Statement
For a finite set , define its subset-sum set by . Let be the least integer such that there exists an -element set for which contains no nonconstant three-term arithmetic progression; equivalently, there are no distinct with . The Erdős–Sárközy question asks whether , that is, whether there exists a constant such that for all sufficiently large .
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.