IMO 2003 Problem 1
- Day 1
- Difficulty band 6
S is the set {1, 2, 3, ... , 1000000}. Show that for any subset A of S with 101 elements we can find 100 distinct elements of S, such that the sets + A are all pairwise disjoint. [Note that + A is the set {a + | a is in A} ].
Community text Kalva (prase.cz mirror). 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.