CombinatoricsDifficulty 6.2Prove itBelarus — Final Round · Belarus
Find all positive integers n (n<24) such that the set M={n,n+1,…,24} can be partitioned into some 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)
This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.
A number a from a subset of the desired partition is called major if a 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 k be the number of the subsets of the desired partition. Since we have 25−n numbers in the initial set M={n,n+1,…,24}, we have k≤325−n. On the other hand, if a is the major number of some subset, then the sum of the numbers of this subset is equal to 2a. So the sum S(n) of all numbers of the set M must be even than or equal to 2⋅(24+23+22+⋯+(25−k))=2⋅2(24+25−k)⋅k=(49−k)⋅k≤≤(49−325−n)⋅325−n=9(122+n)(25−n). (The last inequality holds because k≤25−n/3≤49/2, and the function (49−x)x increases for x≤49/2.) Therefore, the following condition is necessary to exist the desired partition: S(n)≤9(122+n)(25−n)⟺2(n+24)(25−n)≤9(122+n)(25−n)⟺9(n+24)≤2(122+n)⟺n≤4. For n=2 and n=3 we see that both the sums S(2)=2(2+24)(25−2)=13⋅23,S(3)=2(3+24)(25−3)=27⋅11 are odd, so the desired partitions do not exist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.