Problem: Let x, y, z be positive real numbers such that x+y+z=x1+y1+z1.
a) Prove the inequality x+y+z≥2xy+1+2yz+1+2zx+1
b) When does the equality hold?
Solution
Solution:
a. We rewrite the inequality as (xy+1+yz+1+zx+1)2≤2⋅(x+y+z)2 and note that, from CBS, LHS≤(xxy+1+yyz+1+zzx+1)(x+y+z) But xxy+1+yyz+1+zzx+1=x+y+z+x1+y1+z1=2(x+y+z) which proves (1).
b. The equality occurs when we have equality in CBS, i.e. when x2xy+1=y2yz+1=z2zx+1(=x2+y2+z2xy+yz+zx+3) Since we can also write (xy+1+yz+1+zx+1)2≤(yxy+1+zyz+1+xzx+1)(y+z+x)=2(x+y+z)2 the equality implies also y2xy+1=z2yz+1=x2zx+1(=x2+y2+z2xy+yz+zx+3) But then x=y=z, and since x+y+z=x1+y1+z1, we conclude that x=x1=1=y=z.
Alternative solution to b): The equality condition x2xy+1=y2yz+1=z2zx+1 can be rewritten as xy+x1=yz+y1=zx+z1=x+y+zx+y+z+x1+y1+z1=2 and thus we obtain the system: ⎩⎨⎧y=2x−x1z=2y−y1x=2z−z1 We show that x=y=z. Indeed, if for example x>y, then 2x−x1>2y−y1, that is, y>z and z=2y−y1>2z−z1=x, and we obtain the contradiction x>y>z>x. Similarly, if x<y, we obtain x<y<z<x. Hence, the numbers are equal, and as above we get x=y=z=1.
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.