Olympiad Maths Prep

Library / /4 of 6

Algebra Difficulty 6.4 National olympiad Prove it Czech Republic

Real numbers x,y,zx, y, z satisfy
1x+1y+1z+x+y+z=0 \frac{1}{x} + \frac{1}{y} + \frac{1}{z} + x + y + z = 0
and none of them lies in the open interval (1,1)(-1, 1). Find the maximum value of x+y+zx+y+z.

Solutions — 2

Solution 1

Solution: By changing (x,y,z)(x, y, z) to (x,y,z)(-x, -y, -z), the condition (1) remains valid and the value of x+y+zx+y+z changes sign. Since the ordering of the numbers x,y,zx, y, z is irrelevant and they can not be of the same sign because of (1), we can without the loss of generality assume x>0,y>0x > 0, y > 0, and z<0z < 0, and find the maximum value of V=x+y+zV = |x + y + z|.
We can transform (1) equivalently to
f(x)+f(y)=f(t),wheret:=z>0andf(x)=x+1x, f(x) + f(y) = f(t), \quad \text{where} \quad t := -z > 0 \quad \text{and} \quad f(x) = x + \frac{1}{x},
with x,y,tI:=(1,)x, y, t \in I := (1, \infty). In the following, we shall use the well known fact about the function ff: It is an increasing bijection mapping II onto (2,)(2, \infty) (the trivial proof is omitted here). Applying this, from
f(t)=f(x)+f(y)=x+1x+y+1y>x+y+1x+y=f(x+y) f(t) = f(x) + f(y) = x + \frac{1}{x} + y + \frac{1}{y} > x + y + \frac{1}{x+y} = f(x+y)
we get t>x+yt > x + y, hence x+y+z=x+yt<0x + y + z = x + y - t < 0. Therefore our aim is to maximize the positive expression V=x+y+z=txyV = |x + y + z| = t - x - y.
We will call valid every triple (x,y,t)I3(x, y, t) \in I^3 satisfying f(x)+f(y)=f(t)f(x) + f(y) = f(t). One of the valid triples is (1,1,t0)(1, 1, t_0), with t0>1t_0 > 1 such that f(t0)=4f(t_0) = 4, i. e., t0=2+3t_0 = 2 + \sqrt{3}. For this triple, we have V=3V = \sqrt{3}. We shall show this is the desired maximum. The proof will be based on the following lemma: Whenever (x,y,t)(x, y, t) and (x,y,t)(x, y', t') are valid triples with the same first component xx, and y<yy' < y, we have txy<txyt - x - y < t' - x - y'. If this lemma is true, then, with respect to the symmetry, the similar conclusion holds for the valid triples (x,y,t)(x, y, t) and (x,y,t)(x', y, t') with the same second component yy. Hence, any valid triple (x,y,t)(x, y, t) can be replaced by (x,1,t)(x, 1, t') and then by (1,1,t0)(1, 1, t_0), and the value of VV increases or remains the same during this process, concluding maxV=3\max V = \sqrt{3}. (Moreover, this also implies that (1,1,2+3)(1, 1, 2+\sqrt{3}) is the only valid triple for which the maximum value V=3V = \sqrt{3} is reached.)
To prove the lemma, notice that from
f(t)=f(x)+f(y),f(t)=f(x)+f(y), f(t) = f(x) + f(y), \quad f(t') = f(x) + f(y'),
and from f(y)<f(y)f(y') < f(y) (which is implied by the given assumption y<yy' < y), we have f(x)<f(t)<f(t)f(x) < f(t') < f(t), hence 1<t<t1 < t' < t. Therefore 1<ty<ty1 < t'y' < ty, and from
f(x)=f(t)f(y)=(ty)(11ty)=f(t)f(y)=(ty)(11ty), f(x) = f(t) - f(y) = (t - y) \left( 1 - \frac{1}{ty} \right) = f(t') - f(y') = (t' - y') \left( 1 - \frac{1}{t'y'} \right),
using the estimates
0<11ty<11ty, 0 < 1 - \frac{1}{t'y'} < 1 - \frac{1}{ty},
we obtain ty<tyt - y < t' - y', which is equivalent to the desired txy<txyt - x - y < t' - x - y'. Answer. The maximum value of x+y+zx + y + z is 3\sqrt{3}.

Solution 2

Second solution. We start in the same way as in the previous solution, reducing to the case x1x \ge 1, y1y \ge 1, and z1z \le -1 with maximizing V=x+y+zV = |x + y + z|. From (1) we can express zz as the solution of the quadratic equation
z2+(x+1x+y+1y)z+1=0. z^2 + \left(x + \frac{1}{x} + y + \frac{1}{y}\right) z + 1 = 0.
Since the product of the roots of this equation equals 1, the value of zz lying outside of (1,1)(-1, 1) is, with respect to x1x \ge 1, y1y \ge 1, given by
z=12((x+1x+y+1y)(x+1x+y+1y)24). z = \frac{1}{2} \left( - \left( x + \frac{1}{x} + y + \frac{1}{y} \right) - \sqrt{ \left( x + \frac{1}{x} + y + \frac{1}{y} \right)^2 - 4 } \right).
Therefore we are left to maximize
2V=2xyz=(x+1x+y+1y)24(x1x+y1y). 2V = 2|-x-y-z| = \left| \sqrt{ \left( x + \frac{1}{x} + y + \frac{1}{y} \right)^2 - 4 } - \left( x - \frac{1}{x} + y - \frac{1}{y} \right) \right|.
One can easily check that the expression inside of the last bars is positive. It remains
to show that
(x+1x+y+1y)24(x1x+y1y)23. \sqrt{\left(x + \frac{1}{x} + y + \frac{1}{y}\right)^2 - 4} - \left(x - \frac{1}{x} + y - \frac{1}{y}\right) \le 2\sqrt{3}.
This inequality is equivalent (after rearranging, checking the positivity of both sides, canceling the square root, and simple calculations) to
(x+1x+y+1y)2423+(x1x+y1y),x2+y2+3x+3y2xy+3x2y+3xy2, \sqrt{\left(x + \frac{1}{x} + y + \frac{1}{y}\right)^2 - 4} \le 2\sqrt{3} + \left(x - \frac{1}{x} + y - \frac{1}{y}\right), \\ x^2 + y^2 + \sqrt{3}x + \sqrt{3}y \le 2xy + \sqrt{3}x^2y + \sqrt{3}xy^2,
which is true, since it is the sum of the inequalities
x2x2y,y2xy2,3x(31)x2y+xy,and3y(31)xy2+xy, x^2 \le x^2 y, \quad y^2 \le xy^2, \quad \sqrt{3}x \le (\sqrt{3}-1)x^2y + xy, \quad \text{and} \quad \sqrt{3}y \le (\sqrt{3}-1)xy^2 + xy,
and these are trivially valid for x,y1x, y \ge 1.

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.