Skip to main content
OlympiadHQ

Browse · MathNet

Print

Team Selection Test for IMO 2019

Turkey 2019 counting and probability

Problem

There are bags: each bag contains beads with total weight kg. In each bag the beads are numbered by . A proper collection is a collection of differently numbered beads containing at most one bead from each bag and having total weight not less than kg. Find the maximal possible value of , if always there are at least different proper collections.
Solution
A good collection is a collection of differently numbered beads containing exactly one bead from each bag. Let be a good collection, where for each , is a number of the bead taken from -th bag. We say that two good collections and are equivalent if for some integer and for each we have . Clearly, each good collection is equivalent to exactly other good collections and the set of all good collections can be partitioned into equivalence classes. The total weight of all collections belonging to any fixed equivalence class is equal to kg, since the sum representing the total weight contains the weight of each bead exactly once. Therefore, in each equivalence class there is at least one good collection with total weight not less than . Thus, in each equivalence class there is at least one proper collection and consequently there are at least distinct proper collections.

Now we give an example when the total number of proper collections is exactly . Suppose that the weights of the beads of first bag are respectively and the weights of all other beads are equal to . Now note that

(†) any proper collection should contain the first bead of the first bag, since otherwise its total weight is at most

(††) any proper collection should contain beads, since otherwise its total weight is at most Therefore, any proper collection contains the first bead of the first bag and additional beads and the total number of proper collections is
Final answer
2018!

Techniques

Enumeration with symmetryCounting two waysPigeonhole principle