Browse · MathNet
Print59th Ukrainian National Mathematical Olympiad
Ukraine counting and probability
Problem
Number was split into (not necessarily different) positive integer additive terms. After that, we list all different numbers that can be obtained from adding some of these terms (from one to eight). What is the minimum number of numbers listed?
Solution
Let us split into numbers and one number . In this case, the sum of some terms can have different values: , , , , and .
Let us prove that it is impossible to obtain less than different numbers. Since does not divide , a split of results in at least different terms. Let us sort the terms in ascending order. For the list, we first pick only the st term, then st and nd, then st, nd and rd, and so on, until we pick the first numbers – in this way, we get different numbers. Now we take the last terms: this new sum is larger than any previous sum, therefore, there cannot be fewer than different numbers listed.
Let us prove that it is impossible to obtain less than different numbers. Since does not divide , a split of results in at least different terms. Let us sort the terms in ascending order. For the list, we first pick only the st term, then st and nd, then st, nd and rd, and so on, until we pick the first numbers – in this way, we get different numbers. Now we take the last terms: this new sum is larger than any previous sum, therefore, there cannot be fewer than different numbers listed.
Final answer
9
Techniques
Coloring schemes, extremal arguments