Maths Olympiad Prep

Library / /415 of 520

Combinatorics Difficulty 7.0 National olympiad, round 2 Prove it

Let nn be a positive integer, and define Sn={1,2,,n}S_{n}=\{1,2, \ldots, n\}. Consider a non-empty subset TT of SnS_{n}. We say that TT is balanced if the median of TT is equal to the average of TT. For example, for n=9n=9, each of the subsets {7},{2,5},{2,3,4},{5,6,8,9}\{7\},\{2,5\},\{2,3,4\},\{5,6,8,9\}, and {1,4,5,7,8}\{1,4,5,7,8\} is balanced; however, the subsets {2,4,5}\{2,4,5\} and {1,2,3,5}\{1,2,3,5\} are not balanced. For each n1n \geq 1, prove that the number of balanced subsets of SnS_{n} is odd.

(To define the median of a set of kk numbers, first put the numbers in increasing order; then the median is the middle number if kk is odd, and the average of the two middle numbers if kk is even. For example, the median of {1,3,4,8,9}\{1,3,4,8,9\} is 4, and the median of {1,3,4,7,8,9}\{1,3,4,7,8,9\} is (4+7)/2=5.5(4+7) / 2=5.5.)

Solution

The problem is to prove that there is an odd number of nonempty subsets T T of Sn S_n such that the average A(T) A(T) and median M(T) M(T) satisfy A(T)=M(T) A(T) = M(T) . Given a subset T T , consider the subset T={n+1t:tT} T^* = \{n+1-t : t \in T\} . It holds that A(T)=n+1A(T) A(T^*) = n+1 - A(T) and M(T)=n+1M(T) M(T^*) = n+1 - M(T) , which implies that if A(T)=M(T) A(T) = M(T) then A(T)=M(T) A(T^*) = M(T^*) . Pairing each set T T with T T^* yields that there are an even number of sets T T such that A(T)=M(T) A(T) = M(T) and TT T \neq T^* .

Thus it suffices to show that the number of nonempty subsets T T such that A(T)=M(T) A(T) = M(T) and T=T T = T^* is odd. Now note that if T=T T = T^* , then A(T)=M(T)=n+12 A(T) = M(T) = \frac{n+1}{2} . Hence it suffices to show the number of nonempty subsets T T with T=T T = T^* is odd. Given such a set T T , let T T' be the largest nonempty subset of {1,2,,n/2} \{1, 2, \ldots, \lceil n / 2 \rceil\} contained in T T . Pairing T T with T T' forms a bijection between these sets T T and the nonempty subsets of {1,2,,n/2} \{1, 2, \ldots, \lceil n / 2 \rceil\} . Thus there are 2n/21 2^{\lceil n / 2 \rceil} - 1 such subsets, which is odd as desired.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.