olymmath

CMO 2017 Problem 3

  • Paper

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 n≥1n \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. ))

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator ca-cmo/2017/p3 · Tag P4XV84DZN1 · Edit this page on GitHub · Keys: j next, k previous