Skip to main content
OlympiadHQ

Browse · MathNet

Print

66th Czech and Slovak Mathematical Olympiad

Czech Republic counting and probability

Problem

Find all positive integers with the following property: Numbers can be split into three disjoint non-empty subsets with mutually different sizes such that, for any pair of subsets, the subset with fewer elements has larger sum of its elements. (A size of a subset is the number of its elements.)
Solution
We first exclude small values of . The three subsets have to have in total at least elements, hence . For , the smallest subset (in size) contains a single number and its sum is therefore at most . The sum of the remaining numbers is at least , hence the sum of at least one of the two remaining subsets is at least , a contradiction. Similarly we exclude and where, again, the smallest subset contains a single number. For the subsets , , satisfy the conditions. For , the smallest subset contains at most numbers and its sum is therefore at most . The sum of the remaining numbers is at least and we reach contradiction as above. Similarly we exclude . Now we describe how to create the subsets for any . Let , , . We fix the sizes of the subsets to , , and define the subsets as follows: Set consists of largest numbers from , that is numbers . Set consists of the next largest numbers (that is, numbers ). The remaining numbers form the subset . We aim to show that has larger sum than . Since all the numbers from are greater than all the numbers from , and has just one more element, it suffices to show that the sum of the three largest numbers of is greater than the sum of the four smallest numbers of . Such three numbers always exist ().

and the desired inequality is equivalent to which, after plugging in rewrites as . This is true as and . Similarly, we show that has larger sum than , which has more elements than : Two largest numbers of have larger sum than smallest numbers of as . The answer is all together with .
Final answer
n = 9 or n ≥ 12

Techniques

Coloring schemes, extremal argumentsGames / greedy algorithmsSums and products