Maths Olympiad Prep

Library / /94 of 136

Algebra Difficulty 8.2 Shortlist Prove it Hong Kong

Let xx, yy, zz be positive real numbers such that x+y+z=1x + y + z = 1. For positive integer nn, define Sn=xn+yn+znS_n = x^n + y^n + z^n. Furthermore, let P=S2S2005P = S_2 S_{2005} and Q=S3S2004Q = S_3 S_{2004}.

a. Find the smallest possible value of QQ.

b. If xx, yy, zz are pairwise distinct, determine whether PP or QQ is larger.

Solution

a. The smallest possible value of QQ is 132005\frac{1}{3^{2005}}.
By the power mean inequality, we have
Sn3(S13)n=13n1 S_n \ge 3 \left(\frac{S_1}{3}\right)^n = \frac{1}{3^{n-1}}
for any positive integer nn. Therefore, we have
Q=S3S2004132132003=132005. Q = S_3 S_{2004} \ge \frac{1}{3^2} \cdot \frac{1}{3^{2003}} = \frac{1}{3^{2005}}.
Equality holds when x=y=z=13x = y = z = \frac{1}{3}. Therefore, the minimum value of QQ is 132005\frac{1}{3^{2005}}.

b. PP is larger than QQ.
Indeed, we have
PQ(x2+y2+z2)(x2005+y2005+z2005)(x3+y3+z3)(x2004+y2004+z2004)symx2005y2symx2004y3. \begin{align*} P \ge Q & \Leftrightarrow (x^2 + y^2 + z^2)(x^{2005} + y^{2005} + z^{2005}) \ge (x^3 + y^3 + z^3)(x^{2004} + y^{2004} + z^{2004}) \\ & \Leftrightarrow \sum_{\text{sym}} x^{2005} y^2 \ge \sum_{\text{sym}} x^{2004} y^3. \end{align*}

This is true by Muirhead's theorem. Equality holds when x=y=zx = y = z. Since it is given that xx, yy, zz are pairwise distinct, the inequality is strict, and hence P>QP > Q.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.