0% found this document useful (0 votes)
159 views26 pages

1 Problems and Solutions

Uploaded by

ss9421569
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
159 views26 pages

1 Problems and Solutions

Uploaded by

ss9421569
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 26

Inequalities (Problems and Solutions)

Keith Ong
April 2020

1 Problems and solutions


1. (Pathfinder) If a, b, c are positive real numbers satisfying a + b + c = 1, prove
that  
1+a 1+b 1+c b c a
+ + ≤2 + +
1−a 1−b 1−c a b c

1+a 1+b 1+c 2a 2b 2c


Solution: Note that 1−a + 1−b + 1−c = b+c + a+c + a+b + 3, then it is
equivalent to proving
Xa a 3
− ≥
cyc
c b+c 2

This can shown by CS inequality and Muirhead inequality:


X ab X (ab)2 (ab + bc + ca)2 3abc(a + b + c) 3
= ≥ ≥ =
cyc
c(b + c) cyc
abc(b + c) 2abc(a + b + c) 2abc(a + b + c) 2

⇐⇒ a2 b2 + b2 c2 + c2 a2 ≥ a2 bc + b2 ca + c2 ab.

2.Let a, b, c > 0 satisfying a + b + c = 1. Prove that:


1 − a2 1 − b2 1 − c2 12
2
+ 2
+ ≤
1+a 1+b 1 + c2 5

Solution: By using the tangent line trick, we have:


1 − x2 27 29
2
≤− x+ ⇐⇒ (3x − 4)(3x − 1)2 ≥ 0
1+x 25 25
for x ∈ [0, 1]. Thus,

1 − a2 1 − b2 1 − c2 27 87 12
2
+ 2
+ 2
≤− + =
1+a 1+b 1+c 25 25 5

1
3. (Folklore) a, b > 0, a + b = 1 Prove that
1 1 25
(a + )(b + ) ≥
a b 4

Solution: There are many ways to prove this (AM-GM, CS Inequality,


Calculus), I will present a way using AM-GM. Note that the equality happens
when a = b = 12 , so we can’t directly apply AM-GM, we should do
r s
1 1 1 1 1 1 1 1 5 1 1 25
(a+ + + + )(b+ + + + ) ≥ 25 8 3 3
≥ 25 5 8 a+b 6 =
4a 4a 4a 4a 4b 4b 4b 4b 4 a b 4 ( 2 ) 4

Alternatively, we could also do


1 1 1 a b 1 1 15 1 15 25
(a+ )(b+ ) = ab+ + + ≥ ab+ +2 ≥ ab+ + +2 ≥ + +2 =
a b ab b a ab 16ab 16ab 2 4 4
Similarly, it can also be shown true that this inequality holds:a, b > 0, a + b = 1
1 1 25
(a + )(b + ) ≥
b a 4

4. (Folklore) Let a, b, c > 0, a + b + c = 1. Prove that


1 1 1 1000
(a + )(b + )(c + ) ≥
b c a 27

Solution: By AM-GM,
r s
1 1 1 10 1 1 1000
(a+9 )(b+9 )(c+9 ) ≥ 1000 ≥ 1000 10 27 a+b+c 24 =
9b 9c 9a 927 a8 b8 c8 9 ( 3 ) 27

Alternatively, by AM-GM and CS Inequality, we have


1 1 1 1 1 1 1 1 728 1 1 1
(a+ )(b+ )(c+ ) = abc+ + + + +1 = abc+ + + + + +1
b c a a b c abc 729abc 729abc a b c
2 728 1000
≥ + +9+1=
27 27 27

2
5. (India 2002) a, b, c are positive reals. Prove that

a b c a+c b+a c+b


+ + ≥ + +
b c a b+c c+a a+b

Solution: Let x = ab , y = cb , z = ac , then xyz = 1 and note that a+c


b+c =
1+xy x−1 b+a 1+yz y−1 c+b 1+xz z−1
1+y = x − 1+y , similarly, c+a = 1+z = y − 1+z and a+b = 1+x = z − 1+x ,
so the inequality becomes
x−1 y−1 z−1
+ + ≥0
1+y 1+z 1+x

⇐⇒ (x2 − 1)(z + 1) + (y 2 − 1)(x + 1) + (z 2 − 1)(y + 1) ≥ 0


X X X
⇐⇒ x2 + x2 z ≥ 3 + x
cyc cyc cyc

x2 z ≥ 3 and the last inequality follows from


P
and by AM-GM, we have cyc

( cyc x)2
P
X X
2
x ≥ ≥ x
cyc
3 cyc

6. (IMO 1995) Let a, b and c be positive real numbers such that abc = 1.
Prove:
1 1 1 3
+ + ≥
a3 (b + c) b3 (a + c) c3 (a + b) 2

Solution: (a). By CS-Inequality, we have

1 1 1 b2 c 2 a2 c2 a2 b2
+ + = + +
a3 (b + c) b3 (a + c) c3 (a + b) a(b + c) b(a + c) c(a + b)

(bc + ac + ab)2 3
≥ ≥ ⇐⇒ ab + bc + ca ≥ 3
2(ab + bc + ca) 2
(b). By AM-GM,
X 1 a(b + c) X
( + )≥ bc,
cyc
a3 (b + c) 4 cyc
X 1 1X
≥ bc,
cyc
a3 (b + c) 2 cyc
X 1 3
≥ ,
cyc
a3 (b+ c) 2

3
This inequality can be generalized further: Let a, b, c ∈ R+ such that abc = 1.
Then X 1 3
x (b + c)

cyc
a 2

holds if x ≥ 2 or x ≤ −1.

Proof:
For each −1 < x < 2, we can find positive real numbers a, b, c such that abc = 1
and the inequality doesn’t hold. For any real x, define
X 1
f (x; a, b, c) =
cyc
ax (b+ c)

We show that f (x; a, b, c) is a non-decreasing function for x ≥ 1. Let x ≥ y ≥ 1


be two reals. Suppose a ≤ b ≤ c, then ax−y ≤ bx−y ≤ cx−y is true. We also
observe that ay (b + c) ≤ by (c + a) ≤ cy (a + b). Using Chebyshev’s inequality,we
obtain X 1 X 1
x (b + c)
= x−y ay (b + c)
cyc
a cyc
a

1 X 1 X 1 X 1
≥ ( x−y
)( y
)≥ y
3 cyc a cyc
a (b + c) cyc
a (b + c)

We have used AM-GM inequality in the last leg.We get f (x; a, b, c) ≥ f (y; a, b, c)
if x ≥ y ≥ 1. Thus f (x; a, b, c) is a non-decreasing function on [1, ∞). Now
consider f (2; a, b, c). We write
X 1 X a2 b2 (ab + bc + ca)2 3
f (2; a, b, c) = = ≥ ≥
cyc
a2 (b+ c) cyc
a + b 2(a + b + c) 2

⇐⇒ a2 b2 + b2 c2 + c2 a2 ≥ a + b + c
which follows from Muirhead Inequality, a2 b2 +b2 c2 +c2 a2 ≥ a2 bc+b2 ca+c2 ab =
a + b + c.Thus, we can conclude that f (x; a, b, c) ≥ 23 for x ≥ 2.

Remark: For 1/2 ≤ x < 2 the inequality fails.I am not presenting the
proof(it is not so lovely). For x in the interval (−∞, 1/2), we replace a, b, c by
1/p,1/q and 1/r respectively. Then f (x; a, b, c) = f (1 − x; p, q, r). But 1 − x
lies in the interval (1/2, ∞). It follows that the inequality hold good for x ≤ −1.

4
7. Let a, b, c be positive real numbers such that abc = 1. Prove that

1 1 1 3 1 a(c − b)2 b(c − a)2 c(b − a)2


+ + ≥ + [ + + ]
a3 (b + c) b3 (a + c) c3 (b + a) 2 4 b+c c+a a+b

Solution:(a). By Rearrangement Inequality, we can prove that for any


positive reals x, y, z such that x ≤ y ≤ z, we have xy yz zx
z + x + y ≥ x + y + z.
Then let x = a(b + c), y = b(c + a), z = c(a + b), we will get

bc(a2 + bc + ab + ac) ac(b2 + ac + ab + bc) ab(c2 + ab + bc + ca)


+ + ≥ 2(ab+bc+ca)
a(b + c) b(c + a) c(a + b)
1 1 1 1 1 1 1 1
+ 3 + 3 ≥ (ab+bc+ca)+ (ab+bc+ca)− − −
a3 (b + c) b (a + c) c (b + a) 2 2 b+c a+c b+a
Now, it is suffices to prove that

1 1 1 1 1 a(c − b)2 b(c − a)2 c(b − a)2


(ab + bc + ca) − − − = [ + + ]
2 b+c a+c b+a 4 b+c c+a a+b
because by AM-GM, we have 12 (ab + bc + ca) ≥ 32 . Note that

1 a(c − b)2 b(c − a)2 c(b − a)2 1 1 1


[ + + ]+ + +
4 b+c c+a a+b b+c a+c b+a
X ac2 + ab2 + 2 X a(b + c)2 1X
= = = ab
cyc
4(b + c) cyc
4(b + c) 2 cyc

(b). We first replace a, b, c by 1/a, 1/b, 1/c and then the inequality becomes
!
2 2 2
a2 b2 c2 3 1 (c − b) (b − a) (c − a)
+ + ≥ + + +
b+c c+a a+b 2 4 b+c b+a a+c

Now, using the Rearrangement Inequality two times, we get that

a2 b2 c2 1 b2 + c2 c2 + a 2 a 2 + b2
 
+ + ≥ + +
b+c c+a a+b 2 b+c c+a a+b

then it is suffices to prove that


!
2 2 2
b2 + c2 c2 + a2 a2 + b2
 
1 1 (c − b) (b − a) (c − a) 3
+ + − + + ≥
2 b+c c+a a+b 4 b+c b+a a+c 2

We have by AM-GM,
!
2 2 2
b2 + c2 c2 + a2 a2 + b2
 
1 1 (c − b) (b − a) (c − a) 1 3
+ + − + + = (a + b + c) ≥
2 b+c c+a a+b 4 b+c b+a a+c 2 2

5
8. For a, b, c ≥ 1 Prove that
√ √ √ p
a − 1 + b − 1 + c − 1 ≤ c(ab + 1)

√ √ √
Solution: We will prove that a − 1 + b − 1 ≤ ab. Squaring gives us
p
2 (a − 1)(b − 1) ≤ ab − a − b + 1 + 1
p
2 (a − 1)(b − 1) ≤ (a − 1)(b − 1) + 1
which is true by AM-GM. Then, we have
√ √ √ √ √ p
a − 1 + b − 1 + c − 1 ≤ ab + 1 − 1 + c − 1 ≤ c(ab + 1)

9. Let a, b, c > 0 and a6 + b6 + c6 = 24. Prove that


1 1 1
√ +√ +√ + ab + bc + ca ≤ 7
a6 + 1 b6 + 1 c6 + 1

Solution: By AM-GM, we know that a2 + b2 + c2 ≥ ab + bc + ca,so it is


suffices to prove that
X 1
√ + a2 ≤ 7
a 6 + 1
cyc

which is clear by the tangent line trick.

6
10. Let a, b, c, d be positive real numbers. Prove that
6 8
1+ ≥
ab + ac + ad + bc + bd + cd a+b+c+d

Solution: By AM-GM, we have


r
6 6
1+ ≥2
ab + ac + ad + bc + bd + cd ab + ac + ad + bc + bd + cd
and now it is suffices to prove that
X X X X
3(a+b+c+d)2 ≥ 8(ab+bc+cd+da+ac+bd) ⇐⇒ 3 a2 ≥ ab ⇐⇒ 4 a2 ≥ ( a)2
cyc cyc cyc cyc

which is true by CS inequality or it can also be proven by QM-GM.

11. (Second Saudi Arabia JBMO 2019, P2) Let a, b, c be non-negative real
numbers. Prove that
p p p
a 3a2 + 6b2 + b 3b2 + 6c2 + c 3c2 + 6a2 ≥ (a + b + c)2


Solution: We shall proceed by proving that a 3a2 + 6b2 ≥ a2 + 2ab. By
squaring it, we have

3a4 + 6a2 b2 ≥ a4 + 4a3 b + 4a2 b2 ⇐⇒ (a − b)2 ≥ 0

1
12. (ELMO 2019 shortlist A1) Let a, b, c be positive reals such that a + 1b +
1
c = 1. Show that

aa bc + bb ca + cc ab ≥ 27bc + 27ca + 27ab

Solution: By AM-GM, we have


1 1 1
r
a + b + c 3 1
≥ ⇒ abc ≥ 27
3 abc
Then, by Weighted AM-GM, we have
aa bb cc
aa bc + bb ca + cc ab ≥ 27bc + 27ca + 27ab ⇐⇒ + + ≥ 27
a b c
aa bb cc
which is true, a + b + c ≥ abc ≥ 27.

7
13. Let a, b, c, d be positive real numbers, such that abcd = 1. Prove that
1 1 1 1
+ + + ≥1
5a2 − 2a + 1 5b2 − 2b + 1 5c2 − 2c + 1 5d2 − 2d + 1

Solution: 1. By CS-Inequality, the sum is

( cyc abc)2
P
X a2 b2 c2
≥ P P
cyc
a2 b2 c2 − 2abc + 5 2 2 2
cyc a b c − 2 cyc abc + 20

and then it is suffices to prove that


X X X X X
(abc)2 ≥ a2 b2 c2 − 2 abc + 20 ⇐⇒ ab + abc ≥ 10
cyc cyc cyc cyc cyc

which is true by AM-GM.

1 1 1 1
Remark:We can also let a = w,b = x, c = y,d = z before proceeding to
CS-Inequality.

2. *Hard core bashing* Let a = ew , b = ex , c = ey , d = ez , then w + x +


y + z = 0, and the function
1
f (x) =
5e2x − 2ex + 1
has only one inflection point. Thus, by n − 1 EV, we have x = y = z, and let
t = ex . Then the problem becomes

t6 3
3 6
+ 2 ≥1
5 − 2t + t 5t − 2t + 1
and we know that the equality happens when t = 1 so we only need take the
derivative and verify that t = 1 is the minimum value of the function.

8
14. For n ∈ N. Prove that
√ 1
n
n<1+ √
n

Solution: Note that


√ n−1
n
n−1= n−1 n−2 1
n n +n n + ... + n n + 1
We now use AM-GM, so
√ n−1
n
n−1= n−1 n−2 1
n +n n + ... + n n + 1
n

n−1
≤ p n−1
n−1
1 + n − 1( n 2 )
n−1
≤ 1
1 + (n − 1)n 2
n−1
< √
(n − 1) n
1
=√ .
n

15. Let a, b, c > 0, prove that:


1 1 1 9
+ + ≥
a2 + b2 + ab b2 + c2 + bc c2 + a2 + ca (a + b + c)2

Solution: Multiply both sides by a2 + b2 + c2 + ab + bc + ca, then we have


X 1 9

cyc
a2 + b2 + ab (a + b + c)2

X c 9(ab + bc + ca)
⇐⇒ 3 + (a + b + c) ≥9−
cyc
a2 2
+ b + ab (a + b + c)2
X c2 9(ab + bc + ca)
⇐⇒ (a + b + c) + ≥6
cyc
c(a2 + b2 + ab) (a + b + c)2

Then, by CS-Inequality, we have


X c2 (a + b + c)2 a+b+c
≥P ≥
cyc
c(a2 2
+ b + ab) cyc c(a2 + b2 + ab) ab + bc + ca

9
And it is suffices to prove that

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


+ ≥6
ab + bc + ca (a + b + c)2

by AM-GM.

16. (MOP 2006) Let n be a positive integer. Solve the system of equations:

n(n + 1)
x1 + 2x2 + · · · + nxn =
2
x1 + x22 + · · · + xnn = n

Solution: Take the second equality and subtract the first equality, we get

x1 + x22 + 1 + x33 + 1 + 1 + · · · + xnn + 1 + ... + 1 = x1 + 2x2 + 3x3 + ... + nxn

but we know that

x1 + x22 + 1 + x33 + 1 + 1 + · · · + xnn + 1 + ... + 1 ≥ x1 + 2x2 + 3x3 + ... + nxn

by AM-GM, thus the only solution is x1 = x2 = · · · = xn = 1.

17. Find all pair (x, y) of positive integers satisfying

x √ 1
− 2 < 3
y y

Solution: We have

√ 1 2 2 x + 2y
|x − 2y| < 2 ⇒ 1 ≤ |x − 2y | <
y y2
and then from the first and second inequality, we get that
√ 1 √
y2 − 2y < x < 2
+ 2y ⇒ y < 3
y
√ √
So, when y = 1, |x − 2| < 1, x = 1, 2. When y = 2, |x − 2 2| < 41 , x = 3.

10
18. (Macedonian Olympiad 2005) If a, b, c > 1 and a + b + c = 9, prove that
√ √ √ √ p
ab + ac + bc ≤ a + b + c ≤ a2 + b2 + c2

Solution: We shall first prove the second inequality, note that


p √
3(a2 +b2 +c2 ) ≥ a2 +b2 +c2 +2ab+2bc+2ac = (a+b+c)2 = 81 ⇒ a2 + b2 + c2 ≥ 27
√ √ √ √
and now we will prove that 27 ≥ a + b + c, which follows from QM-AM
or
√ √ √ √ √ √
27 = 3(a + b + c) ≥ a + b + c + 2 ab + 2 bc + 2 ca = ( a + b + c)2
√ √ √
Now, for the first
√ inequality,
√ √ it is equivalent to ( a + b + c)2 ≥ ab + bc + ca or
a2 +b2 +c2 +2( a+ b+ c)2 ≥ a2 +b2 +c2 +2ab+2bc+2ca = (a+b+c)2 = 81,
now by AM-GM, we have
√ √ √ √ √ √ √
2( a + b + c)2 + 54 ≥ 12 3( a + b + c)
√ √ √ √ √ √ √
a2 + b2 + c2 + 2( a + b + c)2 ≥ a2 + b2 + c2 + 12 3( a + b + c) ≥ 135
√ √ √ √ √ √
Now let x = 3a ≥ 3, y = 3b ≥ 3, z = 3c ≥ 3, x2 + y 2 + z 2 = 27,
then it is suffices to prove that
X x4 X
+ 12 x ≥ 135
cyc
9 cyc

by considering the inequality

x4
+ 12x ≥ 4x2 + 9
9
(x − 3)2 (x2 + 6x − 9) ≥ 0

which follows from x2 + 6x − 9 ≥ 6 3 − 6 > 0.

11
19. (Taiwan 1992) If x1 , x2 , x3 , · · · , xn (n > 2) are non-negative real numbers
with x1 + x2 + · · · + xn = 1. Prove that
4
x21 x2 + x22 x3 + ... + x2n x1 ≤
27

Solution: We shall prove when n = 3 first, assume that x1 ≥ x2 , x3 and


x1 + x2 + x3 = 1, we have

x3 x1 (x3 + x1 ) (x3 + x1 )(2x2 + x3 )x1


x21 x2 + x22 x3 + x23 x1 ≤ x21 x2 + x1 x2 x3 + =
2 2
Now, applying AM-GM, we get
3
(x3 + x1 )(2x2 + x3 )x1 ( x3 +x1 +2x27
2 +x3 +x1 )
) 4
≤ =
2 2 27
We now prove for all n, let a = x1 , b = x2 , c = x3 + x4 + · · · + xn , a + b + c = 1,
and assume that x1 ≥ xi for 2 ≤ i ≤ n

LHS ≤ x21 x2 + x22 x3 + (x23 + x24 + · · · + x2n )x1


≤ x21 x2 + x22 (x3 + x4 + · · · + xn ) + (x3 + x4 + · · · + xn )2 x1
= a2 b + b2 c + c2 a
4

27
Remark: For n = 3, the equality happens when x1 = 32 , x2 = 13 , x3 = 0 and
for n in general, the equality happens when one of the terms is 23 , 13 and the rest
are 0.

20. Let a, b, c, d, e be non-negative real numbers such that a+b+c+d+e = 5.


Prove that
abc + bcd + cde + dea + eab ≤ 5

Solution: Let e ≤ min{a, b, c, d}. We can apply AM-GM cleverly,

abc + bcd + cde + dea + eab = e(a + c)(b + d) + bc(a + d − e)


e(5 − e)2 (5 − 2e)3
≤ +
4 27
≤5
⇐⇒ (e − 1)2 (e + 8) ≥ 0.

12
21. (IMO 2000) Let a, b, c be positive reals such that abc = 1. Prove that
   
1 1 1
a−1+ b−1+ c−1+ ≤1
b c a

Solution: Usually when we see abc = 1, it’s tempting to use the substitution
a = xy , b = yz , c = xz and we will do so. We get that

(x − y + z)(x + y − z)(−x + y + z) ≤ xyz

⇒ xy(x + y) + yz(y + z) + zx(z + x) ≤ x3 + y 3 + z 3 + 3xyz


which is Schur’s 3rd degree inequality. Otherwise, we can use another substitu-
tion to show this is true, let x = u + v, y = v + w, z = w + u. Then the inequality
becomes
(u + v)(v + w)(w + u) ≥ 8uvw
which is true by AM-GM.

22. (Folklore) Let a, b, c, d be positive reals. Prove that

a b c d
+ + + ≥2
b+c c+d d+a a+b

Solution: By using CS-Inequality, we have

( cyc a)2
P
X a
≥P ≥ 2 ⇐⇒ a2 + b2 + c2 + d2 ≥ 2ac + 2bd
cyc
b + c cyc a(b + c)

which follows from AM-GM.

23. (Balkan 2006) Prove that


1 1 1 3
+ + ≥
a(1 + b) b(1 + c) c(1 + a) 1 + abc

holds for positive reals a, b, c.

Solution: Multiply both sides by 1 + abc and add 3 both sides, then with
AM-GM,
X 1 + abc + a + ab X 1+a X b(1 + c)
= + ≥ 6.
cyc
a + ab cyc
a(a + b) cyc (a + b)

13
24. Let x, y, z > 0 such that xyz = 1. Show that

x2 + y 2 + z 2 + x + y + z ≥ 2(xy + yz + zx)

Solution: We will use AM-GM to get a form of Schur’s Inequality, note


that p
(x + y + z)2 ≥ 9 3 (xyz)2 ≥ 9xyz
9xyz
⇒x+y+z ≥ ≥ 2(xy + yz + zx) − (x2 + y 2 + z 2 )
x+y+z
⇐⇒ (x2 + y 2 + z 2 )(x + y + z) + 9xyz ≥ 2(xy + yz + xz)(x + y + z)
which the last inequality is Schur’s 3rd degree inequality when expanded.

25. (Germany TST 2012 P3) Let a, b, c be positive real numbers with a2 +
b + c2 ≥ 3. Prove that
2

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


+ + ≥ .
(b + 1)(b + 5) (c + 1)(c + 5) (a + 1)(a + 5) 2

Solution: We could first reduce the fractions by noticing that (b+1)(b+5) ≤


4 2
3 (b + 2) ⇐⇒ b2 + 1 ≥ 2b in order to make the expressions look simpler.
X (a + 1) X 3 (a + 1)2
4 =
cyc 3
(b + 2) cyc
4 (a + 1)(b + 2)
3 (a + b + c + 3)2
≥ P P
4 cyc ab + 3 cyc a + 6
2
P P P
3 cyc a + 2 cyc ab + 6 cyc +9
= P P
4 cyc ab + 3 cyc a + 6
3
≥ (2)
4
3
= .
2

14
26. (IMO 1983) Let a, b, c be the lengths of the sides of a triangle. Prove
that
a2 b(a − b) + b2 c(b − c) + c2 a(c − a) ≥ 0
Solution: By the triangle inequality, we get b ≥ a − c, c ≥ b − a, a ≥ c − b.
Thus the inequality becomes

a2 (a − c)(a − b) + b2 (b − a)(b − c) + c2 (c − b)(c − a) ≥ 0

which is Schur’s Inequality with r = 2.


Remark: One can also use the substitution a = x + y, b = y + z, c = z + x
and expand the whole expression and prove it, we will not present this solution
here.

27. Let a, b, c > 0 such that ab + bc + ca = 3. Show that


1 1 1 1
+ + ≤
1+ a2 (b + c) 1+ b2 (c + a) 1+ c2 (a + b) abc

1
Solution: Notice that abc = 13 ( a1 + 1b + 1c ) and 1
1+a2 (b+c) = 1
1+3a−abc so now
the inequality becomes
 
X 1 1 1 1 1
≥ + +
cyc
1 + 3a − abc 3 a b c

which follows from proving that abc ≥ 1 by AM-GM.

28. Given ab + bc + ca = 1. Show that


√ √ √
3a2 + b2 3b2 + c2 3c2 + a2 √
+ + ≥6 3
ab bc ca

Solution: By using CS-Inequality,


p
(3a2 + b2 )(3 + 1) 3a + b

2ab 2ab
similarly, it holds for the other two cases. Then,

X 3a2 + b2 √
X 3a + b  
1 1 1 2 1
≥ =2 + + = ≥ 6 3 ⇐⇒ abc ≤ √
cyc
ab cyc
2ab a b c abc 3 3

which follows from AM-GM.

15
1 1 1

29. Let a, b, c > 0 such that a + b + c = abc. Prove that
p
abc ≥ 3(a + b + c).

Solution: The inequality can be rewritten as


ab + bc + ca p
√ ≥ 3(a + b + c)
abc
⇐⇒ (ab + bc + ca)2 ≥ 3(a + b + c)(abc)
⇐⇒ a2 b2 + b2 + c2 a2 ≥ a2 bc + ab2 c + abc2

which follows from Muirhead’s Inequality.

30. (Adapted from APMO 2004) Let a, b, c be real numbers. Prove that

(a2 + 2)(b2 + 2)(c2 + 2) ≥ 3(a + b + c)2

Solution: By CS-Inequality and AM-GM,

(a + b)2 3
(a2 +2)(b2 +2) = (a2 +1)(1+b2 )+a2 +b2 +3 ≥ (a+b)2 + +3 = ((a+b)2 +2)
2 2
Now, we can use CS-Inequality again to prove the inequality,
3
(a2 + 2)(b2 + 2)(c2 + 2) ≥ ((a + b)2 + 2)(c2 + 2)
2
3 √ √
≥ ( 2(a + b) + 2c)2
2
= 3(a + b + c)2 .

16
31. Let a, b, c be positive real numbers such that a + b + c = 3. Prove that

a2 b2 c2
2
+ 2
+ ≥1
a + 2b b + 2c c + 2a2

Solution: This is a nice application of AM-GM, we start by doing

a2 + 2ab2 − 2ab2 2ab2 2ab2 2√3


= a − ≥ a − √ = a − a2 b2
a + 2b2 a + b2 + b2 3
3 ab 4 3

Now we are in a good shape, we just need to prove that


X 2√3
X√ 3
(a − a2 b2 ) ≥ 1 ⇐⇒ a2 b2 ≤ 3
cyc
3 cyc

which we can use AM-GM again,


X√
3
X ab + ab + 1
a2 b2 ≤ ≤ 3 ⇐⇒ ab+bc+ca ≤ 3 ⇐⇒ 3(ab+bc+ca) ≤ (a+b+c)2 .
cyc cyc
3

32. Let a, b, c > 0 such that a + b + c ≤ 23 . Prove that

a b c a b c
+ + ≤ + +
b+c c+a a+b (b + c)2 (c + a)2 (a + b)2

Solution: We see that the RHS has an extra factor of (b + c), (c + a), (a + b)
in the denominators. Thus, we can use Chebyshev’s Inequality by letting
1 1 1
0 < a ≤ b ≤ c and so b+c ≤ c+a ≤ a+b , we have
  
a b c 1 a b c 1 1 1
+ + ≥ + + + + .
(b + c)2 (c + a)2 (a + b)2 3 b+c c+a a+b b+c c+a a+b

Now we need to prove that


1 1 1
+ + ≥3
b+c c+a a+b
which by CS-Inequality,
1 1 1 9 3
+ + ≥ ≥ 3 ⇐⇒ a + b + c ≤ .
b+c c+a a+b 2(a + b + c) 2

17
33. Let a, b, c > 0 such that ab + bc + ca = 1. Prove that
p p p
abc(a + a2 + 1)(b + b2 + 1)(c + c2 + 1) ≤ 1

√ √
Solution: Note that ( a2 + 1 − a)( a2 + 1 + a) = 1, so the we multiply
each side by this extra factor to get
p p p
( a2 + 1 − a)( b2 + 1 − b)( c2 − 1 − c) ≥ abc.

Now, we use the given condition by replacing the 1, we have


p p p
( a2 + ab + bc + ca − a)( b2 + ab + bc + ca − b)( c2 + ab + bc + ca − c) ≥ abc
p p p
⇐⇒ ( (a + b)(a + c) − a)( (b + a)(b + c) − b)( (c + a)(c + b) − c) ≥ abc
p √ √
which is true by CS-Inequality, since (a + b)(a + c) − a ≥ a + ab − a = ab.
Same goes for the other two cases, then multiplying them gives us the desired
inequality.

34. (Romania 2002) If a, b, c ∈ (0, 1). Prove that


√ p
abc + (1 − a)(1 − b)(1 − c) < 1

Solution: 1. CS-Inequality,
p √
(1 − a + a)(1 − b + b) ≥ ( (1 − a)(1 − b) + ab)2 > (1 − a)(1 − b) + ab

since a, b can’t be 0, 1. Now we apply it again by inviting c in,


p √
1 = (1−a+a)(1−b+b)(1−c+c) > ((1−a)(1−b)+ab)(1−c+c) ≥ (1 − a)(1 − b)(1 − c)+ abc.

2. We can use trigonometric substitution, let a = sin2 A, b = sin2 B,


c = sin2 C where A, B, C ∈ (0, π2 ). Then we are to prove that

sin A sin B sin C + cos A cos B cos C < 1.

Note that sin C, cos C < 1, so we have

sin A sin B sin C +cos A cos B cos C < sin A sin B +cos A cos B = cos(A−B) ≤ 1.

18
1 1 1
35. Let x, y, z > 1 such that x + y + z = 2. Prove that
√ √ p √
x+y+z ≥ x−1+ y−1+ z−1

Solution: In this problem, CS-Inequality looks like a good choice, we can


get the desired terms on the left by having
√ √
 
x−1 y−1 z−1 p
(x + y + z) + + ≥ ( x − 1 + y − 1 + z − 1)2
x y z
x−1 y−1 z−1
and at last, note that x + y + z = 1 and we are done.

36. Let a, b, c be positive real numbers satisfying a2 + b2 + c2 = 3. Prove


that
a3 b3 c3
+ + ≥1
2b2 + c2 2c2 + a2 2a2 + b2

Solution: We have the given conditions in powers of two but the inequality
has powers of three on the numerators, so it is good to separate the denomina-
tors and the numerators by using Chebyshev’s Inequality. Let a ≤ b ≤ c and
1 1 1
2b2 +c2 ≤ 2c2 +a2 ≤ 2a2 +b2 ,

a3 b3 c3
 
1 1 1 1
2 2
+ 2 2
+ 2 2
≥ (a3 +b3 +c3 ) 2 2
+ 2 2
+ 2 .
2b + c 2c + a 2a + b 3 2b + c 2c + a 2a + c2

We now deal with the rightmost expression first, by CS-Inequality, we have


1 1 1 9
+ 2 + 2 ≥ = 1.
2b2 + c2 2c + a2 2a + c2 3(a2 + b2 + c2 )

So, it’s suffices to prove that a3 +b3 +c3 ≥ 3 which follows from Weighted Power
Mean,
 3 1 1
a + b3 + c3 3
 2
a + b2 + c 2 2
≥ .
3 3

19
37. Let x, y, z > 0 such that x + y + z = xyz. Prove that
x+y y+z z+x 27
+ + ≥
1 + z2 1 + x2 1 + y2 2xyz

Solution: By CS-Inequality,

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


2
+ 2
+ 2
≥P 2
= P 2
=
1+z 1+x 1+y cyc (1 + x )(y + z) 2xyz + cyc x (y + z) Πcyc (x + y)

Now, by AM-GM,

4(x + y + z)2
 
27 27
≥ 4(x + y + z)2 = .
Πcyc (x + y) 8(x + y + z) 2xyz

38. Prove that


v s
u r q

u
2 3 4 · · · N < 3, ∀N ∈ N≥2
t

Solution: This time we will use induction but by inducting downwards! We


prove that v s
u r

u q
t
m m + 1 m + 2 · · · N < m + 1.

When m = N , we have N < N + 1 which is clearly true. Now, suppose that
when m = k + 1, the inequality is true so we that when m = k,
s r

q
p
k k + 1 · · · N < k + 1 ⇔ k(k + 2) < k + 1

which completes our inductive step.

20
39. (IMO SL 1996 A1) Let a, b, c be positive reals such that abc = 1. Prove
that
X ab
≤ 1.
cyc
a + b5 + ab
5

Solution: We first prove that a5 + b5 ≥ a3 b2 + a2 b3 , this can be proven


by many ways (Muirhead, Rearragement, Weighted AM-GM,...) but I will only
present one way, just note that (a3 − b3 )(a2 − b2 ) ≥ 0 and the result follows. So,
we we have
X ab X ab X 1 X c
5 5
≤ 3 2 2 3
= 2 2
= = 1.
cyc
a + b + ab cyc
a b + a b + ab cyc
a b + ab + 1 cyc
a+b+c

40. Given that a, b, c are positive reals, prove that


√ √ √
(a + b)3 + 4c3 ≥ 4( a3 b3 + b3 c3 + c3 a3 )

Solution: We have LHS= a3 + b3 + 3a2 b + 3ab2 , we can first get away


with the terms a3 + b3 since a3 + b3 ≥ a2 b + ab2 (by Rearrangement Theorem,
Muirhead,...), so now we are left with proving
√ √ √
a2 b + ab2 + c3 ≥ a3 b3 + b3 c3 + c3 a3 .
We see that we should first use AM-GM on the first two terms on the LHS since
there’s no term on the RHS that contains a, b, c, thus
√ √ √ √ √ √ √ √
a2 b+ab2 +c3 ≥ 2 a3 b3 +c3 ≥ a3 b3 + b3 c3 + c3 a3 ⇐⇒ ( c3 − a3 )( c3 − b3 ) ≥ 0
which follows if we let a ≤ b ≤ c.

41. Let a, b, c > 0 and a + b + c = 1, prove that


√ 1
a1−a b1−b c1−c ≤ .
3

Solution: Normally we can tackle these type of inequalities with variables


as exponents, i.e aa , ba+b with the help of Weighted AM-GM, we can first set
up the LHS as follows,
1−a 1−b 1−c 1−a 1−b 1−c
(a) + (b) + (c) ≥ a 2 b 2 c 2 .
2 2 2
1
Note that the weights add up to 1. Now, we prove that 3 ≥LHS, which follows
from a2 + b2 + c2 ≥ 13 by QM-AM.

21
42. (Folklore) Let a, b, c > 0 and abc = 1. Prove that

ab+c ba+c ca+b ≤ 1.

Solution: Similar to the previous problem, we set up the LHS as follows,


c b a 1
(ab) + (ac) + (bc) ≥ (ab+c ba+c ca+b ) a+b+c .
a+b+c a+b+c a+b+c
Now we can prove that the 1 ≥LHS, then we are done. This is equivalent to
showing that a + b + c ≥ 3 which is clear by AM-GM.

43. (USAMO 1997) Let a, b, c > 0, prove that


a+b+c
aa bb cc ≥ (abc) 3

Solution: We first put all variables to the LHS, so we need to prove that
−2a+b+c a−2b+c a+b−2c
1≥a 3 b 3 c 3

we can ignore the 3 in the denominator and replace it by 2(a + b + c) just to


make the weights add up to 1 and using Weighted AM-GM,
    1
1 b c a c a b b a c a a b c b a c b c 2(a+b+c)
1= (a)( + ) + (b)( + ) + (c)( + ) ≥ ( ) ( ) ( ) ( ) ( ) ( ) .
2(a + b + c) a a b a c c a a b b c c

Thus, the desired result follows.

44. (Folklore) Let a, b, c > 0, prove that

aa bb cc ≥ ac ba cb .

Solution: Similar to the previuos problem, by Weighted AM-GM,


    1
1 b c a b a c b a c a+b+c
1= (a)( ) + (b)( ) + (c)( ) ≥ ( ) ( ) ( ) .
a+b+c a b c a b c

22
45. (Evan√ Chen√ / ELMO
√ SL 2013) Let a, b, c be positive reals satisfying
a + b + c = 7 a + 7 b + 7 c. Prove

aa bb cc ≥ 1

Solution: This is a great problem that illustrate the elegance of Weighted


AM-GM, we set up the whole inequality by
1  −6 −6 −6
 − 6
(a)(a 7 ) + (b)(b 7 ) + (c)(c 7 ) ≥ aa bb cc 7(a+b+c)
a+b+c
and we are done.
√ √ √
Remark: In general, note that the condition a + b + c = √7 a + √7 b + √7 c
doesn’t matter which powers that you pick, i.e. a2 + b2 + c2 = 5 a + 5 b + 5 c.
You can still use the same method as above to get the desired inequality.

46. (Evan Chen) If a3 + b3 + c3 + abc = 4, prove

(5a2 + bc)2 (5b2 + ca)2 (5c2 + ab)2 (10 − abc)2


+ + ≥
(a + b)(a + c) (b + c)(b + a) (c + a)(c + b) a+b+c

Solution: By CS-Inequality, we have


X (5a2 + bc)2 X (5a3 + abc)2
=
cyc
(a + b)(a + c) cyc
a2 (a + b)(a + c)
(20 − 2abc)2
≥P P P P
a4 + a3 b + a3 c + a2 bc
4(10 − abc)2
=
4(a + b + c)
(10 − abc)2
= .
a+b+c

23
√ √ √
47. Let a, b, c be positive reals such that a2 + b2 + a2 + c2 + b2 + c2 =
2017. Find the minimum value of
a2 b2 c2
A= + + .
b+c c+a a+b

Solution: Chebyshev might be useful in this problem, our goal is to find


the minimum value of a2 + b2 + c2 and the maximum value of a + b + c, then
Chebyshev will do. So, by AM-GM,
20172
Xp 3 X a2 + b2 + 20172
2017 = a2 + b2 ≤ 9
⇒ a2 + b2 + c2 ≥ .
cyc
2017 cyc 2 6

For the maximum value of a + b + c, we use CS-Inequality,


r
Xp X 1 2017
2017 = 2
a +b ≥ 2 (a + b)2 ⇒ a + b + c ≤ √ .
cyc cyc
2 2

Now, I will prove a general lemma with Chebyshev’s Inequality and CS-Inequality,
Lemma: a, b, c are positive reals, we have
X an 3 an + bn + cn
 

cyc
b+c 2 a+b+c

Proof: By CS-Inequality and Chebyshev’s Inequality, let an ≥ bn ≥ cn and


1 1 1
b+c ≥ c+a ≥ a+b ,

X an 1

1 1 1

3 an + bn + cn
 
≥ (an + bn + cn ) + + ≥ .
cyc
b+c 3 b+c c+a a+b 2 a+b+c

Thus, when n = 2, we have


20172
!
a2 b2 c2 a2 + b2 + c2
 
3 3 6 2017
A= + + ≥ ≥ 2017 = √
b+c c+a a+b 2 a+b+c 2 √ 2 2
2

2017
where equality happens at a = b = c = √ .
3 2

24
48. (Taiwan TST) Let a, b, c be positive reals, prove that
r
√3
3 3
3 a + b + c
3
3(a + b + c) ≥ 8 abc +
3

Solution: Take the weights to be 98 , 19 , by weighted power mean inequality,


we have
r !3
1 a3 + b3 + c3 8√ 1 3 a3 + b3 + c3
 
8 3
(abc) + ≥ abc + .
9 9 3 9 9 3

Now, we just need to prove that

(a + b + c)3 ≥ 24abc + a3 + b3 + c3 .

Expanding the LHS we see that

a2 b + a2 c + b2 a + b2 c + c2 a + c2 b ≥ 6abc

which follows from AM-GM.

49. (APMO 1998) Let a, b, c be positive reals. Prove that


   
 a b  c a+b+c
1+ 1+ 1+ ≥2 1+ √ 3
b c a abc

Solution: Expanding the LHS and applying AM-GM, we get


a a a  b b b
 
c c c
+ + + + + + + + −1
a b c a b c a b c
 
a+b+c
≥3 √
3
−1
abc
 
a+b+c
≥2 1+ 3 √
abc

3
⇐⇒ a + b + c ≥ 3 abc

which follows from AM-GM.

25
50. (IMO 1984) Prove that
7
0 ≤ yz + zx + xy − 2xyz ≤
27
where x, y, z are non-negative real numbers satisfying x + y + z = 1.

Solution: 1. We start from the LHS. Using the given condition, we homog-
enize the whole inequality,

2xyz ≥ (x + y + z)(yz + zx + xy) = 3xyz + x2 y + x2 z + y 2 x + y 2 z + z 2 x + z 2 y

which is clearly true. Then we can also do the same thing for the RHS, that is,
proving
7
(x + y + z)(xy + yz + zx) − 2xyz ≤ (x + y + z)3
27
I will leave this to you.

2. We first rewrite yz + zx + xy − 2xyz as xy(1 − 2z) + z − z 2 and now we


can let x ≥ y ≥ z so z ≤ 31 and xy(1 − 2z) + z − z 2 ≥ 0. Now, by using AM-GM,
we some manipulating,
3
(x + y)2 z 2 (1 − 2z) 1

1 z + z + 1 − 2z 1 7
xy(1−2z)+z−z 2 ≤ (1−2z) +z−z 2 = + ≤ + = .
4 4 4 4 3 4 27

Alternatively, we can also note that


1 1
yz + zx + xy − 2xyz = (1 − 2x)(1 − 2y)(1 − 2z) +
4 4
then apply AM-GM.

26

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy