Browse · MathNet
Print69th Belarusian Mathematical Olympiad
Belarus counting and probability
Problem
The sum of several (not necessarily different) real numbers from does not exceed . Find the maximal value of such that it is always possible to partition these numbers into two groups with sums not greater than .
Solution
Answer: .
First we will show that if , the required partition can be impossible. Indeed, let , . Suppose that we are given numbers equal to . It is evident that for any partition some of the groups will contain at least of these numbers. But then the sum of the numbers in this group is not less than , which is forbidden.
Now let . We will prove that the required partition exists for any such , which will imply . Consider all sums of (some of) the given numbers such that , and let be the maximal sum (if such sums don't exist, there is nothing to prove). For any remaining number holds . Consider the next two cases:
Case 1: . The sum of all remaining numbers doesn't exceed and we can make the required partition into two groups with the sums and .
Case 2: . Let , . If there are not more than nine numbers left, then their sum doesn't exceed and we can form the second group from them. Suppose that there are at least ten numbers left. Since for any remaining number holds and , we have . Hence . But then - a contradiction.
First we will show that if , the required partition can be impossible. Indeed, let , . Suppose that we are given numbers equal to . It is evident that for any partition some of the groups will contain at least of these numbers. But then the sum of the numbers in this group is not less than , which is forbidden.
Now let . We will prove that the required partition exists for any such , which will imply . Consider all sums of (some of) the given numbers such that , and let be the maximal sum (if such sums don't exist, there is nothing to prove). For any remaining number holds . Consider the next two cases:
Case 1: . The sum of all remaining numbers doesn't exceed and we can make the required partition into two groups with the sums and .
Case 2: . Let , . If there are not more than nine numbers left, then their sum doesn't exceed and we can form the second group from them. Suppose that there are at least ten numbers left. Since for any remaining number holds and , we have . Hence . But then - a contradiction.
Final answer
17.1
Techniques
Pigeonhole principleColoring schemes, extremal argumentsLinear and quadratic inequalities