Browse · MathNet
Print69th Belarusian Mathematical Olympiad
Belarus counting and probability
Problem
The sum of several (not necessarily different) positive integers not exceeding is equal to . Find all possible values of such that these numbers can always be partitioned into two groups with the sums of the numbers in each group not exceeding .
Solution
Answer: . Clearly . Suppose that and let , where . Consider the next collection: numbers equal and numbers equal (the total sum equals ). At least nine of these numbers will be in the same group. But the sum of nine smallest numbers is at least — a contradiction.
It remains to prove that any collection of positive integers not exceeding with the sum can be partitioned as required. We will successive put numbers to the first group (in an arbitrary order), and at some moment the sum of all numbers of this group will satisfy two conditions: 1) ; and 2) for any remaining number . If , then and we can form the second group from all remaining numbers. If , then and the inequality implies that all remaining numbers equal . There are not more than eight numbers left (otherwise , since ). Hence we can form the second group from them.
It remains to prove that any collection of positive integers not exceeding with the sum can be partitioned as required. We will successive put numbers to the first group (in an arbitrary order), and at some moment the sum of all numbers of this group will satisfy two conditions: 1) ; and 2) for any remaining number . If , then and we can form the second group from all remaining numbers. If , then and the inequality implies that all remaining numbers equal . There are not more than eight numbers left (otherwise , since ). Hence we can form the second group from them.
Final answer
S ≤ 152
Techniques
Pigeonhole principleGames / greedy algorithms