IMO ShortList 2008, Combinatorics problem 5
Source: IMO ShortList 2008, Combinatorics problem 5, German TST 2, P3, 2009
July 9, 2009
combinatoricsProbabilistic MethodcountingIMO Shortlist
Problem Statement
Let S \equal{} \{x_1, x_2, \ldots, x_{k \plus{} l}\} be a (k \plus{} l)-element set of real numbers contained in the interval ; and are positive integers. A -element subset is called nice if
\left |\frac {1}{k}\sum_{x_i\in A} x_i \minus{} \frac {1}{l}\sum_{x_j\in S\setminus A} x_j\right |\le \frac {k \plus{} l}{2kl}
Prove that the number of nice subsets is at least \dfrac{2}{k \plus{} l}\dbinom{k \plus{} l}{k}.
Proposed by Andrey Badzyan, Russia