olymmath

ISL 2008 C5

Let S={x1,x2,…,xk+ℓ}S=\left\{x_{1}, x_{2}, \ldots, x_{k+\ell}\right\} be a (k+ℓ)(k+\ell)-element set of real numbers contained in the interval [0,1];k[0,1] ; k and ℓ\ell are positive integers. A kk-element subset A⊂SA \subset S is called nice if ∣1k∑xi∈Axi−1ℓ∑xj∈S\Axj∣≤k+ℓ2kℓ.\left|\frac{1}{k} \sum_{x_{i} \in A} x_{i}-\frac{1}{\ell} \sum_{x_{j} \in S \backslash A} x_{j}\right| \leq \frac{k+\ell}{2 k \ell} . Prove that the number of nice subsets is at least 2k+ℓ(k+ℓk)\frac{2}{k+\ell}\left(\begin{array}{c}k+\ell \\ k\end{array}\right).

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2008 Shortlist booklet, page 27.

Show the answer

\frac{2}{k+\ell}\left(\begin{array}{c}k+\ell \ k\end{array}\right)

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2008/c5 · Tag N7TGEGT4E8 · Edit this page on GitHub · Keys: j next, k previous