Problem: If x,y,z are non-negative real numbers such that x2+y2+z2=x+y+z, then show that: x5+x+1x+1+y5+y+1y+1+z5+z+1z+1≥3 When does the equality hold?
Solution
Solution: First we factor x5+x+1 as follows: x5+x+1=x5−x2+x2+x+1=x2(x3−1)+x2+x+1=x2(x−1)(x2+x+1)+x2+x+1=(x2+x+1)(x2(x−1)+1)=(x2+x+1)(x3−x2+1) Using the AM-GM inequality, we have x5+x+1=(x2+x+1)(x3−x2+1)≤2x2+x+1+x3−x2+1=2x3+x+2 and since x3+x+2=x3+1+x+1=(x+1)(x2−x+1)+x+1=(x+1)(x2−x+1+1)=(x+1)(x2−x+2), then x5+x+1≤2(x+1)(x2−x+2) Using x2−x+2=(x−21)2+47>0, we obtain x5+x+1x+1≥x2−x+22 Applying the Cauchy-Schwarz inequality and the given condition, we get cyc∑x5+x+1x+1≥cyc∑x2−x+22≥∑cyc(x2−x+2)18=618=3 which is the desired result. For the equality both conditions: x2−x+2=y2−y+2=z2−z+2 (equality in CBS) and x3−x2+1=x2+x+1 (equality in AM-GM) have to be satisfied. By using the given condition it follows that x2−x+2+y2−y+2+z2−z+2=6, hence 3(x2−x+2)=6, implying x=0 or x=1. Of these, only x=0 satisfies the second condition. We conclude that equality can only hold for x=y=z=0. It is an immediate check that indeed for these values equality holds.
Let us present an heuristic argument to reach the key inequality x5+x+1x+1≥x2−x+22. In order to exploit the condition x2+y2+z2=x+y+z when applying CBS in Engel form, we are looking for α,β,γ>0 such that x5+x+1x+1≥α(x2−x)+βγ After squaring and cancelling the denominators, we get (x+1)2(α(x2−x)+β)2≥γ2(x5+x+1) for all x≥0, and, after some manipulations, we reach to f(x)≥0 for all x≥0, where f(x)=α2x6−γ2x5+(2αβ−2α2)x4+2αβx3+(α−β)2x2+(2β2−2αβ−γ2)x+β2−γ2. As we are expecting the equality to hold for x=0, we naturally impose the condition that f has 0 as a double root. This implies β2−γ2=0 and 2β2−2αβ−γ2=0, that is, β=γ and γ=2α. Thus the inequality f(x)≥0 becomes α2x6−4α2x5+2α2x4+4α2x3+α2x2≥0,∀x≥0 that is, α2x2(x2−2x−1)2≥0∀x≥0 which is obviously true. Therefore, the inequality x5+x+1x+1≥x2−x+22 holds for all x≥0 and now we can continue as in the first solution.
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.