Subtract 3. The third proof, with the rearrangement inequality, is in the next lesson.
Graphs of the sum a/(b + c) + b/(c + a) + c/(a + b) against a, for b = c = 1 in blue and for b = 1, c = 3 in orange, with a from 0 to 6. A dashed grey horizontal line is drawn at 1.5. The blue curve touches the dashed line at a = 1. The orange curve stays above the line everywhere.
Practise with new numbers
Try it in Python
The program evaluates Nesbitt's sum at many random triples and reports the smallest value found, and the triple where it happened.
Common mistakes
Using the Engel form with a negative bottom. Every yi must be positive.
Forgetting to square the tops. The form needs yixi2. Write b+ca as a(b+c)a2 first.
Stopping halfway. In Nesbitt the Engel form gives 2(ab+bc+ca)(a+b+c)2, and you still need (a+b+c)2≥3(ab+bc+ca).
Claiming a greatest value. Nesbitt's sum has no greatest value. It grows without bound as one number grows.
Remember these
∑yixi2≥∑yi(∑xi)2 for positive yi.
Equality when the ratios yixi are equal.
(a+b+c)2≥3(ab+bc+ca) for all real a,b,c.
Nesbitt: ∑b+ca≥23 for positive a,b,c.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Positive numbers x and y add up to 2. Find the least value of x1+y9.
Evaluate Nesbitt's sum at a=1, b=1, c=2.
Show that a1+b1+c1≥a+b+c9 for positive a,b,c.
Why can we not use the Engel form on x1+y1 with x=2 and y=−1?
In the first proof of Nesbitt, what is the identity behind (a+b+c)2≥3(ab+bc+ca)?
References
Steele, The Cauchy-Schwarz Master Class, Chapter 1, exercises on sums of fractions.
Engel, Problem-Solving Strategies, Chapter 7, on inequalities, where this form of Cauchy-Schwarz is used.
Enroll free in Cauchy-Schwarz, Rearrangement and Chebyshev
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.
. This is Cauchy-Schwarz in a form made for sums of fractions, sometimes called Titu's lemma or Sedrakyan's inequality. It gives the AM-HM inequality at once, and it proves Nesbitt's inequality
b+ca+c+ab+a+bc≥23
in two lines.
about 25 min1 simulation1 practice question1 Python program5 questions to check yourself
This lesson is free to read. Enroll free to keep your place and take the tests.