Maths Olympiad Prep

Library / /5 of 10

, 2017

Combinatorics Difficulty 6.8 National olympiad Prove it Canada

Let nn be a positive integer, and define Sn={1,2,,n}S_n = \{1, 2, \dots, 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}\{7\}, {2,5}\{2, 5\}, {2,3,4}\{2, 3, 4\}, {5,6,8,9}\{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 \ge 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 44, 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.)

Solutions — 2

Solution 1

The problem is to prove that there is an odd number of nonempty subsets TT of SnS_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 TT, 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 TT with TT^* yields that there are an even number of sets TT such that A(T)=M(T)A(T) = M(T) and TTT \neq T^*.

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

Solution 2

Using the notation from the above solution: Let BB be the number of subsets TT with M(T)>A(T)M(T) > A(T), CC be the number with M(T)=A(T)M(T) = A(T), and DD be the number with M(T)<A(T)M(T) < A(T). Pairing each set TT counted by BB with T={n+1t:tT}T^* = \{n+1-t: t \in T\} shows that B=DB = D. Now since B+C+D=2n1B + C + D = 2^n - 1, we have that C=2n12BC = 2^n - 1 - 2B, which is odd.

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: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.