Maths Olympiad Prep

Library / /687 of 860

Algebra Difficulty 5.4 AIME, harder Find the answer

Suppose that there are real numbers a,b,c1a, b, c \geq 1 and that there are positive reals x,y,zx, y, z such that ax+by+cz=4xax+yby+zcz=6x2ax+y2by+z2cz=9\begin{aligned} a^{x}+b^{y}+c^{z} & =4 \\ x a^{x}+y b^{y}+z c^{z} & =6 \\ x^{2} a^{x}+y^{2} b^{y}+z^{2} c^{z} & =9 \end{aligned} What is the maximum possible value of cc ?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

The Cauchy-Schwarz inequality states that given 2 sequences of nn real numbers x1,x2,,xnx_{1}, x_{2}, \ldots, x_{n} and y1,y2,,yny_{1}, y_{2}, \ldots, y_{n}, then (x12+x22++xn2)(y12+y22++yn2)(x1y1+x2y2++xnyn)2\left(x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}\right)\left(y_{1}^{2}+y_{2}^{2}+\ldots+y_{n}^{2}\right) \geq\left(x_{1} y_{1}+x_{2} y_{2}+\ldots+x_{n} y_{n}\right)^{2} with equality holding if and only if x1y1=x2y2==xnyn\frac{x_{1}}{y_{1}}=\frac{x_{2}}{y_{2}}=\ldots=\frac{x_{n}}{y_{n}}. Applying this to {ax/2,by/2,cz/2}\left\{a^{x / 2}, b^{y / 2}, c^{z / 2}\right\} and {xax/2,yby/2,zcz/2}\left\{x a^{x / 2}, y b^{y / 2}, z c^{z / 2}\right\} yields (ax+by+cz)(x2ax+y2by+z2cz)(xax+yby+zbz)2\left(a^{x}+b^{y}+c^{z}\right)\left(x^{2} a^{x}+y^{2} b^{y}+z^{2} c^{z}\right) \geq\left(x a^{x}+y b^{y}+z b^{z}\right)^{2} with equality holding if and only if x=y=zx=y=z. However, equality does hold (both sides evaluate to 36), so x=y=zx=y=z. The second equation then becomes x(ax+bx+cx)=6x\left(a^{x}+b^{x}+c^{x}\right)=6, which implies x=32x=\frac{3}{2}. Then we have a3/2+b3/2+c3/2=4a^{3 / 2}+b^{3 / 2}+c^{3 / 2}=4. To maximize cc, we minimize aa and bb by setting a=b=1a=b=1. Then c3/2=2c^{3 / 2}=2 or c=43c=\sqrt[3]{4}.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.