Maths Olympiad Prep

Library / /4 of 18

Algebra Difficulty 6.0 National olympiad Prove it China

Determine the largest real number CC such that
i=1nj=1n(nij)xixjCi=1nxi2 \sum_{i=1}^{n} \sum_{j=1}^{n} (n - |i - j|) x_i x_j \ge C \sum_{i=1}^{n} x_i^2
holds for every positive integer nn and any real numbers x1,x2,,xnx_1, x_2, \dots, x_n.

Solution

The needed constant C=12C = \frac{1}{2}. First show that C=12C = \frac{1}{2} holds. Note that
L.H.S. of (*)=x12+(x1+x2)2++(x1+x2++xn)2+(x2++xn)2++(xn1+xn)2+xn2.(1) \text{L.H.S. of (*)} = x_1^2 + (x_1 + x_2)^2 + \dots + (x_1 + x_2 + \dots + x_n)^2 \\ \qquad + (x_2 + \dots + x_n)^2 + \dots + (x_{n-1} + x_n)^2 + x_n^2. \quad (1)
Using the inequality a2+(a+b)2=a2+(ab)212b2a^2 + (a+b)^2 = a^2 + (-a-b)^2 \geq \frac{1}{2}b^2, we get
12(x12+(x1+x2)2)14x22,12((x1+x2)2+(x1+x2+x3)2)14x32,12((x1++xn1)2+(x1++xn)2)14xn2,12((x1++xn1)2+(x2++xn)2)14x12,12((xn1+xn)2+xn2)14xn12. \begin{aligned} \frac{1}{2}(x_1^2 + (x_1 + x_2)^2) &\geq \frac{1}{4}x_2^2, \\ \frac{1}{2}((x_1 + x_2)^2 + (x_1 + x_2 + x_3)^2) &\geq \frac{1}{4}x_3^2, \\ \dots &\geq \dots \\ \frac{1}{2}((x_1 + \dots + x_{n-1})^2 + (x_1 + \dots + x_n)^2) &\geq \frac{1}{4}x_n^2, \\ \frac{1}{2}((x_1 + \dots + x_{n-1})^2 + (x_2 + \dots + x_n)^2) &\geq \frac{1}{4}x_1^2, \\ \dots &\geq \dots \\ \frac{1}{2}((x_{n-1} + x_n)^2 + x_n^2) &\geq \frac{1}{4}x_{n-1}^2. \end{aligned}
Summing the above and use (1) to get
L.H.S. of (*)34x12+12(x22++xn12)+34xn212(x12++xn2). \text{L.H.S. of (*)} \geq \frac{3}{4}x_1^2 + \frac{1}{2}(x_2^2 + \dots + x_{n-1}^2) + \frac{3}{4}x_n^2 \geq \frac{1}{2}(x_1^2 + \dots + x_n^2).
i.e. the inequality (*) holds for C=12C = \frac{1}{2}.

Next, we prove that, if the inequality (*) holds for all nn, then C12C \leq \frac{1}{2}. In (1), take x1=1,x2=2,x3=2,,xn1=(1)n22,xn=(1)n1x_1 = 1, x_2 = -2, x_3 = 2, \dots, x_{n-1} = (-1)^{n-2}2, x_n = (-1)^{n-1}, then every square in () is equal to 1, i.e. the R.H.S. of () is equal to 2n22n-2. Yet
i=1nxi2=4(n2)+2=4n6. \sum_{i=1}^{n} x_i^2 = 4(n-2) + 2 = 4n - 6.
So,
C2n24n6=12+12n3. C \leq \frac{2n-2}{4n-6} = \frac{1}{2} + \frac{1}{2n-3}.
Letting nn \to \infty gives C12C \leq \frac{1}{2}.

To sum up, the maximal C=12C = \frac{1}{2}.

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.