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

Example 2.4
Prove that
✓ ◆
1 1 1 1 1 1 9
+ + 2 + + .
a b c a+b b+c c+a a+b+c

Proof. The problem is equivalent to

1 1 1 1 1 1 1 1 1
+ + a+b
+ b+c
+ c+a a+b+c
+ a+b+c
+ a+b+c
.
a b c 2 2 2 3 3 3

Assume WLOG that a b c. Let f (x) = 1/x. Since

✓ ◆ ✓ ◆
a+b a+c b+c a+b+c a+b+c a+b+c
(a, b, c) , , , ,
2 2 2 3 3 3
the conclusion follows by Karamata.

Example 2.5 (APMO 1996)

If a, b, c are the three sides of a triangle, prove that
p p p p p p
a + b c + b + c a + c + a b  a + b + c.

Proof. Again assume WLOG that a b c and notice that (a+b c, c+a b, b+c a)
p
(a, b, c). Apply Karamata on f (x) = x.

§2.2 Tangent Line Trick

a1 +···+an
Again fix a = n . If f is not convex, we can sometimes still prove the inequality

f (x) f (a) + f 0 (a) (x a) .

If this inequality manages to hold for all x, then simply summing the inequality will give
us the desired conclusion. This method is called the tangent line trick.

Example 2.6 (David Stoner)

If a + b + c = 3, prove that
X 1
18 + 2(ab + bc + ca) 15.
cyc
(3 c)(4 c)

Proof. We can rewrite the given inequality as

X✓ 18
◆
c2 6.
cyc
(3 c)(4 c)

Using the tangent line trick lets us obtain the magical inequality
18 c+3
c2 () c(c 1)2 (2c 9)  0
(3 c)(4 c) 2
and the conclusion follows by summing.