USAMO 2009 Problem 2
- Day 1
- Answer
Let be a positive integer. Determine the size of the largest subset of which does not contain three elements , , (not necessarily distinct) satisfying .
Dataset text AI-MO AoPS. Quoted with source.
Show the answer
Maximum size: n when n is even, and n+1 when n is odd. One extremal subset is all integers in {−n, …, n} except those with absolute value at most floor(n/2), i.e., {−n, …, −floor(n/2)−1, floor(n/2)+1, …, n}.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.