Chapter

Basic Techniques for

_
Proving lnequal ities __~~_, .

Among quantities observed in real life, equal relationship is local and

relative while unequal relationship is universal and absolute. The exact
nature of inequality is the studying of unequal relationship among
quantities.
Now, for two quantities we can always compare them, or try to
show one of them is greater than the other: in other words, we need
to prove an inequality. The techniques for proving an inequality varies
from case to case and often require some basic inequalities such as the
famous AM-GM Inequality and the Cauchy-Schwarz Inequality; other
techniques even involve some more advanced algebraic rearrangements. In
this chapter, we introduce some of the most basic techniques for
proving inequalities.

1. 1 Direct Comparison
Naturally, we have two ways to compare two quantities:
(1) Compare by subtraction: to show A ~ B, it suffices to show
A -B ~0;
(2) Compare by division: say B > 0, to show A ~ B, it suffices to
A

show B ~ 1.
When we use the above two methods to compare two quantities,
usually some forms of rearrangements is required. For example,
factorization, separating and combining terms are some of the most
used tricks.

Methods and Techniques for Proving Inequalities

Eg. 1

Let a, b, c be positive real numbers, prove that

2

a +be +b +ca +c +ab >- +b

b+c
c+a
a+b ~a

Proof.

c.

The LHS-RHS is

a +be -a +b +ca-b +c +ab-c

b+c
c+a
a+b
2
2
= a +be -ab -ac +b +ca -be -ba +c2 +ab -ca -cb
b +c
c +a
a +b
=(a -b)(a -c)+ (b -c)(b -a)+ (c -a)(c -b)

b +c
(a2 -b2)(a2 -c2)

c +a

a +b
+ (b2 -c2)(b2 -a2) + (c2 -a2)(c2 -b2)
(b +c)(c +a)(a +b)
a4 + b4 + c4 - a2b2 - b2c2 - c2a2
(b +c)(c +a)(a +b)
(a2 -b2)2 +(b2 -c2)2 +(c2 -a2)2
~o.
2(b +c)(c +a)(a +b)

therefore the original inequality holds.

Eg. 2 For real numbers x , y 1 z that satisfies xy
show that:

+ yz + zx

= - 1~

Proof. Because
x 2 +5y 2 +8z 2 -4
= x 2 +5y 2 +8z 2 +4(xy + yz +zx)
= (x +2y +2z) 2 +(y -2z) 2 ~0.

Wehavex 2 +5y 2 +8z 2 ~4.

Eg. 3 Let a 1 b 1 c be positive real numbers. Prove that for any
real numbers x, y, z, we have:

,)

~2

ab c
( {a+b
{b+C
{C+a )
(a +b)(b +c)(c +a) 'V~-c-xy +'\j----;--a-yz +'\j---,;--b-zx

When does the equality hold?

&sic Techniques for Proving Inequalities

Hint It is well known that

we will use similar method to prove the above problem.

Proof. UIS-RHS =
2
c
[ ~y

lb !cx2 + c

~ay2 -

2J (b

+c~c +a) xy

2
/
+ ~z
b
be
] + [ c
2 +
a
2
- 2 'V (c +a)(a +b)yz
b +ex
a +bz -

Jcb+c)Ca+b)xzl

~ablJac:+c)

./bC:+a)r

~0

(here .2:; represents a cyclic sum).

Hence the original inequality holds.
Let a, b, c be positive real numbers. Show that:

Eg. 4

Proof. Since this inequality is symmetry in a , b, c, WLOO we can

assumea ~b ~c, thus:

Hence

Note. From this problem we obtain:

Generally, ifx, E R+, i

1, 2, , n, we have:

the proof is similar to what we have done previously.

Eg. 5 Let a, b, c be positive real numbers such that a 2 +b 2
1. Find the minimum for

+c 2

Methods and Techniques for Proving Inequalities

Hinl When a = b = e, S = 3. So we guess S

In fact,
S

-3

> 3.

_1 +_1 +_1-3 _2(a3 +b3 +e3)

~e

=az +bz +ez +az +bz +cz +az +bz +cz -3-2(a2 +b2 +c2)
a2
b2
e2
be ea ~

= a2 (_12 +_l)+b2
(_12
b
c2
a
=

az (

be

ca

+_1)+
e2 (_12 + _1)
2
2 _ 2 (a + b + c
c

i - ! f + bz ( ! - ~ f +

cz (

i f > 0.

Therefore, the minimum for S is 3.

Note. Don't be afraid to guess the right answer (which is quite
effective in handling extremum problems)! Beside guessing the right
answer, we should also guess when the equality holds and keep that in
mind when we later try to prove the inequality.

1. 2

Method of Magnifying and Reducing

If we get stuck proving an inequality like A :< B directly, we can try to

find a quantity C that acts like a bridge: i.e. if we have both A :< C
and C :< B, then A :< B naturally follows. In other words, we can

magnify from A to C , and magnify again from C to B (the same idea

applies to reduction). The trick here is to find a suitable level of
magnification or reduction.
Eg. 6 Assume n is a positive integer and au azo ... , an are
positive real numbers.
Show that
" 1
~ -

1
+ ------=---~
2
at
(at +a2 + +a,)

i= l

> (n

n +1 2
+2011)

i: a_1 + a
i=t

201 :..
].
+a 2 +
+a,

&sic Techniques for Proving Inequalities

Proof. From Cauchy's Inequality,

Hence

It suffices to show that

which is equivalent to
n (n 2

~ (n

+ 2011) (_!_
+ _1_ + + a,.
_1_ +
a1 az
n(at
+ 1) [_!_ +_!_ + + _!_ +
at

a2

a,.

1
+az

+ +a,) )

2011
] ,
at +a2 ++a,.

which is equivalent to

~ (n 3 + 1) ~
;~1

_!_
a,

+ (2011n 3 + 2011)

+
'"'

LJa;
i=t

which is equivalent to
" 1
(2011n - 1) ~ - ~ (2011n - 1)n 2
;~1 a;

-,.-,

'"'

LJa;
;~t

Methods and Techniques for Proving Inequalities

"

i=1

i=1

a;

~a;~- ~n ,

or

so the conclusion holds.

Eg. 7 Prove that for all positive real numbers a, b, c, we have:

Proof. Sincea 3 +b3 =(a +b) (a 2 +b 2 -ab) ~(a +b)ab, we have:

1
~
1
a 3 +b 3 +abc """"ab(a +b) +abc

abc(a +b +c)"

Similarly,
1

b3 +c3 +abc ""'abc(a +b +c)'

1
~
b
c 3 +a 3 +abc ""'abc(a +b +c)"

Adding the above three inequalities together, we obtain:

Note. When we prove inequality with fractional parts, we seldom

change the fractions to a common denominator. Instead, we can
simplify the fractions by means of magnifying or reduction.
Eg. 8

Assume that a;

~ 1(i

= 1, 2, , n). Prove that:

Hint. Observing the two sides of the above inequality, how can

we manage to get 2" out from the LHS?

Proof.

C1 +a1)(1 + a z )C1 +an)

=

2,. (1+ a1; 1) (1+ az; 1) ... (1+a,.; 1).

&sic Techniques for Proving Inequalities

Since a;

0, we have:

(1 +a1)(1 +az)(1 +a,.)

~ 2,. ( 1 + a1 ; 1

+ a2; 1 + ... +a,.; 1)

~ 2,. ( 1 + a1 -1
n+1

+ a2

= n

2"

+ 1 (1 +a1

-1
n+1

+ ... +a,.

-1)
n+1

+a2 + ... +a,.).

Thus the original inequality holds.

Eg. 9

Find the maximum real number a , such that

./xz

+ zz

./xz

+ yz

./yz +z2

>a holds for all real numbers x, y, z .

Soln 1. Let x = y, z-0, we find LHS -2. As a result, a >2 will

lead to a contradiction. Hence a ~ 2.

WLOG, we assume x ~ y ~ z, let us prove that

Move

./zz

+ xz

Jxz

+yz

to the RHS, the above inequality is

equivalent to

or

Omitting x from both sides. Since J x 2 + y 2

z

> 2z , we only need to show

+ y > 2y ,

J x 2 + z2 +

Methods and Techniques for Proving Inequalities

----;-=:::;:.x:::::::::;:- increases when x

Jxz +zz

increases. Similarly,

lx2

+ Y2

increases when x increases. Judging by

these two facts, we only need to consider the case when x

Let x = y , we need to prove

y.

The above inequality is equivalent to

or

which is obvious.
Therefore,

SoalliiiX = 2.
Note. We can also use undetermined coefficients to solve this problem.
Soln 2. Again, we show that

Assume

&sic Techniques for Proving Inequalities

where a is an undetermined coefficient.

Note that (J) is equivalent to (xa +ya +z.. ) 2 ~4x2a-2 (y 2 +z 2 ).
Since (x .. + y .. + z .. ) 2 ~ 4x"' (y"' + z"') , we only need to guarantee

It's easy to see that a = 2 fits the bill. Thus,

Hence, a"'"" = 2.
Eg. 10 Assume non-negative real numbers a1 ,
b2, ... , b,. both satisfy the following conditions:
(1)

"
:L:Ca; +b;)

a2, ... , a,.

1;

i=1

(2)

"
:L:i(a;

-b;)

0;

i=1
n

(3)

2::: i

(a;

+ b;)

10.

i=1

Show that for any 1

Proof. For any 1

~ (10

~ k ~ n, max{ak, bk} ~

~ 10 ~ p.

n, we have

-k 2ak) (1 -ak)

= 10 - (10

hence a1

+k 2 )ak +Pai,

Similarly b1

~ 10 ~ k 2 ,

thus

10
10

+ k2'

and b1 ,

10

Methods and Techniques for Proving Inequalities

Eg. 11

Positive real numbers x, y, z satisfy xyz

> 1 , show that

(2015 IMO)

Proof. The original inequality is equivalent to

From Cauchy Inequality and the given condition that xyz

> 1 , we

have

x2
xs

or

+ Y2 + z2 yz + Y2 + z2
+ y2 + z2 ~ x2 + y2 + z2

Similarly,

Adding these three inequalities together and use the fact that x 2
y2

+z2

> xy + yz + zx, we have

Comment. Contestant Boreico Iurie from Moldova has won the

special price for his solution outlined below.

Since
x2 (x3 -1)2 (y2 + z 2)
x3(xs + Y2 +z2)(x2 +y2 +z2)

As a result,

>O.

11

&sic Techniques for Proving Inequalities

xz

+ :z + zz ~ ( x

2
~ X 2 + y\ + Z 2 ~(x
eye

-yz)(sincexyz

~1)

~0.

1. 3

Analyzing the inequality

To analyze an inequality t we first assume that it holds and deduce

from it a series of equivalent inequalities (i.e. we require that each
step is reversible) until we reach an inequality that is easier or more
obvious to prove than the original. Such method is usually quite helpful
in gathering proving thoughts.
Eg. 12 If x , y E R, y ~ 0, andy (y + 1) ~ (x + 1) 2. Prove that
y(y -1)

Proof. If 0

Now t if y

> 1, from

y ~ 1 t then y (y -1) ~ 0 ~ x 2

the assumptions we have

+1)

y(y

To prove y

(y -

Jcx

~x 2

1)

(x

~x

+1)2 +

(x

+1)2,

+ 1) 2 + ~ - ~ .
it suffices to show that

~ - ~ ~Jxz +~ + f,

~ (x + 1) 2 + ~ ~ x 2 + ~ + 2Jx 2 + ~ + 1
~ 2x ~ 2Jx +
2

!.

The final inequality is obvious, hence the original inequality

holds.
Eg. 13 Assume a , b , c E R+. Show that
a +b +c -3~ ~a +b -2../(ib.

Methods and Techniques for Proving Inequalities

12

Proof. Note that

a +b +c -3~ ~a +b -2.;;;Ji

Because
c

+ 2 .;;;Ji

= c

+ .;;;Ji + .;;;Ji ~ 3:;c ,;;ib ,;;ib

3 ~.

Therefore,
a +b +c -3~ ~a +b -2.;;;Ji.
Note. To prove an inequality, sometimes we need to alter between

the analyzing method and the comprehensive method. For Eg. 13, we
see from the analyzing method that c + 2 .;;;Ji ~ 3 ~ (should be
true). If we insist on continuing with the analyzing method, we might
produce more complications. On the other hand, the comprehensive
method leads us the solution.
Eg. 14

Assume n E N+. Prove that

+_l + +-1-)~1_(_1_ +_l + .. +...1.).

_1_(1
n +1

2n - 1

Proof. To prove

n(1 +1_
3

<D,

2n

it suffices to show

1
+ +- ) ~ (n +t)(_l +_l + +__!_).
2n -1
2
4
2n

The left hand side of is

(1

1 )

n
n
-+-+n
-++--.
2
2
3
2n -1

The right hand side of is

n(1_ +1_
2
4

= I!:..
2

+ .. +__!_)+ (_l +1_ + .. +__!_)

2n

2n

+ n (1_ + ... + __!_) + (1_ + 1_ + ... + __!_).

4

2n

2n

<D

&sic Techniques for Proving Inequalities

13

Compare and @, if
n

~ 2 + 4 + + 2n'

and
1 +oo + 1-31 +5
2n - 1

1
::>-:-

,_ 4

1
+oo +2n

are both true (which is quite obvious) , then holds.

In conclusion, the original inequality CD is true.
Eg. 15 Let a , b, c be positive real numbers such that abc
Prove that

1.

(a +b)(b +c)(c +a) ~ 4(a +b +c -1).

Hint The idea is to treat a as a parameter and regard the

inequality as a quadratic equation, then we can use the discriminant of

the quadratic equation to prove the inequality.
Proof. WLOG, assume a ~1. The original inequality is equivalent
to

that is ,
(a 2 -1)(b +c) +b 2 (c +a) +c 2 (a +b) +6 ~4a +3(b +c).

Since (a+ 1) (b +c) ~ 2.[a 2 ../bC

4(a -1) +b2 (c +a) +c 2 (a +b) +6

4, if we can show
~4a

+3(b +c),

then CD holds.
Now, is equivalent to
2 +a(b 2 +c 2 ) +bc(b +c) -3(b +c) ~0,

so we only need to show that

~

Define f(x)

(b +c) 2
=

+(be -3)(b

~ x 2 +(be- 3)x

+ c) +2

~0.

+ 2, then its discriminant

14

Methods and Techniques for Proving Inequalities

6. =(be -3) 2 -4a.

It suffices to show 6.

(~

0, which is equivalent to

-3f

~o.

-4a

or

or
(a -1) 2 (4a -1)

? 0.

Since a ? 1, the above inequality is obviously true, hence Q)

follows. From the above discussion, we see that the equality holds
when a = b = c = 1.

1. 4

Method of Undetermined Coefficients

Many times, we can also introduce undetermined coefficients and solve

for these coefficients to prove the inequality.
Eg. 16 Assume x , y , z are real numbers that are not all 0. Find
.

the maxrmum value for

xy +2yz
+ y 2 + Z2

X2

.
To f"m d t he maxrmum
.
f or
Hml

xy
+ + 2+yz

y2

2 ,

we on1y need to

show that there exists a constant c , such that

xy +2yz

CD

X 2+2+2"""c'
y
Z

and that the equal sign holds for some x, y, z.

CD can be translated to x 2 + y 2 + z 2 ?

__!_ (xy
c

+ 2yz). Since the

right hand side has terms xy and 2yz, we split the term y 2 in the left
hand side intoay 2 and (1 -a)y 2 Since,

15

&sic Techniques for Proving Inequalities

We want

2ra

2, which givesa

~.

Soln. Since,

We obtain

or

The equality holds when x = 1 , y =

./5,

z =

2, hence the maximwn

can be reached.

~ x ~ 1 , find the maximum value of

Eg. 17 For ;

Soln. Let us consider the maximum value of [a (1

X) J[ r (2x -1) ] ' where a ' /3'
4y = 0, aC1 +x) =pO-x)
2

+ x) ] 5 [BO

r are positive integers satisfying Sa - /3 +

=

y(2x -1). This implies

_Ji.L
2y +fi'

f3 +a Plugging in f3

Sa

+ 4y, we have

0 = 2(3ay +Sa 2 -2y 2 ) = 2(Sa -2y)(a +y),

Let (a, p, y )

(2, 30, S), from AM-GM Inequality, we obtain

Methods and Techniques for Proving Inequalities

16

[2(1 +x)] 5 [30(1-x)][5(2x -1)] 2

~(~f.

The equality is achieved when x = ~. As a result, the maximum

value for (1 +x) 5 (1-x)(1-2x) 2

ss

y.

is~.

Eg. 18

COstrowski) Assume two sets of real numbers a 1 , a2 , ,

a,. and b 1 , b 2 , , b,. are not scaled version of each other. Real
numbers x 1 , x2 , , x,. satisfy:
a1x1 +a2x2
b1x1 +b2x2

+ +a,.x,. = 0,
+ +b,.x,. = 1.

Prove that

xf

+X~

+ "' +X~

_______,_i---'-1- - - - -

~af ~bt- (~a;b;) 2

i-1

"

i-1

i- 1

i-1

+ aa;

i-1

"
+ ,B(~b;x;
-1),

i- 1

.B are undetermined coefficients.

~xr = ~ (x;

i-1

"
"
~xt +a ~a;x;

Proof 1. Assume ~xr

where a,

i-1

+fib; )
2

2
_

i-1

Thus,

~ Caa; +,Bb;)

2
_

.B

i-1

For the above inequality, the equal sign holds if and only if
x;

=-

aa +,Bb
'
' (i
2

Substitute CD back into ~ a;x;

i-1

1, 2, ... , n).
"

0 and ~ b;x;

1, we have

&sic Techniques for Proving Inequalities

n

Here, A =~at, B

i=t

17

~bt, C

i=t

~a,b,. Therefore,
i=t

2C
a= AB -C 2 ' {1

2A

= - AB

-c

Hence

Note 1. There are two more ways to prove the inequality, for
reference, we will mention them as follows:
Proof 2. From the Cauchy-Schwarz Inequality, for every t E R,
we have

[_t (a;t +b;) J.

2

(xr

+x~

+ .

+x~) ~ [

t=l

(a;t +b;)x,

t=l

= 1.

Or
(xi

+ x~ + + x: )(At2 + 2Ct +B) -

1 ~0

always holds true.

From tl. ~ 0 (tl. is the discriminant with respect tot ) , we obtain

Proof 3. (a combination of the previous two proofs) According to

the conditions, for any). E R, we have

"

~ (b; - ).a 1 )x 1

1.

i=t

By Cauchy-Schwarz Inequality,

"

"

i=t

i=t

~xt ~ (b, n

Hence,

).a 1 )

[~" (b, i=1

~x, ~ B + ). 2 A -2).C
-1

Recall that our goal is to prove

).a 1 )x 1

]2

1.

Methods and Techniques for Proving Inequalities

18

"
~
i=t

1
xr ~ _B __

____::.--,c""'2:-.

A
So we only require that

or

A2 A 2
Picking A =

2ii.AC + C 2

~ 0.

~ satisfies the above requirement.

Note 2. From this problem one can show the Fan-Todd Theorem:

Let a.~o, b.~o (k = 1, 2, ... , n) be two sets of real numbers not scaled of
each other. Also assume that a ;b k =I= a kb; (i "=I= k) , then

To prove the Fan-Todd Theorem, it suffices to set x.~o

~

~k

ar

b ar
k -

a.~o

b , We ask the reader tO Check that

Xt,

=
X2,

(~ )-1
"',

X,.

satisfies the conditions.

Eg.19 Find the maximum m,. for the function

Express m, using m..--1 and find limm, .

..-oo
Hint. Every denominator inf, is rather complicated. To proceed,
we should first simplify the denominators using substitutions.
Soln. Let

a; =

+ Xi _; + Xn ,

~ i ~ n.

Define a,.f-1

= 1.

&sic Techniques for Proving Inequalities

19

Thus,
1 +x, +x,+t

+ +x,.

1 +x;+t +x;+2

+ ... +x,.

1
a;

Also,
1

Hence
X

a;

a;+t

.=---

Substituting x, 's, we have

Th find the maximwn for f,. , we construct the following inequalities:

2

1
+ J.ta2 ~ 2A1 a 1,
a2

a~
2
-a3
+ ,ha3

V..2a2,

~n +A~ ~ 2\,.a,.

Here At, A2, , A,. are parameters, A;

Adding CD, if we let
2).1

0.

= 1,

~~--~-1 +J.t'

1
v.. ..

= 1 + A;-1'

then immediately j,. < ;.:.

Note that;., ~ A;-1, andO <A;

< 1.

Therefore, lim;.,. exists. It's

,.-oo

20

Methods and Techniques for Proving Inequalities

easy to see that the limit is 1.

1. 5

Normalization

When the inequality has same order in its terms, we can assume that
the variables add up to a constant k. In doing so, we simplify the
inequality and at the same time enhance the known conditions, both of
which help us to solve the problem.
Eg. 20 Assume a , b, c are positive real numbers, prove that

Proof. Since each term on the left hand side is of the same order,
WLOG we assume a + b + c = 3. It suffices to show
(a +3) 2
(b +3) 2
(c +3) 2
~
8
2
2
2
2
2a + (3 -a) + 2b + (3 -b) + 2c + (3 -c) 2 """"
2

Define
+3)2
/( X ) = 2x2(x
+ (3 - X )2 '

a+.

Then
x 2 +6x +9
/( x ) = 3(x
2 - 2x +3)
=

1( 1 + x 8x+6)
1(
8x+6)
2x + 3
3 1 + (x -1) + 2

~~

2 -

(1 +

8x 6) j (4x + 4).
=

So
j(a) +/(b)+ /(c)~
Eg. 21

Assume a + b + c
real number root. Prove that

j (4a +4 +4b +4 +4c +4) = 8.

> 0,

and ax 2 + bx + c

0 has positive

21

&sic Techniques for Proving Inequalities

4min{a, b, c} <a +b +c

Proof. WLOG assume a

b, c by

a+~ +c,

+b +c

a+: +c,

<:

max{a, b, c}.

1 , otherwise we can replace a ,

a+~ +c

respectively. First, let us

prove the statement

4
>9

max{a, b, c}
(1) If b

4
> 9,
then the statement already holds true.

(2) If b

<

But a

+c

1- b

> 4ac, we have ac < 8~.

> ~ , so if a < 0 or c <

0, we will have c

> ~

> ~ , the statement is thus true.

or a

If a , c
If c

! ,since b

> 0, then ( 95 -

< ~ , then a >

c) c

< ac < 814 .

Hence, c

< 91

or c

4
> 9.

! ,the statement is true.

Next we prove the statement

min{a, b, c}

"<

(2) If a

> 41 , then b 2 > 4ac > c ,

+c <

!.

! ,the statement is already true.

(1) If a

assume c
b

<

+c

1- a

< 43 .

> 0 (otherwise the statement is obviously true).

! ,or (rc + ! )(rc - ~ )< 0. So

<

WWG

Sorc + c >

! ,the statement is

true.
Note. The bound we present is the best: quadratic equation

~x +

0 demonstrates that :

!x

cannot be any smaller, while

22

Methods and Techniques for Proving Inequalities

equation

!x

+ ; x +

! shows that 4 cannot be any larger.

Exercise 1

1. Let x

(x2 +

z be real numbers. Prove that

+ z2)[(x2 + y2 + z2)2 _ (xy + yz + zx)2]

(x + y +z) 2[(x 2 + y 2 +z 2) - (xy + yz +zx)] 2

2. Let m

y2

> n t prove that

n be positive integers and m

3. Assume a , b , n are positive integers bigger than 1. A ..-t and A ,.

area-ary, B,.-1 andB,. are b-ary. A..--1, A,., B..--1, B,. are defined as:
A,. = x,.x,....-1"'Xo t A...--1 = x..-1Xn-2'"Xo (written in a-ary form)
B,.

x,.X,.-t .. 'Xo, B ..-t

x ..-tx ..-2 .. 'Xo(written in b-ary form)

where x,. =I= 0, x..--1 =I= 0. Prove that when a

A,.-1
A,

> b, we have

< B..--1

B,. .

4. Let a, b, c be positive real numbers, prove that

8
b8 + c 8
-a1 + -b1 +-c1 ~ a a+3b3
c3

5. Assume real numbers a 1 t a 2 ,

a 100 satisfy:

(1) a1 ~a2 ~ ... ~a10o ~ 0;

(2)

a1

+a2 ~ 100;

(3) a3 +a4 + ... +atoo

-< 100.

Find the maximum forar +a~+ +aroo.

6. Assume 5n real numbers r; , s; , t; , u; , v; are all bigger than 1

(1 ~t ~n). DenoteR

1
n

=-

"
~ru S
1=1

1
n

=-

~su T
=t

1
n

=-

"
~tu
i =t

23

&sic Techniques for Proving Inequalities

U = _!_
n

~ u; ,

V = _!_
n

i=t

ir

~ v;.

Prove the following inequality:

i=1

T;S;t;U;V;

i=1 T;S;t;U;V;

~ 1 ;? (RSTUV ~ 1 )".
1
RSTUV 1

7o Assume k, n are positive integers, 1

< k <no

x 1 , x 2 , ooo, xk

are k positive real numbers whose sum equals their product. Show that
x~-1

+ x~- +
1

000

+ xr

kn.

8o If a, b, c E R, show that

9o Prove that for any c

complex sequence a 1 , a 2 ,

>

0, there exists positive integer n and a

a, , such that

1Etat+E2a2+

000

+E,a,

1<(~

Ia;

lt)t

j=!

whereE; E {-1, 1}, j = 1, 2, ooo, n.

10o Assume a, bare positive,() E ( 0, ;
y = a

)0

Find the maximum for

v' sin () + b v' cos () .

llo Assume there are n real numbers, each of them has an

absolute value not greater than 2 and their cubes add up to 0. Show
that their sum is not greater than ; n.
12o Assume that n

3 is an integer, real numbers

"

x, E [ -1, 1] satisfy the relationship ~ x~

Xt,

x2,

Oo Prove that

4=1

13o Assume that the arithmetic average of n real numbers x 1 , x 2 ,

x, isa. Show that

24

Methods and Techniques for Proving Inequalities

14. Let x, y, z be non-negative real numbers. prove that

x(y +z -x) 2 +y(z +x -y) 2 +z(x +y -z) 2 ~3xyz.

Point out when the equality holds.

15. Assumen ~2 is an integer, real numbersa1
0, bl

b2

b,.

~a2 ~~a,.>

> 0.

.L;

Also assume a1a2"'a,. = btb2"'b,.,

(a; -a;) ~

t..;;i<;""

.L;
t..;;i<;""

b; ). Show that
11

11

.L; a;

~ (n -1)

i~l

.L; b;.
i~l

16. Let x, y, z be positive real numbers. Prove that

1

(xy +yz +zx) [ (x +y) 2 + (y +z)2 + (z +x)2 ~4'

(b, -