Olympiad Maths Prep

Library / /10 of 14

Algebra Difficulty 6.5 National olympiad Prove it Czech Republic

Let xx, yy and zz be any positive real numbers. Prove the inequality
(x+y+z)(1x+1y+1z)m2,where m=min(xy+yz+zx,yx+zy+xz). (x + y + z) \left( \frac{1}{x} + \frac{1}{y} + \frac{1}{z} \right) \le m^2, \quad \text{where } m = \min \left( \frac{x}{y} + \frac{y}{z} + \frac{z}{x}, \frac{y}{x} + \frac{z}{y} + \frac{x}{z} \right).
Find when the equality holds.

Solution

Since the inequality involves the minimum of two positive numbers and since the function y=x2y = x^2 is increasing on the set R+\mathbb{R}^+, our task is to verify
(x+y+z)(1x+1y+1z)(xy+yz+zx)2and(x+y+z)(1x+1y+1z)(yx+xz+zy)2,(1) (x+y+z)\left(\frac{1}{x}+\frac{1}{y}+\frac{1}{z}\right) \le \left(\frac{x}{y}+\frac{y}{z}+\frac{z}{x}\right)^2 \quad \text{and} \quad (x+y+z)\left(\frac{1}{x}+\frac{1}{y}+\frac{1}{z}\right) \le \left(\frac{y}{x}+\frac{x}{z}+\frac{z}{y}\right)^2, \quad (1)

as well as to find when *at least one* equality in (1) holds. Replacing a triple (xx, yy, zz)
by the triple (yy, xx, zz), we get the second inequality in (1) from the first one. Thus we
can restrict to the proof of the first inequality. Distributing both sides leads to
3+xy+xz+yx+yz+zx+zyx2y2+y2z2+z2x2+2(xz+yx+zy). 3 + \frac{x}{y} + \frac{x}{z} + \frac{y}{x} + \frac{y}{z} + \frac{z}{x} + \frac{z}{y} \le \frac{x^2}{y^2} + \frac{y^2}{z^2} + \frac{z^2}{x^2} + 2\left(\frac{x}{z} + \frac{y}{x} + \frac{z}{y}\right).
Let us introduce the new (positive) variables a=x/ya = x/y, b=y/zb = y/z, c=z/xc = z/x and rewrite
the last inequality as
(a21a+1a)+(b21b+1b)+(c21c+1c)0.(2) \left(a^2 - 1 - a + \frac{1}{a}\right) + \left(b^2 - 1 - b + \frac{1}{b}\right) + \left(c^2 - 1 - c + \frac{1}{c}\right) \ge 0. \quad (2)
For any positive tt, we notice that
t21t+1t=(t21)t21t=(t21)(t1)t=(t1)2(t+1)t. t^2 - 1 - t + \frac{1}{t} = (t^2 - 1) - \frac{t^2 - 1}{t} = \frac{(t^2 - 1)(t - 1)}{t} = \frac{(t - 1)^2(t + 1)}{t}.
This implies that (2) holds as well and that (2) becomes an equality if and only if a=b=c=1a = b = c = 1, i.e. x=y=zx = y = z for the original variables. Note that the last condition does not change under transformation (x,y,z)(y,x,z)(x, y, z) \to (y, x, z). Thus the original inequality is proven and becomes an equality if and only x=y=zx = y = z.

Looking for a route rather than 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.