ILL 1986 Problem 37
Prove that the set can be partitioned into disjoint sets so that no one of these sets contains an arithmetic triple (i.e., three distinct numbers in an arithmetic progression).
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.