Maths Olympiad Prep

Library / /46 of 57

, 2008

Algebra Difficulty 6.4 National Olympiad Prove it JBMO

Problem:
Kostas and Helene have the following dialogue:
Kostas: I have in my mind three positive real numbers with product 11 and sum equal to the sum of all their pairwise products.
Helene: I think that I know the numbers you have in mind. They are all equal to 11.
Kostas: In fact, the numbers you mentioned satisfy my conditions, but I did not think of these numbers. The numbers you mentioned have the minimal sum between all possible solutions of the problem.
Can you decide if Kostas is right? (Explain your answer).

Solution

Solution:
Kostas is right according to the following analysis:
If x,y,zx, y, z are the three positive real numbers Kostas thought about, then they satisfy the following equations:
xy+yz+zx=x+y+zxyz=1 \begin{gathered} x y + y z + z x = x + y + z \\ x y z = 1 \end{gathered}
Subtracting (1) from (2) by parts we obtain
xyz(xy+yz+zx)=1(x+y+z)xyzxyyzzx+x+y+z1=0xy(z1)x(z1)y(z1)+(z1)=0(z1)(xyxy+1)=0(z1)(x1)(y1)=0x=1 or y=1 or z=1. \begin{gathered} x y z - (x y + y z + z x) = 1 - (x + y + z) \\ \Leftrightarrow x y z - x y - y z - z x + x + y + z - 1 = 0 \\ \Leftrightarrow x y(z-1) - x(z-1) - y(z-1) + (z-1) = 0 \\ \Leftrightarrow (z-1)(x y - x - y + 1) = 0 \\ (z-1)(x-1)(y-1) = 0 \\ \Leftrightarrow x=1 \text{ or } y=1 \text{ or } z=1 . \end{gathered}
For x=1x=1, from (1) and (2) we have the equation yz=1y z=1, which has the solutions
(y,z)=(a,1a), a>0 (y, z) = \left(a, \frac{1}{a}\right), \ a>0
And therefore the solutions of the problem are the triples
(x,y,z)=(1,a,1a), a>0 (x, y, z) = \left(1, a, \frac{1}{a}\right), \ a>0
Similarly, considering y=1y=1 or z=1z=1 we get the solutions
(x,y,z)=(a,1,1a) or (x,y,z)=(a,1a,1), a>0 (x, y, z) = \left(a, 1, \frac{1}{a}\right) \text{ or } (x, y, z) = \left(a, \frac{1}{a}, 1\right), \ a>0
Since for each a>0a>0 we have
x+y+z=1+a+1a1+2=3 x + y + z = 1 + a + \frac{1}{a} \geq 1 + 2 = 3
and equality is valid only for a=1a=1, we conclude that among the solutions of the problem, the triple (x,y,z)=(1,1,1)(x, y, z) = (1, 1, 1) is the one whose sum x+y+zx + y + z is minimal.

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.