olymmath

IMO 2003 Problem 1

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 xix_i of S, such that the sets xix_i + A are all pairwise disjoint. [Note that xix_i + A is the set {a + xix_i | 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.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator imo/2003/p1 · Tag W50RJKSMQW · Edit this page on GitHub · Keys: j next, k previous