HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Cauchy-Schwarz, Rearrangement and Chebyshev
  1. 1The Cauchy-Schwarz inequality
  2. 2The Engel form and Nesbitt's inequality
  3. 3Rearrangement and Chebyshev's inequality
  1. Mathematics
  2. /Cauchy-Schwarz, Rearrangement and Chebyshev
  3. /The Engel form and Nesbitt's inequality

Course 29.2·Lesson 2 of 3

The Engel form and Nesbitt's inequality

For positive yiy_iyi​, x12y1+⋯+xn2yn≥(x1+⋯+xn)2y1+⋯+yn\dfrac{x_1^2}{y_1} + \dots + \dfrac{x_n^2}{y_n} \ge \dfrac{(x_1 + \dots + x_n)^2}{y_1 + \dots + y_n}y1​x12​​+⋯+yn​xn2​​≥y1​+⋯+yn​(x1​+⋯+xn​)2​

Lesson 2 of 3Show all lessonsHide
Cauchy-Schwarz, Rearrangement and Chebyshev
  1. 1The Cauchy-Schwarz inequality
  2. 2The Engel form and Nesbitt's inequality
  3. 3Rearrangement and Chebyshev's inequality

Try the code and the simulations beside the lesson.

What you will be able to do

  • prove and use the Engel form of Cauchy-Schwarz;
  • turn a sum of fractions into a form the Engel form can handle;
  • prove Nesbitt's inequality in more than one way.

Sums of fractions

Many olympiad inequalities are sums of fractions. Cauchy-Schwarz handles them well once you write it in the right shape.

The Engel form

For real x1,…,xnx_1, \dots, x_nx1​,…,xn​ and positive y1,…,yny_1, \dots, y_ny1​,…,yn​,

x12y1+x22y2+⋯+xn2yn ≥ (x1+x2+⋯+xn)2y1+y2+⋯+yn.\displaystyle \dfrac{x_1^2}{y_1} + \dfrac{x_2^2}{y_2} + \dots + \dfrac{x_n^2}{y_n} \ \ge\ \dfrac{(x_1 + x_2 + \dots + x_n)^2}{y_1 + y_2 + \dots + y_n}.y1​x12​​+y2​x22​​+⋯+yn​xn2​​ ≥ y1​+y2​+⋯+yn​(x1​+x2​+⋯+xn​)2​.

Equality holds when x1y1=x2y2=⋯=xnyn\dfrac{x_1}{y_1} = \dfrac{x_2}{y_2} = \dots = \dfrac{x_n}{y_n}y1​x1​​=y2​x2​​=⋯=yn​xn​​.

Proof. Use Cauchy-Schwarz with ai=xiyia_i = \dfrac{x_i}{\sqrt{y_i}}ai​=yi​​xi​​ and bi=yib_i = \sqrt{y_i}bi​=yi​​. Then ∑aibi=∑xi\sum a_i b_i = \sum x_i∑ai​bi​=∑xi​, and

(∑xi)2≤(∑xi2yi)(∑yi).\displaystyle \left(\sum x_i\right)^2 \le \left(\sum \dfrac{x_i^2}{y_i}\right)\left(\sum y_i\right).(∑xi​)2≤(∑yi​xi2​​)(∑yi​).

Divide by ∑yi\sum y_i∑yi​. Books name this the Engel form, Titu's lemma or Sedrakyan's inequality. They are all the same statement.

Two quick consequences

  • AM-HM. Put every xi=1x_i = 1xi​=1: 1y1+⋯+1yn≥n2y1+⋯+yn\dfrac{1}{y_1} + \dots + \dfrac{1}{y_n} \ge \dfrac{n^2}{y_1 + \dots + y_n}y1​1​+⋯+yn​1​≥y1​+⋯+yn​n2​. This is the harmonic mean inequality of course 1.
  • A weighted least value. If x+y=1x + y = 1x+y=1 with x,y>0x, y > 0x,y>0, then 1x+4y=12x+22y≥(1+2)21=9\dfrac{1}{x} + \dfrac{4}{y} = \dfrac{1^2}{x} + \dfrac{2^2}{y} \ge \dfrac{(1 + 2)^2}{1} = 9x1​+y4​=x12​+y22​≥1(1+2)2​=9, with equality when 1x=2y\dfrac{1}{x} = \dfrac{2}{y}x1​=y2​, that is x=13x = \dfrac{1}{3}x=31​ and y=23y = \dfrac{2}{3}y=32​.

Nesbitt's inequality

For positive aaa, bbb, ccc,

ab+c+bc+a+ca+b ≥ 32,\displaystyle \dfrac{a}{b + c} + \dfrac{b}{c + a} + \dfrac{c}{a + b} \ \ge\ \dfrac{3}{2},b+ca​+c+ab​+a+bc​ ≥ 23​,

with equality only when a=b=ca = b = ca=b=c.

First proof: the Engel form. Multiply the top and the bottom of each fraction by its own numerator:

∑ab+c=∑a2a(b+c)≥(a+b+c)22(ab+bc+ca).\displaystyle \sum \dfrac{a}{b + c} = \sum \dfrac{a^2}{a(b + c)} \ge \dfrac{(a + b + c)^2}{2(ab + bc + ca)}.∑b+ca​=∑a(b+c)a2​≥2(ab+bc+ca)(a+b+c)2​.

Now (a+b+c)2≥3(ab+bc+ca)(a + b + c)^2 \ge 3(ab + bc + ca)(a+b+c)2≥3(ab+bc+ca), because the difference is 12[(a−b)2+(b−c)2+(c−a)2]\dfrac{1}{2}\left[(a - b)^2 + (b - c)^2 + (c - a)^2\right]21​[(a−b)2+(b−c)2+(c−a)2]. So the right side is at least 32\dfrac{3}{2}23​.

Second proof: AM-HM. Add 111 to each fraction. Each becomes a+b+cb+c\dfrac{a + b + c}{b + c}b+ca+b+c​, and so on. So

∑ab+c+3=(a+b+c)(1b+c+1c+a+1a+b)≥(a+b+c)⋅92(a+b+c)=92.\displaystyle \sum \dfrac{a}{b + c} + 3 = (a + b + c)\left(\dfrac{1}{b + c} + \dfrac{1}{c + a} + \dfrac{1}{a + b}\right) \ge (a + b + c) \cdot \dfrac{9}{2(a + b + c)} = \dfrac{9}{2}.∑b+ca​+3=(a+b+c)(b+c1​+c+a1​+a+b1​)≥(a+b+c)⋅2(a+b+c)9​=29​.

Subtract 333. 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.

Read it first. Then run it. Is the smallest value close to 1.51.51.5? Are the three numbers close to each other?

1. Change the sum to four fractions, a / (b + c + d) and so on, with a fourth random number d. What does the smallest value approach now?

Common mistakes

  • Using the Engel form with a negative bottom. Every yiy_iyi​ must be positive.
  • Forgetting to square the tops. The form needs xi2yi\dfrac{x_i^2}{y_i}yi​xi2​​. Write ab+c\dfrac{a}{b + c}b+ca​ as a2a(b+c)\dfrac{a^2}{a(b + c)}a(b+c)a2​ first.
  • Stopping halfway. In Nesbitt the Engel form gives (a+b+c)22(ab+bc+ca)\dfrac{(a + b + c)^2}{2(ab + bc + ca)}2(ab+bc+ca)(a+b+c)2​, and you still need (a+b+c)2≥3(ab+bc+ca)(a + b + c)^2 \ge 3(ab + bc + ca)(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

  • ∑xi2yi≥(∑xi)2∑yi\sum \dfrac{x_i^2}{y_i} \ge \dfrac{(\sum x_i)^2}{\sum y_i}∑yi​xi2​​≥∑yi​(∑xi​)2​ for positive yiy_iyi​.
  • Equality when the ratios xiyi\dfrac{x_i}{y_i}yi​xi​​ are equal.
  • (a+b+c)2≥3(ab+bc+ca)(a + b + c)^2 \ge 3(ab + bc + ca)(a+b+c)2≥3(ab+bc+ca) for all real a,b,ca, b, ca,b,c.
  • Nesbitt: ∑ab+c≥32\sum \dfrac{a}{b + c} \ge \dfrac{3}{2}∑b+ca​≥23​ for positive a,b,ca, b, ca,b,c.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Positive numbers xxx and yyy add up to 222. Find the least value of 1x+9y\dfrac{1}{x} + \dfrac{9}{y}x1​+y9​.
  1. Evaluate Nesbitt's sum at a=1a = 1a=1, b=1b = 1b=1, c=2c = 2c=2.
  1. Show that 1a+1b+1c≥9a+b+c\dfrac{1}{a} + \dfrac{1}{b} + \dfrac{1}{c} \ge \dfrac{9}{a + b + c}a1​+b1​+c1​≥a+b+c9​ for positive a,b,ca, b, ca,b,c.
  1. Why can we not use the Engel form on 1x+1y\dfrac{1}{x} + \dfrac{1}{y}x1​+y1​ with x=2x = 2x=2 and y=−1y = -1y=−1?
  1. In the first proof of Nesbitt, what is the identity behind (a+b+c)2≥3(ab+bc+ca)(a + b + c)^2 \ge 3(ab + bc + ca)(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.
No payment. You can leave at any time.

Problems (3)

A factory splits a total working time of 6 hours between three machines, giving x, y and z hours…Hard · High School (11–12) · by StemPy Lab
Nesbitt's inequality says that for positive a, b and c, a/(b + c) + b/(c + a) + c/(a + b) ≥ 3/2.…Hard · High School (11–12) · by StemPy Lab
This inequality appeared at an international olympiad…Advanced · High School (11–12) · by StemPy Lab
Next: lesson 3Rearrangement and Chebyshev's inequality
← Cauchy-Schwarz, Rearrangement and Chebyshev
← The Cauchy-Schwarz inequalityRearrangement and Chebyshev's inequality →

Discussion (0)

Log in to join the discussion.

Loading…

. 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
ab+c+bc+a+ca+b≥32\dfrac{a}{b + c} + \dfrac{b}{c + a} + \dfrac{c}{a + b} \ge \dfrac{3}{2}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.