Evan Chen (April 30, 2014) A Brief Introduction to Olympiad Inequalities

Example 2.7 (Japan)

P a)2
Prove cyc a(b+c
2 +(b+c)2
3
5.

Proof. Since the inequality is homogeneous, we may assume WLOG that a + b + c = 3.

So the inequality we wish to prove is
X (3 2a)2 3
.
cyc
a2 + (3 a)2 5

With some computation, the tangent line trick gives away the magical inequality:

(3 2a)2 1 18 18 2a + 1
(a 1) () (a 1)2 0.
(3 a)2 + a2 5 25 25 2a2 6a + 9

§2.3 n 1 EV
The last such technique is n 1 EV. This is a brute force method involving much calculus,
but it is nonetheless a useful weapon.

Theorem 2.8 (n 1 EV)

Let a1 , a2 , . . . , an be real numbers, and suppose a1 + a2 + · · · + an is fixed. Let
f : R ! R be a function with exactly one inflection point. If

f (a1 ) + f (a2 ) + · · · + f (an )

achieves a maximal or minimal value, then n 1 of the ai are equal to each other.

Proof. See page 15 of Olympiad Inequalities, by Thomas Mildorf. The main idea is to
use Karamata to “push” the ai together.

Example 2.9 (IMO 2001 / APMOC 2014)

P
Let a, b, c be positive reals. Prove 1  cyc p a < 2.
a2 +8bc

bc ca ab
Proof. Set ex = a2
, ey = b2
, ez = c2
. We have the condition x + y + z = 0 and want to
prove
1  f (x) + f (y) + f (z) < 2
where f (x) = p 1 x. You can compute
1+8e

4ex (4ex 1)
f 00 (x) = 5
(8ex + 1) 2

so by n 1 EV, we only need to consider the case x = y. Let t = ex ; that means we want
to show that
2 1
1 p +p < 2.
1 + 8t 1 + 8/t2
Since this a function of one variable, we can just use standard Calculus BC methods.