2003 IMO Problems/Problem 1

Revision as of 10:04, 24 November 2019 by Kreisaisjelis (talk | contribs) (Added see also box and a category)

$S$ is the set $\{1, 2, 3, \dots ,1000000\}$. Show that for any subset $A$ of $S$ with $101$ elements we can find $100$ distinct elements $x_i$ of $S$, such that the sets $\{a + x_i \mid a \in A\}$ are all pairwise disjoint.


See Also

2003 IMO (Problems) • Resources
Preceded by
'
1 2 3 4 5 6 Followed by
Problem 2
All IMO Problems and Solutions
Invalid username
Login to AoPS