Inequalities from 2009 Mathematical Competition ‫څڅڅڅڅ‬

DIEN DAN BAT DANG THUC VIET NAM

The VietNam Inequality Mathematic Forum

http://www.ddbdt.tk

‫څڅڅڅڅ‬

Ebook Write by:

Nguyen Dinh Thi

User group: All

Contact

If you have any question about this ebook, please contact us.
Email: vif.vimf@gmail.com

‫څڅڅ‬
This product is created for educational purpose. Please don't use it for any
commecial purpose unless you got the right of the author. Please contact
http://ddbdt.tk for more details.

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 1
Abbreviations ‫څڅڅ‬

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

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 2
Contents ‫څڅڅ‬

Contents

1 Problems 4

2 Solutions 7

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 3
Problems ‫څڅڅ‬

Inequalities From 2009 Mathematical

Competition Over The World

‫څڅڅ‬
Pro 1 (USA TST 2009). Prove that for positive real numbers x, y, z
x3 (y 2 + z 2 )2 + y 3 (z2 + x 2 )2 + z 3 (x 2 + y 2 )2 ≥ xyz[xy(x + y)2 + yz(y + z)2 + zx(z + x)2

Pro 2 (Germany TST 2009). Let a, b, c, d be positive numbers. Prove that

(a − b)(a − c) (b − c)(b − d ) (c − d )(c − a) (d − a)(d − b)
+ + + ≥0
a+b+c b+c+d c+d+a d +a+b

Pro 3 (China TST 2009). Let x1 , x2 , ⋯, xm , y1 , y2 , ⋯, yn be positive real numbers. Denote

m n
by X = ∑ x, Y =
i =1
∑ y.
j =1
Prove that

m n n n m m
2 XY ∑ ∑ |xi − y j |≥ X 2 ∑ ∑ |y i − y l | +Y 2 ∑ ∑ |xi − xk |
i =1 j =1 j =1 l =1 i =1 k =1

Pro 4 (India National Olympiad 2009). Let a, b, c be positive real numbers such that
a3 + b3 = c 3 .Prove that
a2 + b2 − c2 > 6(c − a)(c − b)

Pro 5 (Indonesia TST 2009). Let x, y, z be real numbers. Find the minimum value of
x2 + y 2 + z2 if x3 + y 3 + z3 − 3xyz = 1 .

Pro 6 (Iran TST 2009). Suppose that a, b, c be three positive real numbers such that
a + b + c = 3 . Prove that
1 1 1 3
2 2
+ 2 2
+ 2 2
≤
2+a +b 2+b +c 2+c +a 4

Pro 7 (Serbia TST 2009). Let x, y , z be positive real numbers such that
xy + yz + zx = x + y + z . Prove the inequality
1 1 1
2
+ 2 + 2 ≤1
x + y +1 y + z +1 z + x +1

Pro 8 (USA USAMO 2009). For n ≥ 2 let a1 , a2 ,., an be positive real numbers such that
2
1 1 1  1
(a1 + a2 + ... + an )  + + ... +  ≤ n +  . Prove that
 a1 a2 an   2 
max(a1 , a2 ,., an ) ≤ 4min(a1 , a2 ,., an )

Pro 9 (Serbia Junior Balkan TST 2009). For positive real numbers x, y, z holds
1 1 1 1
+ 2 + 2 = . Prove the inequality
x +1 y +1 z +1 2
2

1 1 1 1
+ 3 + 3 ≤
x +2 y +2 z +2 3
3

Pro 10 (China 2009). Let x, y, z be real numbers greater than or equal to 1. Prove that

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 4
Problems ‫څڅڅ‬
∏(x − 2 x + 2) ≤ ( xyz ) − 2 xyz + 2
2 2

Pro 11 (Mediterranean Mathematics Olympiad 2009). For positive real numbers

x, y , z
. Prove that
xy x
∑ xy + x 2 + y 2 ≤ ∑ 2x + z

Pro 12 (Poland 2009). For positive real numbers a, b, c and n ≥ 1, n ∈ ℕ . Prove that
an +1 b n +1 c n +1  an bn c n  n an + b n + c n
+ + ≥ + + 
b + c c + a a + b b + c c + a a + b 3

Pro 13 (Moldova TST 2009). Let m, n ∈ N, n ≥ 2 and positive real numbers

n
ai > 0, i = 1, n , such that ∑a
i =1
i = 1 . Prove that

a12 − m + a2 + … + an −1 a22 − m + a3 + … + an a2 − m + a1 + … + an −2 nm − n
+ +…+ n ≥ n+
1 − a1 1 − a2 1 − an n −1

Pro 14 (Costa Rica Final Round 2009). Let x and y positive real numbers such that
(1 + x ) (1 + y ) = 2 . Show that
1
xy + ≥6
xy

Pro 15 (Russia All-Russian Olympiad 2009). Prove that

loga b + logb c + logc a ≤ logb a + logc b + loga c for all 1 < a ≤ b ≤ c

Pro 16 (Croatia TST 2009). Prove for all positive reals a, b, c, d

a−b b−c c −d d −a
+ + + ≥0
b+c c +d d +a a+b

Pro 17 (Vietnam TST 2009). Let a, b, c be positive numbers. Find k such that
3
 a  b  c   1
k + b + c  k + c + a  k + a + b  ≥ k + 2 
     

1 
Pro 18 (Moldova TST 2009). Let x, y, z be real number in the interval  ;2 and
2 
a, b, c a permutation of them. Prove the inequality:
60a2 − 1 60b2 − 1 60c 2 − 1
+ + ≥ 12
4 xy + 5z 4yz + 5x 4 zx + 5y

Pro 19 (Germany TST 2009). Let be positive real numbers such that abcd = 1 and
a b c d
a + b + c + d > + + + . Prove that
b c d a
b c d a
a+b+c +d < + + +
a b c d

Pro 20 (Middle European Mathematical Olympiad 2009). Let x, y , z be real

numbers satisfying x + y + z + 9 = 4(x + y + z ) . Prove that
2 2 2

x 4 + y 4 + z 4 + 16( x 2 + y 2 + z 2 ) ≥ 8(x 3 + y 3 + z 3 ) + 27

Pro 21 (Hungary-Israel Binational 2009). Let x, y, z be non negative numbers. Prove

that

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 5
Problems ‫څڅڅ‬
x 2 + y 2 + z 2 + xy + yz + zx x + y + z x2 + y 2 + z2
≤ .
6 3 3

Pro 22 (Kyrgyzstan TST 2009). Does a2 + b2 + c 2 ≤ 2(ab + bc + ca) hold for every
a, b, c if it is known that a4 + b4 + c 4 ≤ 2(a2 b2 + b2 c 2 + c 2 a2 )

Pro 23 (Indonesia National Science Olympiad 2009). Let x1 , x2 ,..., xn be real

numbers greater than 1. Show that
x1 x2 x2 x3 x x
+ + ... + n 1 ≥ 4n
x3 x4 x2

Pro 24 (Kyrgyzstan TST 2009). For any positive a1 , a2 ,..., an prove that
a1 a2 an n
+ + ... + >
a2 + a3 a3 + a4 a1 + a2 4

Pro 25 (Spain Mathematical Olympiad 2009). Let a, b, c real positive numbers with
abc = 1 .Prove that
2 2 2
 a   b   c  3
 1 + ab  +  1 + bc  +  1 + ca  ≥ 4
     

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 6
Solution ‫څڅڅ‬

SOLUTION
‫څڅڅ‬
We thank a lot to Mathlinks Forum and VietNam Inequality Forum and their member for
the reference to problems and some nice solutions from them!

Pro 1 (USA TST 2009). Prove that for positive real numbers x, y, z
x3 (y 2 + z 2 )2 + y 3 (z2 + x 2 )2 + z 3 (x 2 + y 2 )2 ≥ xyz[xy(x + y)2 + yz(y + z)2 + zx(z + x)2

Solution 1 (VIMF). Write the inequality become

x ( xy 2 + xz 2 ) − ( y 2 z + yz 2 )  + y ( yz 2 + yx 2 ) − ( x 2 z + xz 2 )  + z ( zx 2 + zy 2 ) − ( x 2 y + xy 2 )  ≥ 0
2 2 2 2 2 2

     
⇔ x ( xy 2 + xz 2 + y 2 z + yz 2 )  y 2 ( x − z ) + z 2 ( x − y )  + y ( yx 2 + yz 2 + x 2 z + xz 2 )  x 2 ( y − z ) + z 2 ( y − x ) 
+ z ( zx 2 + zy 2 + x 2 y + xy 2 )  x 2 ( z − y ) + y 2 ( z − x )  ≥ 0
Or
(
x 2 ( y − z ) x 2 y 2 + yz 2 + x 2 yz + xyz 2 − x 2 z 2 − z 2 y 2 − x 2 yz − xy 2 z )
+y 2
( z − x ) ( x z + z y + x yz + xy z − x y − x z − xy z − xyz 2 )
2 2 2 2 2 2 2 2 2 2 2

+ z 2 ( x − y ) ( x 2 y 2 + z 2 x 2 + xy 2 z + xyz 2 − x 2 y 2 − y 2 z 2 − x 2 yz − xyz 2 ) ≥ 0

⇔ x 3 ( y − z ) ( xy + xz − yz ) + y 3 ( z − x ) ( xy + yz − zx ) + z 3 ( x − y ) ( yz + zx − xy ) ≥ 0
2 2 2

Let
Sx = x 3 ( xy + zx − yz ) , Sy = y 3 ( xy + yz − zx ) , Sz = z 3 (yz + zx − xy )
We must prove that
S = Sx ( y − z ) + Sy ( z − x ) + Sz ( x − y ) ≥ 0
2 2 2

Assume x ≥ y ≥ z . We have Sy ≥ 0
Another
(
Sx + Sy = x 4 y + x 3 z ( x − y ) + xy 4 + y 3 z ( y − x ) ≥ z ( x − y ) x 3 − y 3 = z ( x − y ) ) (x 2 2
)
+ xy + y 2 ≥ 0,

Sy + Sz = y 4 z + xy 3 ( y − z ) + yz 4 + xz 3 ( z − y ) ≥ x (y − z ) (y − z ) = x (y − z ) (y + yz + z ) ≥ 0
3 3 2 2 2

Thus
(
S = Sx + Sy ) (y − z ) + (S
2
y + Sz ) (x − y) 2
+ 2Sy ( x − y ) ( y − z ) ≥ 0
We have Q.E.D

Solution 2 (Vo Quoc Ba Can).

1 1 1
Let x = , y = , z = , the inequality becomes
a b c
(b2 + c 2 )2 1 (b + c )2
∑ a3b4c 4 ≥ abc ∑ b3c3 ,
or equivalently,
∑ a(b2 + c2 )2 ≥ ∑ a3(b + c)2. (1)
We have
∑ a(b 2
+ c2 )2 = ∑ a(b4 + c 4 ) + 2∑ ab2c 2 = ∑ a4 (b + c) + ∑ a2bc(b + c),
so the last inequality can be written as ∑ [a (b + c) + a bc(b + c) − a (b + c) ] ≥ 0, that is
4 2 3 2

∑ a (b + c)(a − b)(a − c) ≥ 0.
2

This can be proved easily using Vornicu Schur.

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 7
Solution ‫څڅڅ‬
Comment.
Especially, we have a very nice identity which implies (1), it is
LHS − RHS = ∑ a(b − c)2 (b + c − a)2.

Pro 2 (Germany TST 2009). Let a, b, c, d be positive numbers. Prove that
(a − b)(a − c) (b − c)(b − d ) (c − d )(c − a) (d − a)(d − b)
+ + + ≥0
a+b+c b+c+d c+d+a d +a+b

Solution (quykhtn-qa1).
We will prove the stronger inequality
Let a, b, c, d be positive numbers. Prove that
(a − b)(a − c) (b − c)(b − d ) (c − d )(c − a) (d − a)(d − b) (a + b − c − d)2
+ + + ≥
a+b+c b+c+d c+d +a d +a+b 8(a + b + c + d )
First,we have
a−b c −d a2 − c 2 + 2ad − 2bc − ab + cd
− =
a+b+c c +d +a (a + b + c)(c + d + a)
a2 − c 2 + ad − bc − 2ab + 2cd + (a − c)(b + d )
=
(a + b + c)(c + d + a)
So,
a−b c −d (a − c)(2a + 2c + b + d ) + 3(a + c)(d − b)
2( − )=
a+b+c c +d +a (a + b + c)(c + d + a)
Similar,we have
 b−c d − a  (b − d )(2b + 2d + a + c ) + 3(b + d )(a − c )
2  − =
 b + c + d d + a + b  (b + c + d )(d + a + b)
Then,
(a − c )2 (2a + 2c + b + d ) (b − d )2 (2b + 2d + a + c )
2LHS = +
(a + b + c )(c + d + a) (b + c + d)(d + a + b)
 b+d a+c 
+3(a − c)(b − d)  −
 (b + c + d )(d + a + b) (a + b + c)(c + d + a)
- If (a − c )(b − d ) ≥ 0 , we have
(2a + 2c + b + d )2
(a + b + c )(c + d + a) ≤
4
So,
2a + 2c + b + d 4 2
≥ >
(a + b + c)(c + d + a) 2a + 2c + b + d a+b+c +d
Similar, we have
2b + 2d + a + c 2
>
(b + c + d )(d + a + b) a + b + c + d
On the other hand
(a + b + c)(c + d + a) = (c + a)(a + b + c + d) + bd > (a + c)(a + b + c + d )
So,
a+c 1
<
(a + b + c )(c + d + a) a + b + c + d
Then,we have
(a − c )2 + (b − d )2 (a − c )(b − d ) (a − c)2 + (b − d )2 (a + b − c − d )2
2.LHS ≥ 2 −3 ≥ ≥
a+b+c +d (a + b + c + d ) 2(a + b + c + d) 4(a + b + c + d )
we have Q.E.D
- If (a − c )(b − d ) ≤ 0 , similar, we have Q.E.D
Equality holds if and only if a = c; b = d

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 8
Solution ‫څڅڅ‬
Pro 3 (China TST 2009). Let x1 , x2 , ⋯, xm , y1 , y2 , ⋯, yn be positive real numbers. Denote
m n
by X = ∑ x, Y
i =1
= ∑ y.
j =1
Prove that

m n n n m m
2 XY ∑ ∑ |xi − y j |≥ X 2 ∑ ∑ |y i − y l | +Y 2 ∑ ∑ |xi − xk |
i =1 j =1 j =1 l =1 i =1 k =1

Solution (BG Yoda).

Well assume x1 ≥ x2 ≥ … ≥ xn and X ≥ Y , then make an induction: if the inequality is
true for m − 1 , then we can prove for x = x1 + x2 the following statement, which will
solve our problem in matter of fact
n m n m 
X ∑ |x − y j | −Y ∑ |x − xi |≤ X ∑ (| x1 − y j | + | x2 − y j |) − Y ∑ (| x1 − xi | + | x2 − xi |)+ | x1 − x2 | (*)
j =1 i =3 j =1  i =3 
First
n m n m n m
LHS = X ∑ |x − y j | −Y ∑ |x − xi |= ∑∑x i | x − y j | −∑ ∑ y j | x − x j |
j =1 i =3 j =1 i =1 j =1 i =3
n m 
RHS = X ∑ (| x1 − y j | + | x2 − y j |) − Y ∑ (| x1 − xi | + | x2 − xi |)+ | x1 − x2 |
j =1  i =3 
n m n m
−∑ ∑ (y j | x1 − xi | +y j | x2 − xi |) + y j | x1 − x2 |) = ∑ ∑ (x i
| x1 − y j | + xi | x2 − y j |)
j =1 i =3 j =1 i =1

and now using the inequality

| xxi − y j xi | − | y j x − y j xi |≤ xi | x1 − y j | +xi | x2 − y j | −y j | x1 − xi | −y j | x2 − xi |
which follows by verifying all cases −x1 ≥ x2 ≥ y j ∪ x ≥ y j etc. , we will take what we
need. Hence
m n n n m m
2 XY ∑ ∑ |xi − y j | −X 2 ∑ ∑ |y i − y j | −Y 2 ∑ ∑ |xi − x j |
i =1 j =1 i =1 j =1 i =1 j =1
m n n n m m
≥ 2 XY ∑ ∑ |xi′ − y j | −X 2 ∑ ∑ |y i − y j | −Y 2 ∑ ∑ |xi′ − x ′j |≥ 0(by (*)),
i =2 j =1 i =1 j =1 i =2 j =1

where x2′ = x1 + x2 and xi′ = xi for i ≥ 3 ...

Pro 4 (India National Olympiad 2009). Let a, b, c be positive real numbers such that
a3 + b3 = c 3 .Prove that
a2 + b2 − c2 > 6(c − a)(c − b)

Solution (nicetry007).
We are given a3 + b3 = c 3
We use the following factorization
p3 + q3 + r 3 − 3pqr = (p + q + r )(p2 + q2 + r 2 − pq − qr − rp)
Substituting p = a , q = b and r = −c , we get
3abc = (a + b − c)(a2 + b2 + c2 − ab + bc + ca)
In other words,
3abc
a2 + b2 + c 2 − ab + bc + ca =
a+ b−c
3abc
a2 + b2 − c 2 − (c − a)(c − b) = − 3c 2
a+ b−c
3c(c − a)(c − b)
a2 + b2 − c 2 − (c − a)(c − b) =
a+ b−c
Enough to show

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 9
Solution ‫څڅڅ‬
3c(c − a)(c − b) 3c 8
> 5(c − a)(c − b) ⇔ > 5 ⇔ a + b < c (note a + b > c )
a+b−c a+b−c 5
1
8
This implies a + b ≤ 43 c < c . Hence proved.
5

Solution 2 (Agr_94_Math).
a b
Let x = , y = . Thus given x 3 + y 3 = 1 , x, y > 0 , prove that
c c
x2 + y 2 − 1 > 6(1 − x)(1 − y)
LHS = x 2 + y 2 − 1 = x 2 − x 3 + y 2 − y 3 = x2 (1 − x) + y 2 (1 − y ) ≥ 2xy (1 − x)(1 − y ).
Also x3 = 1 − y 3 = (1 − y)(1 + y + y 2 ) ≥ 3y(1 − y) . Similarly y 3 ≥ 3x(1 − x) . Thus
multiplying these two inequalities we get x 2y 2 > 9(1 − x)(1 − y) or xy > 3 (1 − x)(1 − y)
(we get strict inequality because both equalities cannot happen simultaneously)
Therefore 2xy (1 − x)(1 − y) > 6(1 − x)(1 − y )
and we are done

Solution 3 (Mathias_DK).
Assume wlog c = 1 and then use Langrange Multipliers:
F (a, b, c, λ) = a2 + b2 + 6a + 6b + 6ab − 7 − λ(a3 + b3 − 1) ≥ 0
Fa = 2a + 6 + 6b − 3λa2 = 0, Fb = 2b + 6 + 6a − 3λb2 = 0
Then
Fa = 0, Fb = 0 ⇒ −4(a − b) = 3λ(a − b)(a + b)
−4
So there is a extremum when a = b . Now assume a ≠ b : 3λ = . Then
a+b
4
Fa = 2a + 6b + 6b + a2 > 0
a+b
1
So there is only extremum when a = b : then a = b = 3 :
2
1 1
a2 + b2 + 6a + 6b + 6ab − 7 > 0 ⇔ 8—3 + 12—3 − 7 > 0
4 2
which is obvious.
Then we just have to consider the points a = 1, b = 0 and a = 0, b = 1 in which there are
equality.


Pro 5 (Indonesia TST 2009). Let x, y, z be real numbers. Find the minimum value of
x2 + y 2 + z2 if x3 + y 3 + z3 − 3xyz = 1 .

Solution 1 (Raja Oktovin).

1
Let x + y + z = k , then x 2 + y 2 + z 2 − xy − yz − zx = and clearly k > 0 .
k
Now we obtain
k3 − 1 k3 + 2
x 2 + y 2 + z 2 + 2( xy + yz + zx ) = k 2 , xy + yz + zx =
, x2 + y 2 + z2 = ≥ 1.
3k 3k
Let x = y = 0 dan z = 1 , we know that the minimum value is 1 .

Solution 2 (great math).

2 2 2
(a3
+ b3 + c 3 − 3abc ) = (a + b + c ) (a2 + b2 + c 2 − ab − bc − ca)
2
= (a2 + b2 + c 2 + 2ab + 2bc + 2ca)( a2 + b2 + c 2 − ab − bc − ca)
After that, we slightly obtain Cauchy - Schwartz inequality, that deduces to prove that

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 10
Solution ‫څڅڅ‬
2
(a 2
+ b2 + c 2 + 2ab + 2bc + 2ca)( a2 + b2 + c 2 − ab − bc − ca)
3
 ( a2 + b2 + c 2 + 2ab + 2bc + 2ca) + (a2 + b2 + c 2 − ab − bc − ca) + (a2 + b2 + c 2 − ab − bc − ca)
 
≤  
 3
 

Solution 3 (onlylove_math).
If a2 + b2 + c 2 = 1 then | a3 + b3 + c3 − 3abc |≤ 1
Let a + b + c = p; ab + bc + ca = q; abc = r . So p2 − 2q = 1 . We have
| a3 + b3 + c3 − 3abc |≤ 1 ⇔| p3 − 3pq + 3r − 3r |≤ 1
⇔| p(p2 − 2q) − pq |≤ 1 ⇔| p3 − 3p |≤ 2 ⇔ −2 ≥ p3 − 3p ≤ 2
Let f (p) = p3 − 3p ⇒ f ′(p) = 3p2 − 3
- Case 1: 1 ≤ p ≤ 3 then f ′(p) ≥ 0 ⇒ f (1) ≤ f (p) ≤ f ( 3) ⇒ −2 ≤ f (p) ≤ 0
- Case 2: −1 ≤ p ≤ 1 then f ′(p) ≤ 0 ⇒ f (1) ≤ f (p) ≤ f (−1) ⇒ −2 ≤ f (p) ≤ 2
- Case 3: − 3 ≤ p ≤ − 1 then f ′(p) ≥ 0 ⇒ f (− 3) ≤ f (p) ≤ f (−1) ⇒ 0 ≤ f (p) ≤ 2
We have done.

Comment.
Mathias_DK had found the maximum of | a3 + b3 + c3 − 3abc | when a2 + b2 + c 2 = k .
Denote S = a + b + c .
Then
a3 + b3 + c3 − 3abc = (a + b + c)(a2 + b2 + c2 − ab − bc − ca) = S(k − (ab + bc + ca))
But
S2 − k
(a + b + c)2 = a2 + b2 + c2 + 2(ab + bc + ca) , ab + bc + ca =
2
So
S2 − k −S 3 + 3kS
a3 + b3 + c 3 − 3abc = S(k −)=
2 2
3
−S + 3kS
So we just want to find minimum of . (Actually we will find the minimum of
2
−S 3 + 3kS first, because i hate fractions..)
We first take the case S ≥ 0 .
We note that S is biggest when a, b, c ≥ 0 . Hence we can use AM-GM to obtain
a+b+c a2 + b2 + c 2
≤ .
3 2
And hence S ≤ 3k . And hence S ∈ [0; 3k ] (And it can be anywhere in the interval).

Let's consider the function f (S) = −S3 + 3kS . So f ′(S) = −3S2 + 3k

And f ′(S) = 0 , S = ± k .
So it's easy to see that it has maximum at f ( k ) = 2k k
Now we take the case S ≤ 0 .
Again S ∈ [− 3k ;0] . And it's easy to see that maximum is at either f (0) or f (− 3k ) (But
we don't have to check f (0) since f (0) < f ( k ) ).
But f (− 3k ) = f (0) < f ( k ) . So maximum of −S 3 + 3kS is 2k k and maximum of
−S3 + 3kS
is k k
2
So | a3 + b3 + c3 − 3abc |≤ k k when a2 + b2 + c 2 = k . (Which also works for your special
case)


This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 11
Solution ‫څڅڅ‬

Pro 6 (Iran TST 2009). Suppose that a, b, c be three positive real numbers such that
a + b + c = 3 . Prove that
1 1 1 3
2 2
+ 2 2
+ 2 2
≤
2+a +b 2+b +c 2+c +a 4

Solution 1 (can_hang2007).
a2 + b2 3 (a + b)2 3
Write the inequality as ∑ 2 2
≥ , or ∑ 2
≥ .
a +b +2 2 2( a + b) 2
(a + b)2 + 2
a + b2
Applying the Cauchy Schwarz Inequality, we have
4(a + b + c)2 36
LHS ≥ 2
= .
2 ( a + b ) 2 (a + b)2
∑ (a + b) + 2∑ a2 + b2 ∑ (a + b) + 2∑ a2 + b2
It suffices to prove that
(a + b)2
∑ (a + b) 2
+ 2 ∑ a2 + b2 ≤ 24.
Because
4 1
12 − ∑ (a + b)2 = (a + b + c)2 − ∑ (a + b)2 = − ∑ (a − b)2 ,
3 3
and
(a + b)2 (a − b)2
12 − 2∑ 2 2
= 2∑ 2 ,
a +b a + b2
this inequality is equivalent to
 6 
∑ (a − b)2  a2 + b2 − 1 ≥ 0.
Under the assumption that a ≥ b ≥ c, we see that this inequality is obviously true if
a2 + b2 ≤ 6. Let us consider now the case a2 + b2 ≥ 6, in this case we have
1 1
2 2
≤ , and
a +b +2 8
1 1 1 1 1 1 1 1
2 2
+ 2 2
≤ 2 + 2 ≤ 2
+ 2 ≤ + ,
a +c +2 b +c +2 a +2 b +2 8−b b +2 8 2
9
(because 0 ≤ b2 ≤ )
4
Hence
1 1 1 1 3
∑a 2 2
≤ + + = .
+b +2 8 8 2 4
Our proof is completed.

Solution 2 (hophinhan).
The best inequality of this type is the following
If a, b, c are nonnegative real numbers such that a + b + c = 3 , then
1 1 1 1
2 2
+ 2 2
+ 2 2
≤
8 + 5(a + b ) 8 + 5(b + c ) 8 + 5(c + d ) 6
a
with equality for a = b = c , and again for = b = c or any permutation.
13
WLOG a = max{a, b, c}
1 1 1
f (a, b, c ) = + +
8 + 5(a2 + b2 ) 8 + 5(b2 + c 2 ) 8 + 5(c 2 + a2 )
 b + c b + c  2 1
f a, ,  = +
 2 2  (b + c)2
(b + c )2
8 + 5(a2 + ) 8+5
4 2
Hence

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 12
Solution ‫څڅڅ‬
 b + c b + c 
f a, ,  − f (a, b, c) =
 2 2 
 5 5 
 (16 + 10a2 − 5b2 − 5c 2 − 20bc) 
2  4 2 
= (b − c) .  2
+ 2

 (b + c) 5(b + c) 
[8 + 5(a2 + b2 )][8 + 5(a2 + ][8 + 5(a2 + c 2 )] [8 + ][8 + 5(b2 + c 2 ]
 2 2 
Note that
(b + c)2 5(b + c)2
[8 + 5(a2 + b2 )][8 + 5(a2 + ][8 + 5(a2 + c 2 )] ≥ [8 + ][8 + 5(b2 + c 2 )]2
2 2

Hence
5 
 (16 + 10a2 − 5b2 − 5c 2 − 20bc ) + 5 (8 + 5(b2 + c 2 ) 
 b + c b + c   
f  a, ,  − f (a, b, c) ≥ (b − c )2 .  4 2 
 2 2   (b + c )2

 [8 + 5(a2 + b2 )][8 + 5(a2 + ][8 + 5(a2 + c 2 )] 
 2 
 5 2 2
25(b + c )  
 (32 + 10a2 − 5b2 − 5c 2 − 20bc) +
2  4 2 
≥ (b − c) .  2
 ≥0
 2 2 2 ( b + c ) 2 2 
[8 + 5(a + b )][8 + 5(a + ][8 + 5(a + c )]
 2 
Therefore, we only need to prove the inequality in the case when b = c . Now it's a very
simple.


Pro 7 (Serbia TST 2009). Let x, y, z be positive real numbers such that
xy + yz + zx = x + y + z . Prove the inequality
1 1 1
+ + ≤1
x2 + y + 1 y2 + z + 1 z2 + x + 1
When does the equality hold?

Solution (peine).
by Cauchy-Schwarz,
1 1 + y + z2
(x 2 + y + 1)(1 + y + z 2 ) ≥ ( x + y + z )2 ⇔ ≤
x 2 + y + 1 ( x + y + z )2
then
1 1 1 3 + x + y + z + x2 + y 2 + z 2
+ + ≤
x2 + y + 1 y2 + z + 1 z 2 + x + 1 ( x + y + z )2
therefore it's suffice to prove that,
(x + y + z)2 ≥ 3 + x + y + z + x2 + y2 + z2 ⇔ x + y + z ≥ 3 ,
Wich is true because we have that, 3(x + y + z) = 3(xy + yz + zx) ≤ (x + y + z)2 then
x + y + z ≥ 3.
Equality hold if x = y = z = 1

Pro 8 (USA USAMO 2009). For n ≥ 2 let a1 , a2 ,., an be positive real numbers such that
2
1 1 1  1
(a1 + a2 + ... + an )  + + ... +  ≤ n +  . Prove that
 a1 a2 an   2
max(a1 , a2 ,., an ) ≤ 4min(a1 , a2 ,., an )

Solution (Johan Gunardi).

WLOG assume max(a1,…, an ) = a2 ,min(a1 ,…, an ) = a1 . We prove that a2 ≤ 4a1
By Cauchy Shwarz inequality we have that n numbers

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 13
Solution ‫څڅڅ‬
2
1 1 1  1 1 1 1
(a1 + a2 + ... + an )  + + ... +  = (a1 + a2 ) + a3 + ... + an   +  + + ... + 
 a1 a2 an  
 a1 a2  a3 an 
2
 1   
1  =  a + a  1 + 1  + n − 2
≥  (a1 + a2 )  +  + 1 + ... + 1  ( )   
  a1 a2   
( n−2)numbers  
1 2
 a1 a2  
   
Hence
 
2      
n + 1  ≥  (a + a )  1 + 1  + n − 2 ⇒ (a + a )  1 + 1  ≤ 5 ⇔ 1 a ≤ a ≤ 4a
    
 2 
1 2
 a1 a2  
1 2
 a1 a2  2 4
1 2 1

 
Our proof is completed.


Pro 9 (Serbia Junior Balkan TST 2009). For positive real numbers x, y, z holds
1 1 1 1
+ + = . Prove the inequality
x2 + 1 y 2 + 1 z2 + 1 2
1 1 1 1
+ 3 + 3 ≤
x +2 y +2 z +2 3
3

Solution (VIMF).
1 1 1 1 1 1
From 2 + + = , we have 2 < ⇔ x >1
x + 1 y 2 + 1 z2 + 1 2 x +1 2
We will prove that
1 1 1 2 1 1 1 
+ 3 + 3 ≤  2 + 2 + 2 
x + 2 y + 2 z + 2 3  x + 1 y + 1 z + 1
3

Or prove
1 2 1
⇔ (2 x + 1) ( x − 1) ≥ 0
2
≤ . 2
x +2 3 x +1
3

It right becase x > 1 . We have Q.E.D

Pro 10 (China 2009). Let x, y, z be real numbers greater than or equal to 1. Prove that

∏(x − 2 x + 2) ≤ ( xyz ) − 2 xyz + 2

2 2

Solution (VIMF).
Because of x, y, z be real numbers greater than or equal to 1, so let x = a + 1, y = b + 1,
z = c + 1(a, b, c ≥ 0) , and the inequality become
( x − 1)2 + 1 ( y − 1)2 + 1 ( z − 1)2 + 1 ≤ ( xyz − 1)2 + 1
   
( )( )( )
⇔ a2 + 1 b2 + 1 c 2 + 1 ≤ ( a + 1) ( b + 1) ( c + 1) − 1 + 1
2

⇔ a2 b2c 2 + a2 b2 + b2c 2 + c 2 a2 + a2 + b2 + c 2 ≤ ( abc + ab + bc + ca + a + b + c )

2

This inequality is always true because

( abc + ab + bc + ca + a + b + c ) ≥ a2 b2 c 2 + ( ab + bc + ca ) + ( a + b + c )
2 2 2

≥ a2 b2 c 2 + a2 b2 + b2 c 2 + c 2 a2 + a2 + b2 + c 2
We have Q.E.D


Pro 11 (Mediterranean Mathematics Olympiad 2009). For positive real numbers
x, y, z.
Prove that
xy x
∑ xy + x 2 + y 2 ≤ ∑ 2x + z
Solution (NickNafplio).

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 14
Solution ‫څڅڅ‬
We have
x x2 ( x + y + z )2
∑
cyclic x + 2y
= ∑
cyclic x 2 + 2yx
≥
x 2 + y 2 + z 2 + 2(xy + xz + yz )
=1

Hence
x 1 2x 1 2x + z − z 1  z  3−1
∑
cyclic 2 x + z
= ∑ = ∑
2 cyclic 2 x + z 2 cyclic 2 x + z
= 3 − ∑
2
≤
cyclic 2 x + z  2
=1

Hence
x x x z
∑
cyclic 2 x + z
= ∑
cyclic 2 x + z
+1−1 ≥ ∑
cyclic 2 x + z
+
2z + x
−1

Now we need to prove

x z xz x z xz 1
∑
cyclic 2 x + z
+
2 z +x
−1 ≥ ∑
cyclic x 2 + z 2 + xz
⇔ ∑
cyclic 2 x + z
+
2 z +x
≥ ∑
cyclic
+
x 2 + z 2 + xz 3
x + z + 4 xz
2 2
x + z + 4 xz 2 2
⇔ ∑
cyclic 2( x 2
+ z 2
) + 5 xz
≥ ∑
cyclic 3( x 2 + z 2 + xz )
Which is obvious using AM-GM at the denominators of the three fractions.


Pro 12 (Poland 2009). For positive real numbers a, b, c and n ≥ 1, n ∈ ℕ . Prove that
an +1 b n +1 c n +1  an bn c n  n an + b n + c n
+ + ≥ + + 
b + c c + a a + b b + c c + a a + b 3
Solution (VIMF).
Write the inequality as
an +3 + bn +3 + c n +3 + an +2 b + an +2c + bn +2c + bn +2 a + c n +2 a + c n +2 b + an +1 bc + bn +1ca + c n+1 ab
an +2 + bn +2 + c n +2 + an +1b + an +1c + bn +1c + bn +1 a + c n +1 a + c n +1b + an bc + bn ca + c n ab
an + bn + c n
≥ n
3
We will prove that
an +3 + bn +3 + c n +3 + an +2 b + an+2c + bn+2c + bn+2 a + c n +2 a + c n +2 b + an +1bc + bn+1ca + c n+1ab
an +2 + bn +2 + c n +2 + an+1b + an+1c + bn+1c + bn+1 a + c n +1 a + c n+1b + an bc + bn ca + c n ab
an +1 + bn +1 + c n +1
≥
an + bn + c n
This inequality is equivalent to
an +3 bn + an +3c n + b n +3 c n + bn +3 an + c n +3 an + c n +3 bn
≥ an +2 b n +1 + an +2 c n +1 + bn +2 c n +1 + bn +2 an +1 + c n +2 an +1 + c n +2 bn +1
Or
an b n ( a + b ) ( a − b ) + b n c n ( b + c ) ( b − c ) + c n an ( c + a ) ( c − a ) ≥ 0 (it is true).
2 2 2

It suffices to prove that

an +1 + b n +1 + c n +1 n an + bn + c n
( ) ( )
n n +1
≥ ⇔ 3 an +1 + bn +1 + c n +1 ≥ an + b n + c n
an + bn + c n 3
It is true by Holder Inequality. We have Q.E.D


Pro 13 (Moldova TST 2009). Let m, n ∈ N, n ≥ 2 and positive real numbers
n
ai > 0, i = 1, n , such that ∑a
i =1
i = 1 . Prove that

a12 − m + a2 + … + an −1 a22 − m + a3 + … + an a2 − m + a1 + … + an −2 nm − n
+ +…+ n ≥ n+
1 − a1 1 − a2 1 − an n −1

Solution (VIMF).
We examine cases
- Case 1. If m = 1 , the inequality become

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 15
Solutions ‫څڅڅ‬
a1 + a2 + … + an −1 a2 + a3 + … + an a + a1 + … + an −2 1 − an 1 − a1 1 − an −1
+ +…+ n ≥n⇔ + +…+ ≥n
1 − a1 1 − a2 1 − an 1 − a1 1 − a2 1 − an
It is true by AM − GM Inequality for n numbers

- Case 2. If m = 2 the inequality become

1 + a2 + … + an −1 1 + a3 + … + an 1 + a1 + … + an −2 n2 − n
+ +…+ ≥n+ = 2n
1 − a1 1 − a2 1 − an n −1
This inequality is equivalent to
1 + 1 − a1 − an 1 + 1 − a2 − a1 1 + 1 − an − an −1 1 − an 1 − a1 1 − an −1
+ +… ≥ 2n ⇔ + +…+ ≥n
1 − a1 1 − a2 1 − an 1 − a1 1 − a2 1 − an
It is true by AM − GM Inequality for n numbers

- Case 3. If m ≥ 3 , we have
a12− m + a2 + … + an−1 a22− m + a3 + … + an a2 −m + a1 + … + an−2
+ +…+ n
1 − a1 1 − a2 1 − an
a12 −m + 1 − a1 − an a22 −m + 1 − a2 − a1 a2 −m + 1 − an − an−1
= + +…+ n
1 − a1 1 − a2 1 − an
a12− m − an a22− m − a1 a2 − m − an −1
= n+ + +…+ n
1 − a1 1 − a2 1 − an
1 1 1
WLOG a1 ≥ a2 ≥ … ≥ an ⇒ ≥ ≥…≥ . So by permute inequality we have
1 − a1 1 − a2 1 − an
a1 a2 an an a1 a
+ +…+ ≥ + + … + n −1
1 − a1 1 − a2 1 − an 1 − a1 1 − a2 1 − an
Hence
a12− m − an a22 − m − a1 a 2− m − an −1 a12− m − a1 a22− m − a2 a 2 − m − an n
a 2− m − ai
+ +…+ n ≥ + +…+ n =∑ i
1 − a1 1 − a2 1 − an 1 − a1 1 − a2 1 − an i =1 1 − ai
By Holder Inequality with k ≥ 0 , we have
  
(a k
1 + a2k + … + ank ) 1
+1+
…+ +1+
1 1  1 ≥ ( a1 + a2 + … + an )
…+
k


n  n 
k −1
Hence
k
n
1  n 
∑
i =1
a ≥ k −1  ∑ ai 
k
i
n  i =1 
From this inequality and Cauchy-Schwarz Inequality we have
 1  1  1 1 
2− m
ai  m −1 − 1 n ai  − 1 m − 2 + m −3 + ... + 1 n
n
a − ai n
a  ai  ai ai n
=∑  i = = 1 1
∑
i =1
i

1 − ai i =1 1 − ai
∑
i =1 1 − ai
∑
i =1 ai
m− 2
+ ∑
i =1 ai
m −3
+ ... + n
m−2 m −3
   
1  n2  1  n2 
m−2 m −3
1  n 1 1  n 1
≥ ∑ 
m −3
+ ∑ 
m−4
+ ... + n ≥ m −3  n  + m−4  n  + ... + n = n m −1 + n m − 2 + ... + n1
n  i =1 ai  n  i =1 ai  n   n  
 ∑ ai   ∑ ai 
 i =1   i =1 
Setting A = n m −1 + n m − 2 + ... + n1 , hence nA = n m + n m −1 + ... + n 2 , hence
nm − n
(n − 1) A = n m − n ⇒ A =
n −1
1
We have done. Equality hold if a1 = a2 = … = an = .
n

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 16
Solutions ‫څڅڅ‬
Pro 14 (Costa Rica Final Round 2009). Let x and y positive real numbers such that
(1 + x ) (1 + y ) = 2 . Show that
1
xy + ≥6
xy
Solution (trungdeptrai).
Since (1 + x ) (1 + y ) = 1 ⇔ x + y = 1 − xy(1)
Since ( x + y ) ≥ 4 xy
2

(1),(2) we have
1
(1 − xy )
2
≥ 4 xy ⇔ x 2 y 2 + 1 ≥ 6 xy ⇔ xy + ≥6
xy
So we have Q.E.D


Pro 15 (Russia All-Russian Olympiad 2009). Prove that for all 1 < a ≤ b ≤ c we have
loga b + logb c + logc a ≤ logb a + logc b + loga c
Solution (VIMF).
Setting x = log a, y = log b, z = log c . Because 1 < a ≤ b ≤ c so x ≥ y ≥ z > 0 . The inequality
become
x y z y z x
+ + ≥ + + ⇔ ( x − y ) ( y − z ) ( x − z) ≥ 0
y z x x y z
It is true because x ≥ y ≥ z > 0
We have Q.E.D


Pro 16 (Croatia TST 2009). Prove for all positive reals a, b, c, d
a−b b−c c −d d −a
+ + + ≥0
b+c c +d d +a a+b
Solution (VIMF).
Write the inequality as
a+c b+d c +a d +b
+ + + ≥4
b+c c +d d +a a+b
By Cauchy-Schwarz Inequality we have
a+c b+d c +a d +b  1 1   1 1 
+ + + = (a + c)  +  + (b + d)  + 
b+c c +d d +a a+b b + c d + a c + d a + b
4(a + c) 4(b + d )
≥ + =4
a+b+c +d a+b+c +d
We have Q.E.D


Pro 17 (Vietnam TST 2009). Let a, b, c be positive numbers. Find k such that
3
 a  b  c   1
k + b + c  k + c + a  k + a + b  ≥ k + 2 
     
Solution.
Let a = b = 1 , the inequality become

k +
2
1  
k +
c 
≥ k +
1
3

⇔
( c − 1)
2
( 4k c + 4k
2 2
) ≥0
+ 2k − 1
     
1+c  8 ( c + 1)
2
 2  2

Let c → 0 , we have the inequality only true when k + 2k − 1 ≥ 0 . We will prove that all
2

roots of this inequation is assemble all value of ݇ satisfy problem

2a 2b 2c
Setting x = ,y = ,z = so xy + yz + zx + xyz = 4 anh the inequality
b+c c+a a+b
become

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 17
Solutions ‫څڅڅ‬
(2k + x ) (2k + y ) (2k + z ) ≥ (2k + 1)
3

By AM-GM Inequality and Schur Inequality, we have xyz ≤ 1 , x + y + z ≥ xy + yz + zx

Hence
(2k + x ) (2k + y ) (2k + z ) = 8k 3 + 4k 2 ( x + y + z ) + 2k ( xy + yz + zx ) + xyz
≥ 8k 3 + 4k 2 ( xy + yz + Zx ) + 2k ( xy + yz + zx ) + xyz = 8k 3 + 4k 2 + 2k ( ) ( 4 − xyz ) + xyz
( )
≥ 8k 3 + 16k 2 + 8k − 4k 2 + 2k − 1 = (2k + 1)
3

We have Q.E.D


1 
Pro 18 (Moldova TST 2009). Let x, y, z be real number in the interval  ;2 and
2 
a, b, c a permutation of them. Prove the inequality
60a2 − 1 60b2 − 1 60c 2 − 1
+ + ≥ 12
4 xy + 5z 4yz + 5x 4 zx + 5y
Solution (trungdeptrai).
1 
Because x, y, z be real number in the interval  ;2 ,so we have:
2 
 1 1
 x − 2  ( y − 2 ) ≤ 0 ⇔ −2 x − 2 y + xy + 1 ≤ 0
 

( x − 2 )  y − 2  ≤ 0 ⇔ − 2 x − 2y + xy + 1 ≤ 0
1 1
 
So
5
−
2
( x + y ) + 2xy + 2 ≤ 0 ⇔ 4xy ≤ 5 ( x + y ) − 4 ⇔ 4xy + 5z ≤ 5 ( x + y + z ) − 4
write similar inequality
Hence,it is sufficient to prove that
6a2 − 1 6b2 − 1 6c 2 − 1
+ + ≥ 12
5(x + y + z) − 4 5(x + y + z) − 4 5(x + y + z) − 4

( ) ( )
⇔ 6 a2 + b2 + c 2 − 3 ≥ 60 ( x + y + z ) − 48 ⇔ 4 a2 + b2 + c 2 − 4 ( x + y + z ) + 3 ≥ 0

⇔ (2 x − 1) + (2y − 1) + (2 z − 1) ≥ 0
2 2 2

We are done


Pro 19 (Germany TST 2009). Let be positive real numbers such that abcd = 1 and
a b c d
a + b + c + d > + + + . Prove that
b c d a
b c d a
a+b+c +d < + + +
a b c d
Solution (trungdeptrai).
By Cauchy-Schwarz,we have
2
 a b c d   d a b c   ad ab bc cd 
 = ( ab + bc + cd + da) (1)
2
 b + c + d + a   c + d + a + b  ≥  bc + cd
+
da
+
ab 
   
But
( a + b + c + d ) ⇒ ab + bc + cd + da > a + b + c + d(2)
2
a b c d
a+b+c +d > + + + ≥
b c d a ab + bc + cd + da
a b c d
Since (1) , (2 ) and a + b + c + d > + + +
b c d a
So we have Q.E.D

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 18
Solutions ‫څڅڅ‬

Pro 20 (Middle European Mathematical Olympiad 2009). Let x, y , z be real

numbers satisfying x + y + z + 9 = 4( x + y + z ) . Prove that
2 2 2

x 4 + y 4 + z 4 + 16( x 2 + y 2 + z 2 ) ≥ 8( x 3 + y 3 + z 3 ) + 27
Solution (VIMF).
By Cauchy-Schwarz Inequality we have
( ) + (y ) + (z )
2 2 2
x 4 + y 4 + z 4 + 16(x 2 + y 2 + z 2 ) − 8( x 3 + y 3 + z 3 ) − 27 = x 2 − 4 x 2
− 4y 2
− 4z − 27
1 2
( ) 1
2
≥ x + y 2 + z 2 − 4(x + y + z ) − 27 = .(−9)2 − 27 = 0
3 3
So we have Q.E.D


Pro 21 (Hungary-Israel Binational 2009). Let x, y, z be non negative numbers. Prove
that
x 2 + y 2 + z 2 + xy + yz + zx x + y + z x2 + y 2 + z2
≤ .
6 3 3
Solution.
Let x 2 + y 2 + z 2 = a, xy + yz + zx = b ⇒ a ≥ b

Q.E.D ⇔
a+b
≤ a + 2b
b a + b
⇔
2

≤
( a + 2b ) b

2 3  2  3
( ) ( )
⇔ 3 a2 + 2ab + b2 ≤ 4 a2 + 2ab ⇔ ( a − b ) ( a + 3b ) ≥ 0 (it is true beacause a ≥ b )
So we have Q.E.D


Pro 22 (Kyrgyzstan TST 2009). Does a2 + b2 + c 2 ≤ 2(ab + bc + ca) hold for every
a, b, c if it is known that a4 + b4 + c 4 ≤ 2(a2 b2 + b2 c 2 + c 2 a2 )
Solution (VIMF).
We have
a4 + b4 + c 4 ≤ 2(a2 b2 + b2 c 2 + c 2 a2 ) ⇔ (a + b + c )(a + b − c)(b + c − a)(c + a − b) ≥ 0
WLOG a ≥ b ≥ c so a + b − c ≥ 0, c + a − b ≥ 0 , hence b + c − a ≥ 0
So
c(a + b − c) + a(b + c − a) + b(c + a − b) ≥ 0 ⇔ a2 + b2 + c 2 ≤ 2(ab + bc + ca)
We have Q.E.D


Pro 23 (Indonesia National Science Olympiad 2009). Let x1 , x2 ,..., xn be real
numbers greater than 1. Show that
x1 x2 x2 x3 x x
+ + ... + n 1 ≥ 4n
x3 x4 x2
Solution (Altheman).
Let y i = xi − 1 for i = 1, 2,., n . Then the inequality is
y i y i +1 + y i + y i +1 + 1 y i y i +1 1 y y
∑ y i +2
= ∑ y i +2
+
y i +2
+ ∑ i + i +1
y i +2 y i + 2
Using the AM-GM twice,
y i y i +1 1 y y yy yy
∑ + + ∑ i + i +1 ≥ 2∑ 2 i 2 i +1 ≥ 4n n ∏ i 2 i +1 = 4n
y i +2 y i +2 y i +2 y i +2 y i +2 y i +2
(by the AM-GM on each sum).
An example of equality is when y i = 1 or xi = 2, i = 1, n .

This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 19
Solutions ‫څڅڅ‬
We have Q.E.D


Pro 24 (Kyrgyzstan TST 2009). For any positive a1 , a2 ,..., an prove that
a1 a2 an n
+ + ... + >
a2 + a3 a3 + a4 a1 + a2 4
Solution (arqady).
Let an +1 = a1 and an +2 = a2. Then
 1 1   1 1 
n
ai  ai + 2 ai +1 2 ai +1 + ai +2  n  ai + 2 ai +1 2 ai + ai +1 
∑
i =1 ai +1 + ai + 2
= ∑ 
cyc  ai +1 + ai + 2
+
ai +1 + ai +2
− 1 = ∑ 
i =1  ai +1 + ai + 2
+ −n
ai + ai +1 
   
   
1 1
n (ai + ai +1 )( ai + ai +1 ) n 1 ai ai +1  ai + ai +1
≥ 2∑ 2 2 − n = 2∑  +  −n
i =1 (ai +1 + ai +2 )(ai + ai +1 ) i =1  2 4(ai + ai +1 )
2
 ai +1 + ai + 2
n
ai + ai +1 n
> 2∑ − n ≥ 2n − n = ( 2 − 1)n > .
i =1 ai +1 + ai +2 4
We have Q.E.D


Pro 25 (Spain Mathematical Olympiad 2009). Let a, b, c real positive numbers with
abc = 1 .Prove that
2 2 2
 a   b   c  3
 1 + ab  +  1 + bc  +  1 + ca  ≥ 4
     
Solution (VIMF).
y z x
Setting a = , b = , c = . The inequality become
x y z
2 2 2
 x   y   z  3
  +  +  ≥
y + z z + x x +y 4
It iss true by Cauchy-Schwwarz Inequality and Nesbit Inequality
2 2 2 2 2
 x   y   z  1 x y z  1 3 3
  +  +  ≥  + +  ≥ .  =
 y + z   z + x   x + y  3  y + z z + x x + y  3  2  4
We have Q.E.D

‫څڅڅڅڅ‬
This file was downloaded from the VietNam Inequality Mathematic Resource Page http:/ddbdt.tk
Page 20