Maths Olympiad Prep

Library / /10 of 10

, 2024

Algebra Difficulty 7.5 National olympiad, round 2 Prove it China

For an integer n4n \ge 4, if a sequence of real numbers x1,x2,,xnx_1, x_2, \dots, x_n satisfies the following three equalities:
x1+x2++xn=n,x12+x22++xn2=2n,x13+x23++xn3=3n, \begin{aligned} x_1 + x_2 + \dots + x_n &= n, \\ x_1^2 + x_2^2 + \dots + x_n^2 &= 2n, \\ x_1^3 + x_2^3 + \dots + x_n^3 &= 3n, \end{aligned}
then we call (x1,x2,,xn)(x_1, x_2, \dots, x_n) a *regular* nn-tuple. We call the difference between the maximal and the minimal elements in x1,x2,,xnx_1, x_2, \dots, x_n the *width* of the regular nn-tuple.

(1) Find the maximal real number CC such that, for any integer n4n \ge 4, the width of every regular nn-tuple is at least CC.

(2) For the maximum CC in (1), prove that there exists a real number λ>0\lambda > 0 such that, for any integer n4n \ge 4, the width of every regular nn-tuple exceeds C+λn1.5C + \frac{\lambda}{n^{1.5}}.

Solution

(1)

Solution 1
We attempt to use the idea of a local inequality to prove that a number aa lies between the minimum and maximum of a regular nn-tuple. To this end, we consider an indeterminate bb and consider the polynomial
f(x)=(xa)(xb)2=x3(a+2b)x2+(2ab+b2)xab2, f(x) = (x - a)(x - b)^2 = x^3 - (a + 2b)x^2 + (2ab + b^2)x - ab^2,
and define
S=k=1nf(xk)=3n(a+2b)2n+(2ab+b2)nab2n. S = \sum_{k=1}^{n} f(x_k) = 3n - (a + 2b) \cdot 2n + (2ab + b^2) \cdot n - ab^2 \cdot n.
We require S=0S = 0 to ensure that f(x1),f(x2),,f(xn)f(x_1), f(x_2), \dots, f(x_n) have both positive and negative values (or are all 0), implying that the numbers x1,x2,,xnx_1, x_2, \dots, x_n include values a\ge a and values a\le a (or x1,,xnx_1, \dots, x_n are all equal to bb). This ensures aa lies between the minimum and maximum values.
Setting S=0S = 0, we obtain the quadratic equation
(1a)b2+(2a4)b+(32a)=0. (1 - a)b^2 + (2a - 4)b + (3 - 2a) = 0.
This equation has real roots if and only if
Δ=(2a4)24(1a)(32a)=4(a2+a+1)0, \Delta = (2a - 4)^2 - 4(1 - a)(3 - 2a) = 4(-a^2 + a + 1) \ge 0,
which is equivalent to 152a1+52\frac{1-\sqrt{5}}{2} \le a \le \frac{1+\sqrt{5}}{2}. Thus, the maximum value 1+52\ge \frac{1+\sqrt{5}}{2} and the minimum value 152\le \frac{1-\sqrt{5}}{2}. The width is therefore 1+52152=5\ge \frac{1+\sqrt{5}}{2} - \frac{1-\sqrt{5}}{2} = \sqrt{5}.
On the other hand, we can construct a regular nn-tuple whose width approaches 5\sqrt{5} arbitrarily closely.
Take positive integers u1,v1,u2,v2u_1, v_1, u_2, v_2 such that v1u1>512>v2u2\frac{v_1}{u_1} > \frac{\sqrt{5}-1}{2} > \frac{v_2}{u_2}.
Define the first group (multiset) to include u12u_1^2 instances of 1+v1u11 + \frac{v_1}{u_1} and v12v_1^2 instances of 1u1v11 - \frac{u_1}{v_1}. The mean of these u12+v12u_1^2 + v_1^2 numbers is 1, the mean square is 2, and the mean cube is 4+(v1u1u1v1)>34 + \left( \frac{v_1}{u_1} - \frac{u_1}{v_1} \right) > 3.

Define the second group (multiset) to include u22u_2^2 instances of 1+v2u21 + \frac{v_2}{u_2} and v22v_2^2 instances of 1u2v21 - \frac{u_2}{v_2}. The mean of these u22+v22u_2^2 + v_2^2 numbers is 1, the mean square is 2, and the mean cube is 4+(v2u2u2v2)<34 + \left(\frac{v_2}{u_2} - \frac{u_2}{v_2}\right) < 3.
By combining sufficient numbers of the first and second groups, the overall mean cube can be made exactly 3, and the width (1+v1u1)(1u2v2)=v1u1+u2v2(1 + \frac{v_1}{u_1}) - (1 - \frac{u_2}{v_2}) = \frac{v_1}{u_1} + \frac{u_2}{v_2} can approach 5\sqrt{5} arbitrarily closely.
Hence, the largest possible real number C=5C = \sqrt{5}. \square

Solution 2
(The construction of regular nn-tuples is the same as in Solution 1.)
Let AA and BB denote the minimum and maximum values among x1,x2,,xnx_1, x_2, \dots, x_n, respectively.
For each xkA0x_k - A \ge 0, applying the Cauchy–Schwarz inequality, we have
k=1n(xkA)k=1n(xkA)3(k=1n(xkA)2)2. \sum_{k=1}^{n} (x_k - A) \cdot \sum_{k=1}^{n} (x_k - A)^3 \ge \left( \sum_{k=1}^{n} (x_k - A)^2 \right)^2 .
Substituting
k=1n(xkA)=(k=1nxk)nA=nnA,k=1n(xkA)2=2n2nA+nA2,k=1n(xkA)3=3n6nA+3nA2nA3, \begin{align*} \sum_{k=1}^{n} (x_k - A) &= \left(\sum_{k=1}^{n} x_k\right) - nA = n - nA, \\ \sum_{k=1}^{n} (x_k - A)^2 &= 2n - 2nA + nA^2, \\ \sum_{k=1}^{n} (x_k - A)^3 &= 3n - 6nA + 3nA^2 - nA^3, \end{align*}
we find that
(1A)(36A+3A2A3)(22A+A2)2=A2A10. (1 - A)(3 - 6A + 3A^2 - A^3) - (2 - 2A + A^2)^2 = A^2 - A - 1 \ge 0.
Solving, we obtain A152A \le \frac{1-\sqrt{5}}{2}.
Similarly, using the same inequality for Bxk0B - x_k \ge 0, we find that B1+52B \ge \frac{1+\sqrt{5}}{2}.
Thus, the width BA5B - A \ge \sqrt{5}. If we have an equality, then A=152A = \frac{1-\sqrt{5}}{2}, B=1+52B = \frac{1+\sqrt{5}}{2}, and all x1,,xnx_1, \dots, x_n are either AA or BB. This requires 5510n\frac{5-\sqrt{5}}{10}n numbers equal to AA and 5+510n\frac{5+\sqrt{5}}{10}n numbers equal to BB, which cannot hold if nn is not divisible by 10. Therefore, the width BA>5B - A > \sqrt{5}. \square

(2)

Consider a linear transformation that maps the approximate minimum value 152\frac{1-\sqrt{5}}{2} to 0 and the approximate maximum value 1+52\frac{1+\sqrt{5}}{2} to 1. Let zi=xi1525z_i = \frac{x_i - \frac{1-\sqrt{5}}{2}}{\sqrt{5}}, i.e., xi=152+5zix_i = \frac{1-\sqrt{5}}{2} + \sqrt{5}z_i. Denote p=5+510=5+125p = \frac{5+\sqrt{5}}{10} = \frac{\sqrt{5}+1}{2\sqrt{5}}. Then, we have
z1+z2++zn=pn,z12+z22++zn2=pn,z13+z23++zn3=pn. z_1 + z_2 + \dots + z_n = pn, \quad z_1^2 + z_2^2 + \dots + z_n^2 = pn, \quad z_1^3 + z_2^3 + \dots + z_n^3 = pn.
Let x\|x\| denote the distance of a real number xx to the nearest integer. It is well-known that x+yx+y\|x + y\| \le \|x\| + \|y\| for any real numbers x,yx, y. Let mm be the integer closest to pnpn, then
pn=m5+125n=(2mn)5n25=4255m25mn+n2(2mn)5+n42512n+1. \|pn\| = \left| m - \frac{\sqrt{5}+1}{2\sqrt{5}}n \right| = \frac{\left| (2m-n)\sqrt{5} - n \right|}{2\sqrt{5}} = \frac{4}{2\sqrt{5}} \cdot \frac{\left| 5m^2 - 5mn + n^2 \right|}{(2m-n)\sqrt{5} + n} \ge \frac{4}{2\sqrt{5}} \cdot \frac{1}{2n+1}.

From (1), we know that the maximum of z1,z2,,znz_1, z_2, \dots, z_n is 1\ge 1, and the minimum is 0\le 0. Let the difference between the maximum and minimum values be 1+δ1 + \delta, so z1,z2,,zn[δ,1+δ]z_1, z_2, \dots, z_n \in [-\delta, 1 + \delta]. We aim to prove that δ>λ5n1.5\delta > \frac{\lambda}{\sqrt{5 n^{1.5}}}. First, assume δ12\delta \le \frac{1}{2}.
Consider the polynomial h(z)=13z2+2z3=(1+2z)(1z)2h(z) = 1 - 3z^2 + 2z^3 = (1 + 2z)(1 - z)^2.
When z[δ,12]z \in [-\delta, \frac{1}{2}], z=z\|z\| = |z|, we have
h(z)1h(z)=(32z)z2(3+2δ)z24z2=4z2. \|h(z)\| \le |1 - h(z)| = (3 - 2z)z^2 \le (3 + 2\delta)z^2 \le 4z^2 = 4\|z\|^2.
When z[12,1+δ]z \in [\frac{1}{2}, 1 + \delta], z=z1\|z\| = |z - 1|, we have
h(z)h(z)=(1+2z)(1z)2(3+2δ)(1z)24(1z)2=4z2. \|h(z)\| \le |h(z)| = (1 + 2z)(1 - z)^2 \le (3 + 2\delta)(1 - z)^2 \le 4(1 - z)^2 = 4\|z\|^2.
Thus, in all cases, h(zk)4zk2\|h(z_k)\| \le 4\|z_k\|^2.
Since k=1nh(zk)=n3pn+2pn=npn\sum_{k=1}^n h(z_k) = n - 3 \cdot pn + 2 \cdot pn = n - pn, it follows that
k=1nh(zk)pn, \sum_{k=1}^{n} \|h(z_k)\| \ge \|pn\|,
and
(z1+z2++zn)2z12+z22++zn214pn. (\|z_1\| + \|z_2\| + \cdots + \|z_n\|)^2 \ge \|z_1\|^2 + \|z_2\|^2 + \cdots + \|z_n\|^2 \ge \frac{1}{4} \|pn\|.
On the other hand, consider the polynomial g(z)=2z(1z)g(z) = 2z(1 - z).
When z[0,1]z \in [0, 1], we have g(z)=2z(1z)max{z,1z}=zg(z) = 2z(1 - z) \ge \max\{z, 1 - z\} = \|z\|.
When z[δ,0][1,1+δ]z \in [-\delta, 0] \cup [1, 1 + \delta], we have g(z)2(δ+δ2)z4δg(z) \ge -2(\delta + \delta^2) \ge \|z\| - 4\delta.
Thus, g(zk)zk4δg(z_k) \le \|z_k\| - 4\delta.
Since k=1ng(zk)=2k=1nzk2k=1nzk2=0\sum_{k=1}^n g(z_k) = 2 \sum_{k=1}^n z_k - 2 \sum_{k=1}^n z_k^2 = 0, we have
4nδk=1nzk14pn12512n+1>111n. 4n\delta \ge \sum_{k=1}^{n} \|z_k\| \ge \sqrt{\frac{1}{4} \|pn\|} \ge \sqrt{\frac{1}{2\sqrt{5}} \cdot \frac{1}{2n+1}} > \sqrt{\frac{1}{11n}}.
Thus, δ>14111n1.5>165n1.5.\delta > \frac{1}{4\sqrt{11}} \cdot \frac{1}{n^{1.5}} > \frac{1}{6\sqrt{5n^{1.5}}}.

Hence, the width of the regular nn-tuple (x1,x2,,xn)(x_1, x_2, \dots, x_n) satisfies >5+16n1.5> \sqrt{5} + \frac{1}{6n^{1.5}}, and λ=16\lambda = \frac{1}{6} meets the requirement. \square

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.