Browse · MathNet
PrintFINAL ROUND
Belarus counting and probability
Problem
Find all positive integers () such that the set can be partitioned into disjoint subsets so that in each subset one of the numbers is equal to the sum of all other numbers of this subset. (V. Kaskevich)
Solution
A number from a subset of the desired partition is called major if is equal to the sum of all other numbers of this subset. All numbers in each subset must be distinct, since one of them is major we see that there exist at least three numbers in each subset. Let be the number of the subsets of the desired partition. Since we have numbers in the initial set , we have . On the other hand, if is the major number of some subset, then the sum of the numbers of this subset is equal to . So the sum of all numbers of the set must be even
(, and the sum of all numbers of all subsets is less than or equal to (The last inequality holds because and the function increases for .) Therefore, the following condition is necessary to exist the desired partition: i.e., , and since is an integer number, we have . The sum is even, so either or , i.e., . If , then . The number of the subsets is less than or equal to , i.e., . But for these the sum of all numbers in the subsets is less than or equal to , a contradiction. Similarly, if , then , , and , a contradiction.
If we add the subset to the given partition for we obtain the desired partition for .
The desired partitions exist for . The following tables give the examples of the desired partition for and :
If we add the subset to the given partition for we obtain the desired partition for .
(, and the sum of all numbers of all subsets is less than or equal to (The last inequality holds because and the function increases for .) Therefore, the following condition is necessary to exist the desired partition: i.e., , and since is an integer number, we have . The sum is even, so either or , i.e., . If , then . The number of the subsets is less than or equal to , i.e., . But for these the sum of all numbers in the subsets is less than or equal to , a contradiction. Similarly, if , then , , and , a contradiction.
| 60 | 59 | 58 | 57 | 56 | 55 | 54 | 53 | 52 |
| 43 | 41 | 39 | 37 | 35 | 33 | 31 | 29 | 27 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 51 | 50 | 49 | 48 | 47 | 46 | 45 | 44 | 26 |
| 42 | 40 | 38 | 36 | 34 | 32 | 30 | 28 | 8,6 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 7,5 |
| 60 | 59 | 58 | 57 | 56 | 55 | 54 | 53 | 52 |
| 43 | 41 | 39 | 37 | 35 | 33 | 31 | 29 | 27 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 51 | 50 | 49 | 48 | 47 | 46 | 45 | 44 | 28 |
| 42 | 40 | 38 | 36 | 34 | 32 | 30 | 26 | 16 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 | 8,6,4 | 7,5 |
If we add the subset to the given partition for we obtain the desired partition for .
The desired partitions exist for . The following tables give the examples of the desired partition for and :
| 60 | 59 | 58 | 57 | 56 | 55 | 54 | 53 | 52 |
| 43 | 41 | 39 | 37 | 35 | 33 | 31 | 29 | 27 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 51 | 50 | 49 | 48 | 47 | 46 | 45 | 44 | 26 |
| 42 | 40 | 38 | 36 | 34 | 32 | 30 | 28 | 8,6 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 7,5 |
If we add the subset to the given partition for we obtain the desired partition for .
Final answer
1, 4, 5
Techniques
Coloring schemes, extremal argumentsCounting two waysInvariants / monovariantsLinear and quadratic inequalitiesIntegers