Maths Olympiad Prep

Library / China Team Selection Test for IMO /3 of 8

China Team Selection Test for IMO, 2022

Combinatorics Difficulty 8.1 Shortlist Prove it China

Given a positive integer nn, find all nn-tuples of real numbers (x1,x2,…,xn)(x_1, x_2, \dots, x_n) such that
f(x1,x2,…,xn)=∑k1=02∑k2=02⋯∑kn=02∣k1x1+k2x2+⋯+knxn−1∣ f(x_1, x_2, \dots, x_n) = \sum_{k_1=0}^{2} \sum_{k_2=0}^{2} \cdots \sum_{k_n=0}^{2} \left| k_1 x_1 + k_2 x_2 + \cdots + k_n x_n - 1 \right|
attains its minimum.

Solution

We divide the set A={0,1,2}nA = \{0, 1, 2\}^n into: A=A0∪A1∪⋯∪A2nA = A_0 \cup A_1 \cup \cdots \cup A_{2n}, where
Ak={β=(i1,i2,…,in)∈A:i1+i2+⋯+in=k},k=0,1,…,2n. A_k = \{\beta = (i_1, i_2, \dots, i_n) \in A : i_1 + i_2 + \dots + i_n = k\}, \quad k = 0, 1, \dots, 2n.
Let aka_k denote the number of elements in AkA_k. Then
(1+t+t2)n=a0+a1t+⋯+antn+⋯+a2nt2n,a2n−k=ak. (1 + t + t^2)^n = a_0 + a_1 t + \cdots + a_n t^n + \cdots + a_{2n} t^{2n}, \quad a_{2n-k} = a_k.
Set X=(x1,…,xn)X = (x_1, \dots, x_n) and y=(x1+⋯+xn)/ny = (x_1 + \dots + x_n)/n. Then f(X)=∑k=02n∑β∈Ak∣β⋅X−1∣f(X) = \sum_{k=0}^{2n} \sum_{\beta \in A_k} |\beta \cdot X - 1|. Removing the absolute value signs and summing them in groups, we consider
Bk=∑β∈Ak(β⋅X−1)=k∣Ak∣n(x1+⋯+xn)−∣Ak∣=kaky−ak. B_k = \sum_{\beta \in A_k} (\beta \cdot X - 1) = \frac{k|A_k|}{n}(x_1 + \dots + x_n) - |A_k| = k a_k y - a_k.
We estimate ∑k=02n∣Bk∣\sum_{k=0}^{2n} |B_k|, by canceling appropriate terms. Consider the sizes of kakk a_k and note that
∑k=02nkaktk−1=ddt[(1+t+t2)n]=n(1+2t)(1+t+t2)n−1 \sum_{k=0}^{2n} k a_k t^{k-1} = \frac{d}{dt}[(1+t+t^2)^n] = n(1+2t)(1+t+t^2)^{n-1}
and that the coefficients of (1+t+t2)n−1=∑k=02n−2cktk(1+t+t^2)^{n-1} = \sum_{k=0}^{2n-2} c_k t^k (c0,c1,…,cn−1,…,c2n−2)(c_0, c_1, \dots, c_{n-1}, \dots, c_{2n-2}) is palindromic. Since kak=ck−1+2ck−2k a_k = c_{k-1} + 2c_{k-2}, we have
(n+1)an+1≥nan≥(n+2)an+2≥(n−1)an−1≥(n+3)an+3≥⋯≥2a2≥2na2n≥1a1. (n+1)a_{n+1} \ge n a_n \ge (n+2)a_{n+2} \ge (n-1)a_{n-1} \ge (n+3)a_{n+3} \ge \dots \ge 2a_2 \ge 2n a_{2n} \ge 1a_1.
This shows that U1:=∑k=0nkak<∑k=n+12nkakU_1 := \sum_{k=0}^n k a_k < \sum_{k=n+1}^{2n} k a_k and U2:=∑k=n+22nkak<∑k=0n+1kakU_2 := \sum_{k=n+2}^{2n} k a_k < \sum_{k=0}^{n+1} k a_k. Choose λ=U1−U2(n+1)an+1∈(−1,1)\lambda = \frac{U_1 - U_2}{(n+1)a_{n+1}} \in (-1, 1), we have
f(X)≥∑k=02n∣Bk∣≥[∑k=0n(−Bk)+λBn+1+∑k=n+22nBk]+(1−∣λ∣)∣Bn+1∣. f(X) \ge \sum_{k=0}^{2n} |B_k| \ge \left[ \sum_{k=0}^n (-B_k) + \lambda B_{n+1} + \sum_{k=n+2}^{2n} B_k \right] + (1 - |\lambda|) |B_{n+1}|.
The coefficient of yy in the above square bracket is −U1+λ(n+1)an+1+U2=0-U_1 + \lambda(n+1)a_{n+1} + U_2 = 0. So the expression in the square bracket is a constant C=∑k=0nak−λan+1+∑k=n+22nakC = \sum_{k=0}^n a_k - \lambda a_{n+1} + \sum_{k=n+2}^{2n} a_k. Therefore, f(X)≥Cf(X) \ge C is always true, and when x1=⋯=xn=1n+1x_1 = \dots = x_n = \frac{1}{n+1}, the equality holds. Moreover, the equality holds precisely when an+1a_{n+1} terms in the formula above are all zero, i.e. the inner product of X=(x1,…,xn)X = (x_1, \dots, x_n) with an arbitrary vector in An+1A_{n+1} is 1. The only such XX is when x1=⋯=xn=1n+1x_1 = \dots = x_n = \frac{1}{n+1}.

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

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.