Inequalities from 2008 Mathematical Competition

Inequalities from
2008 Mathematical Competition
Editor
Manh Dung Nguyen, Special High School for Gifted Students, Hanoi University of
Science, Vietnam
Vo Thanh Van, Special High School for Gifted Students, Hue University of Science,
Vietnam
Contact
If you have any question about this ebook, please contact us. Email:
[email protected]
Acknowledgments
We thank a lot to Mathlinks Forum
1
and their members for the reference to problems and
many nice solutions from them!
First published: October 10th 2008
Edited: January 1st 2009
1
Website: http://mathlinks.ro
1
Happy new year 2009!
01/01/2009
Inequalities from 2008 Mathematical Competition
Abbreviations
IMO International mathematical Olympiad
TST Team Selection Test
MO Mathematical Olympiad
LHS Left hand side
RHS Right hand side
W.L.O.G Without loss of generality

:

cyclic
1
Contents
1 Problems 3
2 Solutions 9
3 The inequality from IMO 2008 37
2
Chapter 1
Problems
Pro 1. (Vietnamese National Olympiad 2008) Let x, y, z be distinct non-negative real
numbers. Prove that
1
(x y)
2
+
1
(y z)
2
+
1
(z x)
2

4
xy + yz + zx
.

Pro 2. (Iranian National Olympiad (3rd Round) 2008). Find the smallest real K
such that for each x, y, z R
+
:
x

y + y

z + z

x K
_
(x + y)(y + z)(z + x)

Pro 3. (Iranian National Olympiad (3rd Round) 2008). Let x, y, z R

+
and
x + y + z = 3. Prove that:
x
3
y
3
+ 8
+
y
3
z
3
+ 8
+
z
3
x
3
+ 8

1
9
+
2
27
(xy + xz + yz)

Pro 4. (Iran TST 2008.) Let a, b, c > 0 and ab + ac + bc = 1. Prove that:

_
a
3
+ a +
_
b
3
+ b +
_
c
3
+ c 2

a + b + c

Pro 5. (Macedonian Mathematical Olympiad 2008.) Positive numbers a, b, c are

such that (a + b) (b + c) (c + a) = 8. Prove the inequality
a + b + c
3

27
_
a
3
+ b
3
+ c
3
3

3
Inequalities from 2008 Mathematical Competition
Pro 6. (Mongolian TST 2008) Find the maximum number C such that for any non-
negative x, y, z the inequality
x
3
+ y
3
+ z
3
+ C(xy
2
+ yz
2
+ zx
2
) (C + 1)(x
2
y + y
2
z + z
2
x).
holds.

Pro 7. (Federation of Bosnia, 1. Grades 2008.) For arbitrary reals x, y and z prove
the following inequality:
x
2
+ y
2
+ z
2
xy yz zx max{
3(x y)
2
4
,
3(y z)
2
4
,
3(y z)
2
4
}.

Pro 8. (Federation of Bosnia, 1. Grades 2008.) If a, b and c are positive reals such
that a
2
+ b
2
+ c
2
= 1 prove the inequality:
a
5
+ b
5
ab(a + b)
+
b
5
+ c
5
bc(b + c)
+
c
5
+ a
5
ca(a + b)
3(ab + bc + ca) 2

Pro 9. (Federation of Bosnia, 1. Grades 2008.) If a, b and c are positive reals prove
inequality:
(1 +
4a
b + c
)(1 +
4b
a + c
)(1 +
4c
a + b
) > 25

Pro 10. (Croatian Team Selection Test 2008) Let x, y, z be positive numbers. Find
the minimum value of:
(a)
x
2
+ y
2
+ z
2
xy + yz
(b)
x
2
+ y
2
+ 2z
2
xy + yz

Pro 11. (Moldova 2008 IMO-BMO Second TST Problem 2) Let a

1
, . . . , a
n
be pos-
itive reals so that a
1
+ a
2
+ . . . + a
n

n
2
. Find the minimal value of
A =

a
2
1
+
1
a
2
2
+

a
2
2
+
1
a
2
3
+ . . . +

a
2
n
+
1
a
2
1

Pro 12. (RMO 2008, Grade 8, Problem 3) Let a, b [0, 1]. Prove that
1
1 + a + b
1
a + b
2
+
ab
3
.
4
Inequalities from 2008 Mathematical Competition

Pro 13. (Romanian TST 2 2008, Problem 1) Let n 3 be an odd integer. Determine
the maximum value of
_
|x
1
x
2
| +
_
|x
2
x
3
| + . . . +
_
|x
n1
x
n
| +
_
|x
n
x
1
|,
where x
i
are positive real numbers from the interval [0, 1]

Pro 14. (Romania Junior TST Day 3 Problem 2 2008) Let a, b, c be positive reals
with ab + bc + ca = 3. Prove that:
1
1 + a
2
(b + c)
+
1
1 + b
2
(a + c)
+
1
1 + c
2
(b + a)

1
abc
.

Pro 15. (Romanian Junior TST Day 4 Problem 4 2008) Determine the maximum
possible real value of the number k, such that
(a + b + c)
_
1
a + b
+
1
c + b
+
1
a + c
k
_
k
for all real numbers a, b, c 0 with a + b + c = ab + bc + ca.

Pro 16. (2008 Romanian Clock-Tower School Junior Competition) For any real
numbers a, b, c > 0, with abc = 8, prove
a 2
a + 1
+
b 2
b + 1
+
c 2
c + 1
0

Pro 17. (Serbian National Olympiad 2008) Let a, b, c be positive real numbers such
that x + y + z = 1. Prove inequality:
1
yz + x +
1
x
+
1
xz + y +
1
y
+
1
xy + z +
1
z

27
31
.

Pro 18. (Canadian Mathematical Olympiad 2008) Let a, b, c be positive real numbers
for which a + b + c = 1. Prove that
a bc
a + bc
+
b ca
b + ca
+
c ab
c + ab

3
2
.

5
Inequalities from 2008 Mathematical Competition
Pro 19. (German DEMO 2008) Find the smallest constant C such that for all real x, y
1 + (x + y)
2
C (1 + x
2
) (1 + y
2
)
holds.

Pro 20. (Irish Mathematical Olympiad 2008) For positive real numbers a, b, c and d
such that a
2
+ b
2
+ c
2
+ d
2
= 1 prove that
a
2
b
2
cd + +ab
2
c
2
d + abc
2
d
2
+ a
2
bcd
2
+ a
2
bc
2
d + ab
2
cd
2
3/32,
and determine the cases of equality.

Pro 21. (Greek national mathematical olympiad 2008, P1) For the positive integers
a
1
, a
2
, ..., a
n
prove that
_
n
i=1
a
2
i

n
i=1
a
i
_
kn
t

i=1
a
i
where k = max{a
1
, a
2
, ..., a
n
} and t = min{a
1
, a
2
, ..., a
n
}. When does the equality hold?

Pro 22. (Greek national mathematical olympiad 2008, P2)

If x, y, z are positive real numbers with x, y, z < 2 and x
2
+ y
2
+ z
2
= 3 prove that
3
2
<
1 + y
2
x + 2
+
1 + z
2
y + 2
+
1 + x
2
z + 2
< 3

Pro 23. (Moldova National Olympiad 2008) Positive real numbers a, b, c satisfy in-
equality a + b + c
3
2
. Find the smallest possible value for:
S = abc +
1
abc

Pro 24. (British MO 2008) Find the minimum of x

2
+ y
2
+ z
2
where x, y, z R and
satisfy x
3
+ y
3
+ z
3
3xyz = 1

Pro 25. (Zhautykov Olympiad, Kazakhstan 2008, Question 6) Let a, b, c be positive

integers for which abc = 1. Prove that

1
b(a + b)

3
2
.
6
Inequalities from 2008 Mathematical Competition

Pro 26. (Ukraine National Olympiad 2008, P1) Let x, y and z are non-negative
numbers such that x
2
+ y
2
+ z
2
= 3. Prove that:
x
_
x
2
+ y + z
+
y
_
x + y
2
+ z
+
z
_
x + y + z
2

Pro 27. (Ukraine National Olympiad 2008, P2) For positive a, b, c, d prove that
(a + b)(b + c)(c + d)(d + a)(1 +
4

abcd)
4
16abcd(1 + a)(1 + b)(1 + c)(1 + d)

Pro 28. (Polish MO 2008, Pro 5) Show that for all nonnegative real values an inequality
occurs:
4(

a
3
b
3
+

b
3
c
3
+

c
3
a
3
) 4c
3
+ (a + b)
3
.

Pro 29. (Brazilian Math Olympiad 2008, Problem 3). Let x, y, z real numbers such
that x + y + z = xy + yz + zx. Find the minimum value of
x
x
2
+ 1
+
y
y
2
+ 1
+
z
z
2
+ 1

Pro 30. (Kiev 2008, Problem 1). Let a, b, c 0. Prove that

a
2
+ b
2
+ c
2
5
min((a b)
2
, (b c)
2
, (c a)
2
)

Pro 31. (Kiev 2008, Problem 2). Let x

1
, x
2
, , x
n
0, n > 3 and x
1
+x
2
+ +x
n
= 2
Find the minimum value of
x
2
1 + x
2
1
+
x
3
1 + x
2
2
+ ... +
x
1
1 + x
2
n

Pro 32. (Hong Kong TST1 2009, Problem 1). Let

1
,
2
, . . . ,
2008
be real numbers.
Find the maximum value of
sin
1
cos
2
+ sin
2
cos
3
+ . . . + sin
2007
cos
2008
+ sin
2008
cos
1

7
Inequalities from 2008 Mathematical Competition
Pro 33. (Hong Kong TST1 2009, Problem 5). Let a, b, c be the three sides of a
triangle. Determine all possible values of
a
2
+ b
2
+ c
2
ab + bc + ca

Pro 34. (Indonesia National Science Olympiad 2008). Prove that for x and y
positive reals,
1
(1 +

x)
2
+
1
(1 +

y)
2

2
x + y + 2
.

Pro 35. (Baltic Way 2008). Prove that if the real numbers a, b and c satisfy a
2
+b
2
+c
2
=
3 then

a
2
2 + b + c
2

(a + b + c)
2
12
.
When does the inequality hold?

Pro 36. (Turkey NMO 2008 Problem 3). Let a.b.c be positive reals such that their
sum is 1. Prove that
a
2
b
2
c
3
(a
2
ab + b
2
)
+
b
2
c
2
a
3
(b
2
bc + c
2
)
+
a
2
c
2
b
3
(a
2
ac + c
2
)

3
ab + bc + ac

Pro 37. (China Western Mathematical Olympiad 2008). Given x, y, z (0, 1)

satisfying that
_
1 x
yz
+
_
1 y
xz
+
_
1 z
xy
= 2.
Find the maximum value of xyz.

Pro 38. (Chinese TST 2008 P5). For two given positive integers m, n > 1, let a
ij
(i =
1, 2, , n, j = 1, 2, , m) be nonnegative real numbers, not all zero, nd the maximum
and the minimum values of f, where
f =
n

n
i=1
(

m
j=1
a
ij
)
2
+ m

m
j=1
(

n
i=1
a
ij
)
2
(

n
i=1

m
j=1
a
ij
)
2
+ mn

n
i=1

m
i=j
a
2
ij

Pro 39. (Chinese TST 2008 P6) Find the maximal constant M, such that for arbi-
trary integer n 3, there exist two sequences of positive real number a
1
, a
2
, , a
n
, and
b
1
, b
2
, , b
n
, satisfying
(1):

n
k=1
b
k
= 1, 2b
k
b
k1
+ b
k+1
, k = 2, 3, , n 1;
(2):a
2
k
1 +

k
i=1
a
i
b
i
, k = 1, 2, 3, , n, a
n
M.

8
Chapter 2
Solutions
Problem 1. (Vietnamese National Olympiad 2008) Let x, y, z be distinct non-negative
real numbers. Prove that
1
(x y)
2
+
1
(y z)
2
+
1
(z x)
2

4
xy + yz + zx
.
Proof. (Posted by Vo Thanh Van). Assuming z = min{x, y, z}. We have
(x z)
2
+ (y z)
2
= (x y)
2
+ 2(x z)(y z)
So by the AM-GM inequality, we get
1
(x y)
2
+
1
(y z)
2
+
1
(z x)
2
=
1
(x y)
2
+
(x y)
2
(y z)
2
(z x)
2
+
2
(x z)(y z)

2
(x z)(y z)
+
2
(x z)(y z)
=
4
(x z)(y z)

4
xy + yz + zx
Q.E.D.
Proof. (Posted by Altheman). Let f(x, y, z) denote the LHS minus the RHS. Then
f(x +d, y +d, z +d) is increasing in d so we can set the least of x +d, y +d, z +d equal to
zero (WLOG z = 0). Then we have
1
(x y)
2
+
1
x
2
+
1
y
2

4
xy
=
(x
2
+ y
2
3xy)
2
x
2
y
2
(x y)
2
0

Problem 2. (Iranian National Olympiad (3rd Round) 2008). Find the smallest
real K such that for each x, y, z R
+
:
x

y + y

z + z

x K
_
(x + y)(y + z)(z + x)
9
Inequalities from 2008 Mathematical Competition
Proof. (Posted by nayel). By the Cauchy-Schwarz inequality, we have
LHS =

xy +

yz +

zx
_
(x + y + z)(xy + yz + zx)

3
2

2
_
(x + y)(y + z)(z + x)
where the last inequality follows from
8(x + y + z)(xy + yz + zx) 9(x + y)(y + z)(z + x)
which is well known.
Proof. (Posted by roer). We want to nd the smallest K. I claim
K =
3
2

2
. The inequality is equivalent to
8(x

y + y

z + z

x)
2
9(x + y)(y + z)(z + x)
8x
2
y + 8y
2
z + 8z
2
x + 16xy

yz + 16yz

zx + 16xz

xy 9

sym
x
2
y + 18xyz
16xy

yz + 16yz

zx + 16xz

xy x
2
y + y
2
z + z
2
x + 9y
2
x + 9z
2
y + 9x
2
z + 18xyz
By the AM-GM inequality, we have
z
2
x + 9y
2
x + 6xyz 16
16
_
z
2
x y
18
x
9
x
6
y
6
z
6
= 16xy

xz
Sum up cyclically. We can get equality when x = y = z = 1, so we know that K cannot be
any smaller.
Proof. (Posted by FelixD). We want to nd the smallest K such that
(x

y + y

z + z

x)
2
K
2
(x + y)(y + z)(z + x)
But
(x

y + y

z + z

x)
2
=

cyc
x
2
y + 2(

cyc
xy

yz)

cyc
x
2
y + 2(

cyc
xyz + xy
2
2
)
= (x + y)(y + z)(z + x) + xyz
(x + y)(y + z)(z + x) +
1
8
(x + y)(y + z)(z + x)
=
9
8
(x + y)(y + z)(z + x)
Therefore,
K
2

9
8
K
3
2

2
with equality holds if and only if x = y = z.

10
Inequalities from 2008 Mathematical Competition
Problem 3. (Iranian National Olympiad (3rd Round) 2008). Let x, y, z R
+
and
x + y + z = 3. Prove that:
x
3
y
3
+ 8
+
y
3
z
3
+ 8
+
z
3
x
3
+ 8

1
9
+
2
27
(xy + xz + yz)
Proof. (Posted by roer). By the AM-GM inequality, we have
x
3
(y + 2)(y
2
2y + 4)
+
y + 2
27
+
y
2
2y + 4
27

x
3
Summing up cyclically, we have
x
3
y
3
+ 8
+
y
3
z
3
+ 8
+
z
3
x
3
+ 8
+
x
2
+ y
2
+ z
2
(x + y + z) + 6 3
27
1
1
3
+
1
9

x
2
+ y
2
+ z
2
27
Hence it suces to show that
1
3

x
2
+ y
2
+ z
2
27

2
27
(xy + xz + yz)
9 (x
2
+ y
2
+ z
2
) 2(xy + xz + yz)
9 (x + y + z)
2
= 9
Q.E.D.

Problem 4. (Iran TST 2008.) Let a, b, c > 0 and ab + ac + bc = 1. Prove that:

_
a
3
+ a +
_
b
3
+ b +
_
c
3
+ c 2

a + b + c
Proof. (Posted by Albanian Eagle). It is equivalent to:

cyc
a
_
a(b + c)
2

(a + b + c)(ab + bc + ca)
(a + b)(b + c)(c + a)
Using the Jensen inequality, on f(x) =
1

x
, we get

cyc
a
_
a(b + c)

a + b + c

sym
a
2
b
a + b + c
So we need to prove that
(a + b + c)
2
(

sym
a
2
b + 2abc) 4(ab + bc + ca)(

sym
a
2
b)
Now let c be the smallest number among a, b, c and we see we can rewrite the above as
(a b)
2
(a
2
b + b
2
a + a
2
c + b
2
c ac
2
bc
2
) + c
2
(a + b)(c a)(c b) 0
11
Inequalities from 2008 Mathematical Competition
Proof. (Posted by Campos). The inequality is equivalent to
_
a(a + b)(a + c) 2
_
(a + b + c)(ab + bc + ca)
After squaring both sides and canceling some terms we have that it is equivalent to

a
3
+ abc + 2(b + c)
_
bc(a + b)(a + c)

3a
2
b + 3a
2
c + 4abc
From the Schurs inequality we have that it is enough to prove that

(b + c)
_
(ab + b
2
)(ac + c
2
)

a
2
b + a
2
c + 2abc
From the Cauchy-Schwarz inequality we have
_
(ab + b
2
)(ac + c
2
) a

bc + bc
so

(b + c)
_
(ab + b
2
)(ac + c
2
)

a(b + c)

bc + bc(b + c)

a
2
b + a
2
c + 2abc
as we wanted to prove.
Proof. (Posted by anas). Squaring the both sides , our inequality is equivalent to:

a
3
3

ab(a + b) 9abc + 2
_
a(a + b)(a + c)
_
b(b + c)(b + a) 0
But, by the AM-GM inequality, we have:
a(a + b)(a + c) b(b + c)(b + a)
= (a
3
+ a
2
c + a
2
b + abc)(ab
2
+ b
2
c + b
3
+ abc)
(a
2
b + abc + ab
2
+ abc)
2
So we need to prove that:
a
3
+ b
3
+ c
3
ab(a + b) ac(a + c) bc(b + c) + 3abc 0
which is clearly true by the Schur inequality

Problem 5. Macedonian Mathematical Olympiad 2008. Positive numbers a, b, c

are such that (a + b) (b + c) (c + a) = 8. Prove the inequality
a + b + c
3

27
_
a
3
+ b
3
+ c
3
3
Proof. (Posted by argady). By the AM-GM inequality, we have
(a + b + c)
3
= a
3
+ b
3
+ c
3
+ 24 = a
3
+ b
3
+ c
3
+ 3 + + 3 9
9
_
(a
3
+ b
3
+ c
3
) 3
8
Q.E.D.
12
Inequalities from 2008 Mathematical Competition
Proof. (Posted by kunny). The inequality is equivalent to
(a + b + c)
27
3
26
(a
3
+ b
3
+ c
3
) []
Let a + b = 2x, b + c = 2y, c + a = 2z, we have that
(a + b)(b + c)(c + a) = 8 xyz = 1
and
2(a + b + c) = 2(x + y + z) a + b + c = x + y + z
(a + b + c)
3
= a
3
+ b
3
+ c
3
+ 3(a + b)(b + c)(c + a) a
3
+ b
3
+ c
3
= (x + y + z)
3
24
Therefore
[] (x + y + z)
27
3
26
{(x + y + z)
3
24}.
Let t = (x + y + z)
3
, by AM-GM inequality, we have that
x + y + z 3
3

xyz x + y + z 3
yielding t 27.
Since y = t
9
is an increasing and concave up function for t > 0, the tangent line of y = t
9
at t = 3 is y = 3
26
(t 27) + 3
27
.We can obtain
t
9
3
26
(t 27) + 3
27
yielding t
9
3
26
(t 24), which completes the proof.
Proof. (Posted by kunny). The inequality is equivalent to
(a + b + c)
27
a
3
+ b
3
+ c
3
3
26
.
Let x = (a + b + c)
3
, by the AM-GM inequality, we have:
8 = (a + b)(b + c)(c + a)
_
2(a + b + c)
3
_
3
so a + b + c 3 The left side of the above inequality
f(x) :=
x
9
x 24
=f

(x) =
8x
8
(x 27)
(x 24)
2
0
We have f(x) f(27) = 3
26
.

Problem 6. (Mongolian TST 2008) Find the maximum number C such that for any
nonnegative x, y, z the inequality
x
3
+ y
3
+ z
3
+ C(xy
2
+ yz
2
+ zx
2
) (C + 1)(x
2
y + y
2
z + z
2
x).
holds.
13
Inequalities from 2008 Mathematical Competition
Proof. (Posted by hungkhtn). Applying CID (Cyclic Inequality of Degree 3)
1
theorem,
we can let c = 0 in the inequality. It becomes
x
3
+ y
3
+ cx
2
y (c + 1)xy
2
.
Thus, we have to nd the minimal value of
f(y) =
y
3
y
2
+ 1
y
2
y
= y +
1
y(y 1)
when y > 1. It is easy to nd that
f

(y) = 0 2y 1 = (y(y 1))

2
y
4
2y
3
+ y
2
2y + 1 = 0.
Solving this symmetric equation gives us:
y +
1
y
= 1 +

2 y =
1 +

2 +
_
2

2 1
2
Thus we found the best value of C is
y +
1
y(y 1)
=
1 +

2 +
_
2

2 1
2
+
1
_

2 +
_
2

2 1
2.4844

Problem 7. (Federation of Bosnia, 1. Grades 2008.) For arbitrary reals x, y and z

prove the following inequality:
x
2
+ y
2
+ z
2
xy yz zx max{
3(x y)
2
4
,
3(y z)
2
4
,
3(y z)
2
4
}.
Proof. (Posted by delegat). Assume that
3(x y)
2
4
is max. The inequality is equivalent to
4x
2
+ 4y
2
+ 4z
2
4xy + 4yz + 4xz + 3x
2
6xy + 3y
2
x
2
+ 2xy + y
2
+ z
2
4yz + 4xz
(x + y 2z)
2
0
so we are done.

Problem 8. (Federation of Bosnia, 1. Grades 2008.) If a, b and c are positive reals

such that a
2
+ b
2
+ c
2
= 1 prove the inequality:
a
5
+ b
5
ab(a + b)
+
b
5
+ c
5
bc(b + c)
+
c
5
+ a
5
ca(a + b)
3(ab + bc + ca) 2
1
You can see here: http://www.mathlinks.ro/viewtopic.php?p=1130901
14
Inequalities from 2008 Mathematical Competition
Proof. (Posted by Athinaios). Firstly, we have
(a + b)(a b)
2
(a
2
+ ab + b
2
) 0
so
a
5
+ b
5
a
2
b
2
(a + b).
Applying the above inequality, we have
LHS ab + bc + ca
So we need to prove that
ab + bc + ca + 2 3(ab + bc + ca)
or
2(a
2
+ b
2
+ c
2
) 2(ab + bc + ca)
Which is clearly true.
Proof. (Posted by kunny). Since y = x
5
is an increasing and downwards convex function
for x > 0, by the Jensen inequality we have
a
5
+ b
5
2

_
a + b
2
_
5

a
5
+ b
5
ab(a + b)

1
16

(a + b)
4
ab
=
1
16
(a + b)
2

(a + b)
2
ab

1
16
(a + b)
2
4
(because (a + b)
2
4ab for a > 0, b > 0)
Thus for a > 0, b > 0, c > 0,
a
5
+ b
5
ab(a + b)
+
b
5
+ c
5
bc(b + c)
+
c
5
+ a
5
ca(c + a)

1
4
{(a + b)
2
+ (b + c)
2
+ (c + a)
2
}
=
1
2
(a
2
+ b
2
+ c
2
+ ab + bc + ca)
ab + bc + ca
Then we are to prove
ab + bc + ca 3(ab + bc + ca) 2
which can be proved by
ab + bc + ca 3(ab + bc + ca) 2 1 ab + bc + ca a
2
+ b
2
+ c
2
ab + bc + ca
Q.E.D.
Comment
We can prove the stronger inequality:
a
5
+ b
5
ab(a + b)
+
b
5
+ c
5
bc(b + c)
+
c
5
+ a
5
ca(a + c)
6 5(ab + bc + ca).
15
Inequalities from 2008 Mathematical Competition
Proof. (Posted by HTA). It is equivalent to

a
5
+ b
5
ab(a + b)

1
2
(a
2
+ b
2
)
5
2
_

(a b)
2
_

(a b)
2
(
2a
2
+ ab + 2b
2
2ab

5
2
) 0

(a b)
4
ab
0
which is true.

Problem 9. (Federation of Bosnia, 1. Grades 2008.) If a, b and c are positive reals

prove inequality:
(1 +
4a
b + c
)(1 +
4b
a + c
)(1 +
4c
a + b
) > 25
Proof. (Posted by polskimisiek). After multiplying everything out, it is equivalent to:
4(

cyc
a
3
) + 23abc > 4(

cyc
a
2
(b + c))
which is obvious, because by the Schur inequality, we have:
(

cyc
a
3
) + 3abc

cyc
a
2
(b + c)
So nally we have:
4(

cyc
a
3
) + 23abc > 4(

cyc
a
3
) + 12abc 4

cyc
a
2
(b + c)
Q.E.D

Problem 10. (Croatian Team Selection Test 2008) Let x, y, z be positive numbers.
Find the minimum value of:
(a)
x
2
+ y
2
+ z
2
xy + yz
(b)
x
2
+ y
2
+ 2z
2
xy + yz
Proof. (Posted by nsato).
(a) The minimum value is

2. Expanding
_
x

2
2
y
_
2
+
_

2
2
y z
_
2
0,
16
Inequalities from 2008 Mathematical Competition
we get x
2
+ y
2
+ z
2

2xy

2yz 0, so
x
2
+ y
2
+ z
2
xy + yz

2.
Equality occurs, for example, if x = 1, y =

2, and z = 1.
(b) The minimum value is
_
8/3. Expanding
_
x
_
2
3
y
_
2
+
1
3
_
y

6z
_
2
0,
we get x
2
+ y
2
+ 2z
2

_
8/3xy
_
8/3yz 0, so
x
2
+ y
2
+ z
2
xy + yz

_
8
3
.
Equality occurs, for example, if x = 2, y =

6, and z = 1.

Problem 11. (Moldova 2008 IMO-BMO Second TST Problem 2) Let a

1
, . . . , a
n
be positive reals so that a
1
+ a
2
+ . . . + a
n

n
2
. Find the minimal value of
A =

a
2
1
+
1
a
2
2
+

a
2
2
+
1
a
2
3
+ . . . +

a
2
n
+
1
a
2
1
Proof. (Posted by NguyenDungTN). Using Minkowski and Cauchy-Schwarz inequal-
ities we get
A

(a
1
+ a
2
+ . . . + a
n
)
2
+
_
1
a
1
+
1
a
2
. . . +
1
n
_
2

(a
1
+ a
2
+ . . . + a
n
)
2
+
n
4
(a
1
+ a
2
+ . . . + a
n
)
2
By the AM-GM inequality:
(a
1
+ a
2
+ . . . + a
n
)
2
+
_
n
2
_
4
(a
1
+ a
2
+ . . . + a
n
)
2

n
2
2
Because a
1
+ a
2
+ . . . + a
n

n
2
so
15n
4
16
(a
1
+ a
2
+ . . . + a
n
)
2

15n
2
4
We obtain
A
_
n
2
2
+
15n
2
4
=

17n
2
17
Inequalities from 2008 Mathematical Competition
Proof. (Posted by silouan). Using Minkowski and Cauchy-Schwarz inequalities we get
A

(a
1
+ a
2
+ . . . + a
n
)
2
+
_
1
a
1
+
1
a
2
. . . +
1
n
_
2

(a
1
+ a
2
+ . . . + a
n
)
2
+
n
4
(a
1
+ a
2
+ . . . + a
n
)
2
Let a
1
+ ... + a
n
= s . Consider the function f(s) = s
2
+
n
4
s
2
This function is decreasing for s
_
0,
n
2

. So it attains its minimum at s =

n
2
and we are
done .
Proof. (Posted by ddlam). By the AM-GM inequality, we have
a
2
1
+
1
a
2
2
= a
2
1
+
1
16a
2
2
+ ... +
1
16a
2
2
17
17

a
2
1
(16a
2
2
)
16
so
A

17
n

i=1
34

a
2
i
16
16
a
32
i+1
(a
i+1
= a
1
)
By the AM-GM inequality again:
n

i=1
34

a
2
i
16
16
a
32
i+1

n
_
n
i=1
16
16n
x
30
i
_
34n
But

i = 1
n
x
n
i

_
x
1
+ x
2
+ . . . + x
n
n
_
n

1
2
n
So
A

17n
2

Problem 12. (RMO 2008, Grade 8, Problem 3) Let a, b [0, 1]. Prove that
1
1 + a + b
1
a + b
2
+
ab
3
.
Proof. (Posted by Dr Sonnhard Graubner). The given inequality is equivalent to
3(1 a)(1 b)(a + b) + ab(1 a + 1 b) 0
which is true because of 0 a 1 and 0 b 1.
18
Inequalities from 2008 Mathematical Competition
Proof. (Posted by HTA). Let
f(a, b) = 1
a + b
2
+
ab
3

1
1 + a + b
Consider the dierence between f(a, b) and f(1, b) we see that
f(a, b) f(1, b) =
1
6
(b 1)(a + 2a(b + 1) + 3b + 2b(b + 1)) 3a
(1 + a + b)(2 + b)
0
it is left to prove that f(1, b) 0 which is equivalent to
1
6
b(b 1)
2 + b
0
Which is true .

Problem 13. (Romanian TST 2 2008, Problem 1) Let n 3 be an odd integer.

Determine the maximum value of
_
|x
1
x
2
| +
_
|x
2
x
3
| + . . . +
_
|x
n1
x
n
| +
_
|x
n
x
1
|,
where x
i
are positive real numbers from the interval [0, 1]
Proof. (Posted by Myth). We have a continuous function on a compact set [0, 1]
n
, hence
there is an optimal point (x
1
, ..., x
n
). Note now that
1. impossible to have x
i1
= x
i
= x
i+1
;
2. if x
i
x
i1
and x
i
x
i+1
, then x
i
= 0;
3. if x
i
x
i1
and x
i
x
i+1
, then x
i
= 1;
4. if x
i+1
x
i
x
i1
or x
i1
x
i
x
i+1
, then x
i
=
x
i1
+ x
i+1
2
.
It follows that (x
1
, ..., x
n
) looks like
(0,
1
k
1
,
2
k
1
, ..., 1,
k
2
1
k
2
, ...,
2
k
2
,
1
k
2
, 0,
1
k
3
, ...,
1
k
l
),
where k
1
, k
2
, ..., k
l
are natural numbers, k
1
+ k
2
+ ... + k
l
= n, l is even clearly. Then the
function is this point equals
S =
_
k
1
+
_
k
2
+ ...
_
k
l
.
Using the fact that l is even and

k <

k 1+1 we conclude that maximal possible value

of S is n 2 +

2 (l = n 1, k
1
= k
2
= ... = k
l1
= 1, k
l
= 2 in this case).
19
Inequalities from 2008 Mathematical Competition
Proof. (Posted by Umut Varolgunes). Since n is odd, there must be an i such that both
x
i
and x
i+1
are both belong to [0,
1
2
] or [
1
2
, 1]. without loss of generality let x
1
x
2
and x
1
,
x
2
belong to [0,
1
2
]. We can prove that

x
2
x
1
+
_
Ix
3
x
2
I

2
If x
3
> x
2
,

x
2
x
1
+

x
3
x
2
2
_
x
3
x
1
2

2;
else x
1
, x
2
, x
3
are all belong to [0,
1
2
].
Hence,

x
2
x
1
+

Ix
3
x
2
I
_
1
2
+
_
1
2
. Also all of the other terms of the sum are less
then or equal to 1. summing them gives the desired result.
Example is (0,
1
2
, 1, 0, 1, . . . , 1)
Note: all the indices are considered in modulo n

Problem 14. (Romania Junior TST Day 3 Problem 2 2008) Let a, b, c be positive
reals with ab + bc + ca = 3. Prove that:
1
1 + a
2
(b + c)
+
1
1 + b
2
(a + c)
+
1
1 + c
2
(b + a)

1
abc
.
Proof. (Posted by silouan). Using the AM-GM inequality, we derive
ab + bc + ca
3

3
_
(abc)
2
. Then abc 1. Now

1
1 + a
2
(b + c)

1
abc + a
2
(b + c)
=

1
3a
=
1
abc

Problem 15. (Romanian Junior TST Day 4 Problem 4 2008) Determine the max-
imum possible real value of the number k, such that
(a + b + c)
_
1
a + b
+
1
c + b
+
1
a + c
k
_
k
for all real numbers a, b, c 0 with a + b + c = ab + bc + ca.
Proof. (Original solution). Observe that the numbers a = b = 2, c = 0 fulll the condition
a+b+c = ab+bc+ca. Plugging into the givent inequality, we derive that 4
_
1
4
+
1
2
+
1
2
k
_

k hence k 1.
We claim that the inequality hold for k = 1, proving that the maximum value of k is 1. To
this end, rewrite the inequality as follows
(ab + bc + ca)
_
1
a + b
+
1
c + b
+
1
a + c
1
_
1

ab + bc + ca
a + b
ab + bc + ca + 1
20
Inequalities from 2008 Mathematical Competition

ab
a + b
+ c ab + bc + ca + 1

ab
a + b
1
Notice that
ab
a+b

ab
a+b+c
, since a, b, c 0. Summing over a cyclic permutation of a, b, c we
get

ab
a + b

ab
a + b + c
=
ab + bc + ca
a + b + c
= 1
as needed.
Proof. (Alternative solution). The inequality is equivalent to the following
S =
a + b + c
a + b + c + 1
_
1
a + b
+
1
c + b
+
1
a + c
_
Using the given condition, we get
1
a + b
+
1
c + b
+
1
a + c
=
a
2
+ b
2
+ c
2
+ 3(ab + bc + ca)
(a + b)(b + c)(c + a)
=
a
2
+ b
2
+ c
2
+ 2(ab + bc + ca) + (a + b + c)
(a + b)(b + c)(c + a)
=
(a + b + c)(a + b + c + 1)
(a + b + c)
2
abc
hence
S =
(a + b + c)
2
(a + b + c)
2
abc
It is now clear that S 1, and equality hold i abc = 0. Consequently, k = 1 is the
maximum value.

Problem 16. (2008 Romanian Clock-Tower School Junior Competition) For any
real numbers a, b, c > 0, with abc = 8, prove
a 2
a + 1
+
b 2
b + 1
+
c 2
c + 1
0
Proof. (Original solution). We have:
a 2
a + 1
+
b 2
b + 1
+
c 2
c + 1
0 3 3

1
a + 1
0 1

1
a + 1
We can take a = 2
x
y
, b = 2
y
z
, c = 2
z
x
to have

1
a + 1
=

y
2
2xy + y
2

(x + y + z)
2
x
2
+ y
2
+ z
2
+ 2(xy + yz + zx)
= 1
(by the Cauchy-Schwarz inequality) as needed.

21
Inequalities from 2008 Mathematical Competition
Problem 17. (Serbian National Olympiad 2008) Let a, b, c be positive real numbers
such that x + y + z = 1. Prove inequality:
1
yz + x +
1
x
+
1
xz + y +
1
y
+
1
xy + z +
1
z

27
31
.
Proof. (Posted by canhang2007). Setting x =
a
3
, y =
b
3
, z =
c
3
. The inequality is
equivalent to

cyc
a
3a
2
+ abc + 27

3
31
By the Schur Inequality, we get 3abc 4(ab + bc + ca) 9. It suces to prove that

3a
9a
2
+ 4(ab + bc + ca) + 72

3
31

_
1
31a(a + b + c)
9a
2
+ 4(ab + bc + ca) + 72
_
0

(7a + 8c + 10b)(c a) (7a + 8b + 10c)(a b)

a
2
+ s
0
(where s =
4(ab + bc + ca) + 72
9
.)

(a b)
2
8a
2
+ 8b
2
+ 15ab + 10c(a + b) + s
(a
2
+ s)(b
2
+ s)
0
which is true.

Problem 18. (Canadian Mathematical Olympiad 2008) Let a, b, c be positive real

numbers for which a + b + c = 1. Prove that
a bc
a + bc
+
b ca
b + ca
+
c ab
c + ab

3
2
.
Proof. (Posted by Altheman). We have a + bc = (a + b)(a + c), so apply that, etc. The
inequality is

(b + c)(a
2
+ ab + ac bc)
3
2
(a + b)(b + c)(c + a)

cyc
a
2
b + b
2
a 6abc
which is obvious by the AM-GM inequality.

22
Inequalities from 2008 Mathematical Competition
Problem 19. (German DEMO 2008) Find the smallest constant C such that for all
real x, y
1 + (x + y)
2
C (1 + x
2
) (1 + y
2
)
holds.
Proof. (Posted by JBL). The inequality is equivalent to
x
2
+ y
2
+ 2xy + 1
x
2
+ y
2
+ x
2
y
2
+ 1
C
The greatest value of LHS helps us nd C in which all real numbers x, y satises the
inequality.
Let A = x
2
+ y
2
, so
A + 2xy + 1
A + x
2
y
2
+ 1
C
To maximize the LHS, A needs to be minimized, but note that
x
2
+ y
2
2xy.
So let us set x
2
+ y
2
= 2xy = a x
2
y
2
=
a
2
4
So the inequality becomes
L =
8a + 4
(a + 2)
2
C
dL
dx
=
8a + 8
(a + 2)
3
= 0 a = 1
It follows that max(L) = C =
4
3

Problem 20. (Irish Mathematical Olympiad 2008) For positive real numbers a, b, c
and d such that a
2
+ b
2
+ c
2
+ d
2
= 1 prove that
a
2
b
2
cd + +ab
2
c
2
d + abc
2
d
2
+ a
2
bcd
2
+ a
2
bc
2
d + ab
2
cd
2
3/32,
and determine the cases of equality.
Proof. (Posted by argady). We have
a
2
b
2
cd + ab
2
c
2
d + abc
2
d
2
+ a
2
bcd
2
+ a
2
bc
2
d + ab
2
cd
2
= abcd(ab + ac + ad + bc + bd + cd)
By the AM-GM inequality,
a
2
+ b
2
+ c
2
+ d
2
4

abcd
and
a
2
+ b
2
+ a
2
+ c
2
+ a
2
+ d
2
+ b
2
+ c
2
+ b
2
+ d
2
+ c
2
+ d
2
2
(ab + ac + ad + bc + bd + cd)
23
Inequalities from 2008 Mathematical Competition
so abcd
1
16
and ab + ac + ad + bc + bd + cd
3
2
Multiplying we get
a
2
b
2
cd + ab
2
c
2
d + abc
2
d
2
+ a
2
bcd
2
+ a
2
bc
2
d + ab
2
cd
2

1
16

3
2
=
3
32
.
The equality occurs when a = b = c = d =
1
2
.

Problem 21. (Greek national mathematical olympiad 2008, P1) For the positive
integers a
1
, a
2
, ..., a
n
prove that
_
n
i=1
a
2
i

n
i=1
a
i
_
kn
t

i=1
a
i
where k = max{a
1
, a
2
, ..., a
n
} and t = min{a
1
, a
2
, ..., a
n
}. When does the equality hold?
Proof. (Posted by roer). By the AM-GM and Cauchy-Schwarz inequalities, we easily
get that
2
_

a
2
i
n

a
i
n

a
2
i

(

a
i
)
2
n

a
2
i

a
i

a
i
n

n

_
n

i=1
a
i
(

a
2
i

a
i
)
n

i=1
a
i
Now,

a
2
i

a
i
1
So therefore since
k
t
1
(

a
2
i

a
i
)
kn
t
(

a
2
i

a
i
)
n
Now, the direct application of AM-GM required that all terms are equal for equality to
occur, and indeed, equality holds when all a
i
are equal.

Problem 22. (Greek national mathematical olympiad 2008, P2)

If x, y, z are positive real numbers with x, y, z < 2 and x
2
+ y
2
+ z
2
= 3 prove that
3
2
<
1 + y
2
x + 2
+
1 + z
2
y + 2
+
1 + x
2
z + 2
< 3
24
Inequalities from 2008 Mathematical Competition
Proof. (Posted by tchebytchev). From x < 2, y < 2 and z < 2 we nd
1 + y
2
x + 2
+
1 + z
2
y + 2
+
1 + x
2
z + 2
>
1 + y
2
4
+
1 + z
2
4
+
1 + x
2
4
=
3
2
and from x > 0, y > 0 and z > 0 we have
1 + y
2
x + 2
+
1 + z
2
y + 2
+
1 + x
2
z + 2
<
1 + y
2
2
+
1 + z
2
2
+
1 + x
2
2
= 3.
Proof. (Posted by canhang2007). Since with x
2
+y
2
+z
2
= 3, then we can easily get that
x, y, z

3 < 2. Also, we can even prove that

x
2
+ 1
z + 2
2
Indeed, by the AM-GM and Cauchy Schwarz inequalities, we have

x
2
+ 1
z + 2

x
2
+ 1
z
2
+1
2
+ 2
= 2

x
2
+ 1
z
2
+ 5

2(x
2
+ y
2
+ z
2
+ 3)
2

(x
2
+ 1)(z
2
+ 5)
=
72

x
2
y
2
+ 33

72
1
3
(x
2
+ y
2
+ z
2
)
2
+ 33
=
72
3 + 33
= 2

Problem 23. (Moldova National Olympiad 2008) Positive real numbers a, b, c satisfy
inequality a + b + c
3
2
. Find the smallest possible value for:
S = abc +
1
abc
Proof. (Posted by NguyenDungTN). By the AM-GM inequality, we have
3
2
a + b + c 3
3

abc
so abc
1
8
. By the AM-GM inequality again,
S = abc +
1
abc
= abc +
1
64abc
+
63
64abc
2
_
abc.
1
64abc
+
63
64abc

1
4
+
63
8
=
65
8

Problem 24. (British MO 2008) Find the minimum of x

2
+ y
2
+ z
2
where x, y, z R
and satisfy x
3
+ y
3
+ z
3
3xyz = 1
25
Inequalities from 2008 Mathematical Competition
Proof. (Posted by delegat). Condition of problem may be rewritten as:
(x + y + z)(x
2
+ y
2
+ z
2
xy yz zx) = 1
and since second bracket on LHS is nonnegative we have x + y + z > 0.
Notice that from last equation we have:
x
2
+ y
2
+ z
2
=
1 + (xy + yz + zx)(x + y + z)
x + y + z
=
1
x + y + z
+ xy + yz + zx
and since
xy + yz + zx =
(x + y + z)
2
x
2
y
2
z
2
2
The last equation implies:
3(x
2
+ y
2
+ z
2
)
2
=
1
x + y + z
+
(x + y + z)
2
2
=
1
2(x + y + z)
+
1
2(x + y + z)
+
(x + y + z)
2
2

3
2
This inequality follows from AM GM so x
2
+y
2
+z
2
1 so minimum of x
2
+y
2
+z
2
is
1 and triple (1, 0, 0) shows that this value can be achieved.
Proof. (Original solution). Let x
2
+y
2
+z
2
= r
2
. The volume of the parallelpiped in R
3
with one vertex at (0, 0, 0) and adjacent vertices at (x, y, z), (y, z, x), (z, x, y) is |x
3
+ y
3
+
z
3
3xyz| = 1 by expanding a determinant. But the volume of a parallelpiped all of whose
edges have length r is clearly at most r
3
(actually the volume is r
3
cos sin where and
are geometrically signicant angles). So 1 r
3
with equality if, and only if, the edges of
the parallepiped are perpendicular, where r = 1.
Proof. (Original solution). Here is an algebraic version of the above solution.
1 = (x
3
+ y
3
+ z
3
3xyz)
2
=
_
x(x
2
yz) + y(y
2
zx) + z(z
2
xy)
_
2
(x
2
+ y
2
+ z
2
)
_
(x
2
yz)
2
+ (y
2
zx)
2
+ (z
2
xy)
2
_
= (x
2
+ y
2
+ z
2
)
_
x
4
+ y
4
+ z
4
+ x
2
y
2
+ y
2
z
2
+ z
2
x
2
2xyz(x + y + z)
_
= (x
2
+ y
2
+ z
2
)
_
_
x
2
+ y
2
+ z
2
_
2
(xy + yz + zx)
2
_

_
x
2
+ y
2
+ z
2
_
3

Problem 25. (Zhautykov Olympiad, Kazakhstan 2008, Question 6) Let a, b, c be

positive integers for which abc = 1. Prove that

1
b(a + b)

3
2
.
26
Inequalities from 2008 Mathematical Competition
Proof. (Posted by nayel). Letting a =
x
y
, b =
y
z
, c =
z
x
implies
LHS =

cyc
x
2
z
2
+ xy

(x
2
+ y
2
+ z
2
)
2
x
2
y
2
+ y
2
z
2
+ z
2
x
2
+ x
3
y + y
3
z + z
3
x
Now it remains to prove that
2(x
2
+ y
2
+ z
2
)
2
3

cyc
x
2
y
2
+ 3

cyc
x
3
y
Which follows by adding the two inequalities
x
4
+ y
4
+ z
4
x
3
y + y
3
z + z
3
x

cyc
(x
4
+ x
2
y
2
)

cyc
2x
3
y

Problem 26. (Ukraine National Olympiad 2008, P1) Let x, y and z are non-negative
numbers such that x
2
+ y
2
+ z
2
= 3. Prove that:
x
_
x
2
+ y + z
+
y
_
x + y
2
+ z
+
z
_
x + y + z
2

3
Proof. (Posted by nayel). By Cauchy Schwarz we have
(x
2
+ y + z)(1 + y + z) (x + y + z)
2
so we have to prove that
x

1 + y + z + y

1 + x + z + z

1 + x + y
x + y + z

3
But again by the Cauchy Schwarz inequality we have
x
_
1 + y + z + y

1 + x + z + z
_
1 + x + y =

x + xy + xz

_
(x + y + z)(x + y + z + 2(xy + yz + zx)
and also
_
(x + y + z)(x + y + z + 2(xy + yz + zx)

_
(x + y + z)(x
2
+ y
2
+ z
2
+ 2xy + 2yz + 2zx) = s

s
where s = x + y + z so we have to prove that

s

3 which is trivially true so QED

27
Inequalities from 2008 Mathematical Competition
Proof. (Posted by argady). We have

cyc
x
_
x
2
+ y + z
=

cyc
x
_
x
2
+ (y + z)
_
x
2
+y
2
+z
2
3

cyc
x
_
x
2
+ (y + z)
x+y+z
3
Thus, it remains to prove that

cyc
x
_
x
2
+ (y + z)
x+y+z
3

3.
Let x + y + z = 3. Hence,

cyc
x
_
x
2
+ (y + z)
x+y+z
3

cyc
_
1

3

x

x
2
x + 3
_
0

cyc
_
1

3

x

x
2
x + 3
+
5(x 1)
6

3
_
0

cyc
(x 1)
2
(25x
2
+ 35x + 3)
((5x + 1)

x
2
x + 3 + 6

3x)

x
2
x + 3
0.

Problem 27. (Ukraine National Olympiad 2008, P2) For positive a, b, c, d prove that
(a + b)(b + c)(c + d)(d + a)(1 +
4

abcd)
4
16abcd(1 + a)(1 + b)(1 + c)(1 + d)
Proof. (Posted by Yulia). Lets rewrite our inequality in the form
(a + b)(b + c)(c + d)(d + a)
(1 + a)(1 + b)(1 + c)(1 + d)

16abcd
(1 +
4

abcd)
4
We will use the following obvious lemma
x + y
(1 + x)(1 + y)

2

xy
(1 +

xy)
2
By lemma and Cauchy-Schwarz
a + b
(1 + a)(1 + b)
c + d
(1 + c)(1 + d)
(b + c)(a + d)
4

abcd(

ab +

cd)
2
(1 +

ab)
2
(1 +

cd)
2

16abcd
(1 +
4

abcd)
4
Last one also by lemma for x =

ab, y =

cd
Proof. (Posted by argady). The inequality equivalent to
(a + b)(b + c)(c + d)(d + a) 16abcd+
+4
4

abcd
_
(a + b)(b + c)(c + d)(d + a) 4
4

a
3
b
3
c
3
d
3
(a + b + c + d)
_
+
+2

abcd
_
3(a + b)(b + c)(c + d)(d + a) 8

abcd(ab + ac + ad + bc + bd + cd)
_
28
Inequalities from 2008 Mathematical Competition
+4
4

a
3
b
3
c
3
d
3
((a + b)(b + c)(c + d)(d + a) 4
4

abcd(abc + abd + acd + bcd)) 0,

which obvious because
(a + b)(b + c)(c + d)(d + a) 16abcd 0
is true by AM-GM;
(a + b)(b + c)(c + d)(d + a) 4
4

a
3
b
3
c
3
d
3
(a + b + c + d) 0
is true since,
(a + b)(b + c)(c + d)(d + a) (abc + abd + acd + bcd)(a + b + c + d) (ac bd)
2
0
and
abc + abd + acd + bcd 4
4

a
3
b
3
c
3
d
3
is true by AM-GM;
(a + b)(b + c)(c + d)(d + a) 4
4

abcd(abc + abd + acd + bcd)

is true because
a + b + c + d 4
4

abcd
is true by AM-GM;
3(a + b)(b + c)(c + d)(d + a) 8

abcd(ab + ac + ad + bc + bd + cd)
follows from three inequalities:
(a + b)(b + c)(c + d)(d + a) (abc + abd + acd + bcd)(a + b + c + d);
by Maclaren we obtain:
a + b + c + d
4

_
ab + ac + bc + ad + bd + cd
6
and
1
a
+
1
b
+
1
c
+
1
d
4

1
ab
+
1
ac
+
1
ad
+
1
bc
+
1
bd
+
1
cd
6
,
which equivalent to
abc + abd + acd + bcd
_
8
3
(ab + ac + bc + ad + bd + cd)abcd.

Problem 28. (Polish MO 2008, Pro 5) Show that for all nonnegative real values an
inequality occurs:
4(

a
3
b
3
+

b
3
c
3
+

c
3
a
3
) 4c
3
+ (a + b)
3
.
29
Inequalities from 2008 Mathematical Competition
Proof. (Posted by NguyenDungTN). We have:
RHS LHS =
_

a
3
+

b
3
2

c
3
)
2
+ 3ab(

b
_
2
0
Thus we are done. Equality occurs for a = b = c or a = 0, b =
3

4c or a =
3

4c, b = 0

Problem 29. (Brazilian Math Olympiad 2008, Problem 3). Let x, y, z real numbers
such that x + y + z = xy + yz + zx. Find the minimum value of
x
x
2
+ 1
+
y
y
2
+ 1
+
z
z
2
+ 1
Proof. (Posted by crazyfehmy). We will prove that this minimum value is
1
2
. If we take
x = y = 1 , z = 1 , the value is
1
2
.
Lets prove that
x
1 + x
2
+
y
1 + y
2
+
z
1 + z
2
+
1
2
0
We have
x
1 + x
2
+
y
1 + y
2
+
z
1 + z
2
+
1
2
=
(1 + x)
2
2 + 2x
2
+
y
1 + y
2
+
z
1 + z
2

y
1 + y
2
+
z
1 + z
2
y
1 + y
2
+
z
1 + z
2
< 0
then (y + z)(yz + 1) < 0 and by similar way (x + z)(xz + 1) < 0 and (y + z)(yz + 1) < 0 .
Let all of x , y , z are dierent from 0.
All of x + y , y + z , x + z is 0 Then x + y + z 0 and xy + yz + xz 3.Its a
contradiction.
Exactly one of the (x + y) , y + z , x + z is < 0.
W.L.O.G, Assuming y + z < 0.
Because x + z > 0 and x + y > 0 so x > 0.
xz + 1 < 0 and xy + 1 < 0 hence y and z are < 0.
Let y = a and z = b. x =
ab + a + b
a + b + 1
and x > a >
1
x
and x > b >
1
x
.
So x > 1 and ab > 1.
Otherwise because of x > a and x > b hence
ab+a+b
a+b+1
> a and
ab+a+b
a+b+1
> b.
So b > a
2
and a > b
2
. So ab < 1. Its a contradiction.
Exactly two of them (x + y),(y + z),(x + z) are < 0.
W.L.O.G, Assuming y + z and x + z are < 0.
Because x + y > 0 so z < 0. Because xy < 0 we can assume x < 0 and y > 0.
Let x = a and z = c and because xz + 1 > 0 and xy + 1 < 0 so c <
1
y
and a >
1
y
.
Because y + z < 0 and x + y > 0 hence a < y < c and so
1
y
< a < y < c <
1
y
. Its a
contradiction.
30
Inequalities from 2008 Mathematical Competition
All of them are < 0 .So x + y + z < 0 and xy + yz + xz > 0 . Its a contradiction.
Some of x , y , z are = 0
W.L.O.G, Assuming x = 0. So y + z = yz = K and
y
1 + y
2
+
z
1 + z
2
=
K
2
+ K
2K
2
2K + 1

1
2
4K
2
+ 1 0
which is obviously true.
The proof is ended.

Problem 30. (Kiev 2008, Problem 1). Let a, b, c 0. Prove that

a
2
+ b
2
+ c
2
5
min((a b)
2
, (b c)
2
, (c a)
2
)
Proof. (Posted by canhang2007). Assume that a b c, then
min
_
(a b)
2
, (b c)
2
, (c a)
2
_
= min{(a b)
2
, (b c)
2
}
If a + c 2b, then (b c)
2
= min{(a b)
2
, (b c)
2
}, we have to prove
a
2
+ b
2
+ c
2
5(b c)
2
which is true because
a
2
+ b
2
+ c
2
5(b c)
2
(2b c)
2
+ b
2
+ c
2
5(b c)
2
= 3c(2b c) 0
If a + c 2b, then (a b)
2
= min{(a b)
2
, (b c)
2
}, we have to prove
a
2
+ b
2
+ c
2
5(a b)
2
which is true because
a
2
+ b
2
5(a b)
2
= 2(2a b)(2b a) 0
This ends the proof.

Problem 31. (Kiev 2008, Problem 2). Let x

1
, x
2
, , x
n
0, n > 3 and x
1
+ x
2
+
+ x
n
= 2 Find the minimum value of
x
2
1 + x
2
1
+
x
3
1 + x
2
2
+ ... +
x
1
1 + x
2
n
Proof. (Posted by canhang2007). By AM-GM Inequality, we have that
x
2
x
2
1
+ 1
= x
2

x
2
1
x
2
x
2
1
+ 1
x
2

1
2
x
1
x
2
31
Inequalities from 2008 Mathematical Competition
Apply this for the similar terms and adding them up to obtain
LHS 2
1
2
(x
1
x
2
+ x
2
x
3
+ + x
n
x
1
)
Moreover, we can easily show that
x
1
x
2
+ x
2
x
3
+ + x
n
x
1
x
k
(x
1
+ + x
k1
+ x
k+1
+ + x
n
) 1
for k is a number such that x
k
= max{x
1
, x
2
, . . . , x
n
}. Hence
LHS 2
1
2
=
3
2

Problem 32. (Hong Kong TST1 2009, Problem 1)Let

1
,
2
, . . . ,
2008
be real num-
bers. Find the maximum value of
sin
1
cos
2
+ sin
2
cos
3
+ . . . + sin
2007
cos
2008
+ sin
2008
cos
1
Proof. (Posted by brianchung11). By the AM-GM Inequality, we have
sin
1
cos
2
+sin
2
cos
3
+. . .+sin
2007
cos
2008
+sin
2008
cos
1

1
2

(sin
2

i
+cos
2

i+1
) = 1004
Equality holds when
i
is constant.

Problem 33. (Hong Kong TST1 2009, Problem 5). Let a, b, c be the three sides of
a triangle. Determine all possible values of
a
2
+ b
2
+ c
2
ab + bc + ca
Proof. (Posted by Hong Quy). We have
a
2
+ b
2
+ c
2
ab + bc + ca
and |a b| < c then a
2
+ b
2
c
2
< 2ab.
Thus,
a
2
+ b
2
+ c
2
< 2(ab + bc + ca)
1 F =
a
2
+ b
2
+ c
2
ab + bc + ca
< 2

Problem 34. (Indonesia National Science Olympiad 2008) Prove that for x and y
positive reals,
1
(1 +

x)
2
+
1
(1 +

y)
2

2
x + y + 2
.
32
Inequalities from 2008 Mathematical Competition
Proof. (Posted by Dr Sonnhard Graubner). This inequality is equivalent to
2 + 2x + 2y + x
2
+ y
2
2

xy 2x

y + 2x
3
2
+ 2y
3
2
8

y 0
We observe that the following inequalities hold
1. x + y 2

xy
2. x + y
2
2y

x
3. y + x
2
2x

y
4. 2 + 2y
3
2
+ 2x
3
2
6

xy.
Adding (1), (2), (3) and (4) we get the desired result.
Proof. (Posted by limes123). We have
(1 + xy)(1 +
x
y
) (1 + x)
2

1
(1 + x)
2

1
1 + xy

y
x + y
and analogously
1
(1 + y)
2

1
1 + xy

x
x + y
as desired.

Problem 35. (Baltic Way 2008). Prove that if the real numbers a, b and c satisfy
a
2
+ b
2
+ c
2
= 3 then

a
2
2 + b + c
2

(a + b + c)
2
12
.
When does the inequality hold?
Proof. (Posted by Raja Oktovin). By the Cauchy-Schwarz Inequality, we have
a
2
2 + b + c
2
+
b
2
2 + c + a
2
+
c
2
2 + a + b
2

(a + b + c)
2
6 + a + b + c + a
2
+ b
2
+ c
2
.
So it suces to prove that
6 + a + b + c + a
2
+ b
2
+ c
2
12.
Note that a
2
+ b
2
+ c
2
= 3, then we only need to prove that
a + b + c 3
But
(a+b+c)
2
= a
2
+b
2
+c
2
+2(ab+bc+ca) a
2
+b
2
+c
2
+2(a
2
+b
2
+c
2
) = 3(a
2
+b
2
+c
2
) = 9.
Hence a + b + c 3 which completes the proof.

33
Inequalities from 2008 Mathematical Competition
Problem 36. (Turkey NMO 2008 Problem 3). Let a.b.c be positive reals such that
their sum is 1. Prove that
a
2
b
2
c
3
(a
2
ab + b
2
)
+
b
2
c
2
a
3
(b
2
bc + c
2
)
+
a
2
c
2
b
3
(a
2
ac + c
2
)

3
ab + bc + ac
Proof. (Posted by canhang2007). The inequality is equivalent to

a
2
b
2
c
3
(a
2
ab + b
2
)

3(a + b + c)
ab + bc + ca
Put x =
1
a
, y =
1
b
, z =
1
c
, then the above inequality becomes

z
3
x
2
xy + y
2

3(xy + yz + zx)
x + y + z
This is a very known inequality.
Proof. (Posted by mehdi cherif). The inequality is equivalent to :

(ab)
2
c
3
(a
2
ab + b
2
)

3(a + b + c)
ab + ac + bc

(ab)
5
a
2
ab + b
2

3(abc)
3
(a + b + c)
ab + ac + bc
But
3(abc)
3
(a + b + c) = 3abc(

a)(abc)
2
(

ab)
2
(abc)
2
(AM GM)
Hence it suces to prove that :

(ab)
5
a
2
ab + b
2
(abc)
2
(

ab)

(ab)
3
c
2
(a
2
ab + b
2
)

ab

(ab)
3
c
2
(a
2
ab + b
2
)
+

c(a + b) 3

ab

(ab)
3
+ (bc)
3
+ (ca)
3
c
2
(a
2
ab + b
2
)
3

ab
On the other hands,

(ab)
3
+ (bc)
3
+ (ca)
3
c
2
(a
2
ab + b
2
)
9
(ab)
3
+ (ac)
3
+ (bc)
3
2

(ab)
2
abc(

a)
It suces to prove that :
9
(ab)
3
+ (ac)
3
+ (bc)
3
2

(ab)
2
abc(

a)
3

ab
Denote that x = ab, y = ac and z = bc
3
x
3
+ y
3
+ z
3
2(x
2
+ y
2
+ z
2
) xy + yz + zx
x + y + z

x
3
+ 3xyz

xy(x + y)
which is Schur inequality ,and we have done.
34
Inequalities from 2008 Mathematical Competition

Problem 37. (China Western Mathematical Olympiad 2008). Given x, y, z (0, 1)

satisfying that
_
1 x
yz
+
_
1 y
xz
+
_
1 z
xy
= 2.
Find the maximum value of xyz.
Proof. (Posted by Erken). Lets make the following substitution: x = sin
2
and so on...
It follows that
2 sin sin sin =

cos sin
But it means that + + = , then obviously
(sin sin sin )
2

27
64
Proof. (Posted by turcas
c
). We have that
2

xyz =
1

3
_
x(3 3x)
1

x + 3(1 x)
2
=
=
3

3
2

1

x.
So 2

xyz
3

3
2

1

x
3

3
2

3
3

xyz.
If we denote p =
6

xyz we get that 2p

3

3
2

3p
2
. This is equivalent to
4p
3
+ 2

3p
2
3

3 0 (2p

3)(2p
2
+ 2

3p + 3) 0,
then p

3
2
. So xyz
27
64
. The equality holds for x = y = z =
3
4
.

Problem 38. (Chinese TST 2008 P5) For two given positive integers m, n > 1, let
a
ij
(i = 1, 2, , n, j = 1, 2, , m) be nonnegative real numbers, not all zero, nd the
maximum and the minimum values of f, where
f =
n

n
i=1
(

m
j=1
a
ij
)
2
+ m

m
j=1
(

n
i=1
a
ij
)
2
(

n
i=1

m
j=1
a
ij
)
2
+ mn

n
i=1

m
i=j
a
2
ij
Proof. (Posted by tanpham). We will prove that the maximum value of f is 1.
For n = m = 2. Setting a
11
= a, a
21
= b, a
12
= x, a
21
= y. We have
f =
2
_
(a + b)
2
+ (x + y)
2
+ (a + x)
2
+ (b + y)
2
_
(a + b + x + y)
2
+ 4 (a
2
+ b
2
+ x
2
+ y
2
)
1
= (x + b a y)
2
0
as needed.
35
Inequalities from 2008 Mathematical Competition
For n = 2, m = 3. Using the similar substitution:
(x, y, z), (a, b, c)
We have
f =
2 (a + b + c)
2
+ 2 (x + y + z)
2
+ 3 (a + x)
2
+ 3 (b + y)
2
+ 3 (c + z)
2
6 (a
2
+ b
2
+ c
2
+ x
2
+ y
2
+ z
2
) + (a + b + c + x + y + z)
2
1
(x + b y a)
2
+ (x + c z a)
2
+ (y + c b z)
2
0
as needed.
For n = 3, m = 4. With
(x, y, z, t), (a, b, c, d), (k, l, m, n)
The inequality becomes
(x + b a y)
2
+ (x + c a z)
2
+ (x + d a t)
2
+ (x + l k y)
2
+
+(x + mk z)
2
+ (x + n k t)
2
+ (y + c b z)
2
+ (y + d b t)
2
+
+(y + ml z)
2
+ (y + n l t)
2
+ 0
as needed.
By induction, the inequality is true for every integer numbers m, n > 1

36
Chapter 3
The inequality from IMO 2008
In this chapter, we will introduce 11 solutions for the inequality from IMO 2008.
Problem.
(i). If x, y and z are three real numbers, all dierent from 1 , such that xyz = 1, then
prove that
x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
1
With the sign

for cyclic summation, this inequality could be rewritten as

x
2
(x 1)
2
1
(ii). Prove that equality is achieved for innitely many triples of rational numbers
x, y and z.
Solution.
Proof. (Posted by vothanhvan). We have

cyc
_
1
1
y
_
2
_
1
1
z
_
2

_
1
1
x
_
2
_
1
1
y
_
2
_
1
1
z
_
2

_
1
x
+
1
y
+
1
z
3
_
2
0
We conclude that

cyc
x
2
(y 1)
2
(z 1)
2
(x 1)
2
(y 1)
2
(z 1)
2

x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
1
Q.E.D

Proof. (Posted by TTsphn). Let

a =
x
1 x
, b =
y
1 y
, c =
z
1 z
37
Inequalities from 2008 Mathematical Competition
Then we have :
bc = (a +1)(b +1)(c +1) =
1
(x 1)(y 1)(z 1)
ab +ac +bc +a +b +c +1 = 0
Therefore :
a
2
+b
2
+c
2
= a
2
+b
2
+c
2
+2(ab+ac+bc)+2(a+b+c)+2 a
2
+b
2
+c
2
= (a+b+c+1)
2
+1 1
So problem a claim .
The equality hold if and only if a + b + c + 1 = 0.
This is equivalent to
xy + zx + zx = 3
From x =
1
yz
we have
1
z
+
1
y
+ yz = 3 z
2
y
2
y(3z 1) + z = 0
= (3z 1)
2
4z
3
= (z 1)
2
(1 4z)
We only chose z =
1 m
2
4
, |m| > 0 then the equation has rational solution y. Because
x =
1
yz
so it also a rational .
Problem claim .

Proof. (Posted by Darij Grinberg). We have

x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
1 =
(yz + zx + xy 3)
2
(x 1)
2
(y 1)
2
(z 1)
2
For part (ii) you are looking for rational x, y, z with xyz = 1 and x + y + z = 3.
In other words, you are looking for rational x and y with x + y +
1
xy
= 3. This
rewrites as y
2
+ (x 3) y +
1
x
= 0, what is a quadratic equation in y. So for a given
x, it has a rational solution y if and only if its determinant (x 3)
2
4
1
x
is a
square. But (x 3)
2
4
1
x
=
x4
x
(x 1)
2
, so this is equivalent to
x4
x
being a square.
Parametrize...

Proof. (Posted by Erken). Let a = 1

1
x
and so on... Then our inequality becomes:
a
2
b
2
+ b
2
c
2
+ c
2
a
2
a
2
b
2
c
2
while (1 a)(1 b)(1 c) = 1.
Second condition gives us that:
a
2
b
2
+ b
2
c
2
+ c
2
a
2
= a
2
b
2
c
2
+ (a + b + c)
2
a
2
b
2
c
2
38
Inequalities from 2008 Mathematical Competition

Proof. (Posted by Sung-yoon Kim). First letting x =

q
p
, y =
r
q
, z =
p
r
,. We have
to show that

q
2
(p q)
2
1
Dene f(t) to be

(t + q)
2
(p q)
2
= (

1
(p q)
2
)t
2
+ 2(

q
(p q)
2
)t +

q
2
(p q)
2
= At
2
+ 2Bt + C
This is a quadratic function of t and we know that this has minimum at t
0
such that
At
0
+ B = 0.
Hence,
f(t) f(t
0
) = At
2
0
+ 2Bt
0
+ C = Bt
0
+ C =
AC B
2
A
Since
AC B
2
= (

1
(p q)
2
)(

q
2
(p q)
2
) (

q
(p q)
2
)
2
and we have
(a
2
+ b
2
+ c
2
)(d
2
+ e
2
+ f
2
) (ad + be + cf)
2
=

(ae bd)
2
,
We obtain
AC B
2
=

(
r q
(p q)(q r)
)
2
=

1
(p q)
2
= A
This makes f(t) 1, as desired.
The second part is trivial, since we can nd (p, q, r) with xed p q and any various
q r, which would give dierent (x, y, z) satisfying the equality.

Proof. (Posted by Ji Chen). We have

x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
1

a
6
(a
3
abc)
2
+
b
6
(b
3
abc)
2
+
c
6
(c
3
abc)
2
1
=
(bc + ca + ab)
2
(b
2
c
2
+ c
2
a
2
+ a
2
b
2
a
2
bc b
2
ca c
2
ab)
2
(a
2
bc)
2
(b
2
ca)
2
(c
2
ab)
2
0

39
Inequalities from 2008 Mathematical Competition
Proof. (Posted by kunny). By xyz = 1, we have
x
x 1
+
y
y 1
+
z
z 1

_
xy
(x 1)(y1)
+
yz
(y 1)(z 1)
+
zx
(z 1)(x 1)
_
=
x(y 1)(z 1) + y(z 1)(x 1) + z(x 1)(y 1) xy(z 1) yz(x 1) zx(y 1)
(x 1)(y 1)(z 1)
=
x(y 1)(z 1 z) + y(z 1)(x 1 x) + zx(y 1 y)
(x 1)(y 1)(z 1)
=
x + y + z (xy + yz + zx)
(x 1)(y 1)(z 1)
=
x + y + z (xy + yz + zx) + xyz 1
(x 1)(y 1)(z 1)
=
(x 1)(y 1)(z 1)
(x 1)(y 1)(z 1)
= 1
(Because x = 1, y = 1, z = 1).)
Therefore
x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
=
_
x
x 1
+
y
y 1
+
z
z 1
_
2
2
_
xy
(x 1)(y 1)
+
yz
(y 1)(z 1)
+
zx
(z 1)(x 1)
_
=
_
x
x 1
+
y
y 1
+
z
z 1
_
2
2
_
x
x 1
+
y
y 1
+
z
z 1
1
_
=
_
x
x 1
+
y
y 1
+
z
z 1
1
_
2
+ 1 1
The equality holds when
x
x 1
+
y
y 1
+
z
z 1
= 1
1
x
+
1
y
+
1
z
= 3

Proof. (Posted by kunny). Let x + y + z = a, xy + yz + zx = b, xyz = 1, x, y, z

are the roots of the cubic equation :
t
3
at
2
+ bt 1 = 0
If t = 1 is the roots of the equation, then we have
1
3
a 1
2
+ b 1 1 = 0 a b = 0
40
Inequalities from 2008 Mathematical Competition
Therefore t = 1 a b = 0.
Thus the cubic equation with the roots =
x
x1
, =
y
y1
, =
z
z1
is
_
t
t 1
_
3
a
_
t
t 1
_
+ b
t
t 1
1 = 0
(a b)t
3
(a 2b + 3)t
2
(b 3)t 1 = 0 []
Let a b = p = 0, b 3 = q, we can rerwite the equation as
pt
3
(p q)t
2
qt 1 = 0
By Vietas formula, we have
+ + =
p q
p
= 1
q
p
, + + =
q
p
Therefore
x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
=
2
+
2
+
2
= ( + + )
2
2( + + )
=
_
1
q
p
_
2
2
_

q
p
_
=
_
q
p
_
2
+ 1 1,
The equality holds when
q
p
= 0 q = 0 b = 3, which completes the proof.

Proof. (Posted by kunny). Since x, y, z arent equal to 1, we can set x = a+1, y =

b + 1, z = c + 1 (abc = 0).
x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
=
(a + 1)
2
a
2
+
(b + 1)
2
b
2
+
(c + 1)
2
c
2
= 3 + 2
_
1
a
+
1
b
+
1
c
_
+
1
a
2
+
1
b
2
+
1
c
2
= 3 +
2(ab + bc + ca)
abc
+
(ab + bc + ca)
2
2abc(a + b + c)
(abc)
2
[]
Let
a + b + c = p, ab + bc + ca = q, abc = r = 0
we have xyz = 1 p + q + r = 0, since r = 0, we have
[] = 3 +
2q
r
+
q
2
2rp
r
2
= 3 +
2q
r
+
_
q
r
_
2
2
p
r
= 3 +
2q
r
+
_
q
r
_
2
+ 2
q + r
r
=
_
q
r
_
2
+ 4
q
r
+ 5
=
_
q
r
+ 2
_
2
+ 1 1.
41
Inequalities from 2008 Mathematical Competition
The equality holds when q = 2r and p+q+r = 0 (r > 0) p : q : r = 1 : (2) : 1.
Q.E.D.

Proof. (Posted by Allnames). The inequality can be rewritten in this form

1
(1 a)
2
1
or

(1 a)
2
(1 b)
2
((1 a)(1 b)(1 c))
2
where x =
1
a
and abc = 1.
We set a + b + c = p, ab + bc + ca = q, abc = r = 1. So the above inequality is
equivalent to
(p 3)
2
0
which is clearly true.

Proof. (Posted by tchebytchev). Let x =

1
a
, y =
1
b
and z =
1
c
. We have
x
2
(x 1)
2
+
y
2
(y 1)
2
+
z
2
(z 1)
2
=
1
(1 a)
2
+
1
(1 b)
2
+
1
(1 c)
2
=
_
1
(1 a)
+
1
(1 b)
+
1
(1 c)
_
2
2
_
1
(1 a)(1 b)
+
1
(1 b)(1 c)
+
1
(1 c)(1 a)
_
=
_
3 2(a + b + c) + ab + bc + ca
ab + bc + ca (a + b + c)
_
2
2
_
3 (a + b + c)
ab + bc + ca (a + b + c)
_
=
_
1 +
3 (a + b + c)
ab + bc + ca (a + b + c)
_
2
2
_
3 (a + b + c)
ab + bc + ca (a + b + c)
_
= 1 +
_
3 (a + b + c)
ab + bc + ca (a + b + c)
_
2
1

42
Inequalities from 2008 Mathematical Competition
Glossary
1. AM-GM inequality
For all non-negative real number a
1
, a
2
, , a
n
then
a
1
+ a
2
+ + a
n
n
n

a
1
a
2
a
n
2. Cauchy-Schwarz inequality
For all real numbers a
1
, a
2
, , a
n
and b
1
, b
2
, , b
n
then
_
a
2
1
+ a
2
2
+ + a
2
n
_ _
b
2
1
+ b
2
2
+ + n
2
n
_
(a
1
b
1
+ a
2
b
2
+ + a
n
b
n
)
3. Jensen Inequality
If f is convex on I then for all a
1
, a
2
, , a
n
I we have
f(x
1
) + f(x
2
) + + f(x
n
) nf
_
x
1
+ x
2
+ + x
n
n
_
4. Schur Inequality
For all non-negative real numbers a, b, c and positive real number numbers r
a
r
(a b) (a c) + b
r
(b a) (b c) + c
r
(c a) (c b) 0
Moreover, if a, b, c are positive real numbers then the above results still holds
for all real number r
5. The extension of Schur Inequality (We often call Vornicu-Schur in-
equality)
For x y z and a b c then
a (x y) (x z) + b (y z) (y x) + c (z x) (z y) 0
43
Bibliography
[1] Cirtoaje,V., Algebraic Inequalities, GIL Publishing House, 2006
[2] Pham Kim Hung, Secret in Inequalities, 2 volumes, GIL Publishing House,
2007, 2009
[3] LittleWood, G . H., Polya, J . E., Inequalities, Cambridge University Press,
1967
[4] Pham Van Thuan, Le Vi, Bat dang thuc, suy luan va kham pha, Hanoi National
University House, 2007
[5] Romanian Mathematical Society, RMC 2008, Theta Foundation 2008
44