Vasile Cîrtoaje

DISCRETE
INEQUALITIES

VOLUMES 6, 7, 8

NEW METHODS
NEW METHODS
FOR CREATING AND SOLVING 
DISCRETE INEQUALITIES

ART OF PROBLEM SOLVING

2015
Contents

1 Half Convex Function Method 1

1.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17

2 Partially Convex Function Method 93

2.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
2.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94
2.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95

3 Half Convex Function Method for Ordered Variables 97

3.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
3.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
3.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99

4 Partially Convex Function Method for Ordered Variables 101

4.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
4.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
4.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103

5 Equal Variable Method for Nonnegative Variables 105

5.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
5.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
5.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107

6 Equal Variable Method for Real Variables 109

6.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
6.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
6.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111

i
ii Vasile Cîrtoaje

7 Arithmetic Compensation Method 113

7.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
7.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
7.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115

8 Cyclic Homogeneous Polynomial Inequalities in Real Variables 117

8.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
8.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
8.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119

9 Cyclic Homogeneous Polynomial Inequalities in Nonnegative Variables 121

9.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121
9.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
9.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123

10 Symmetric Homogeneous Polynomial Inequalities in Real Variables 125

10.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
10.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
10.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127

11 Symmetric Homogeneous Polynomial Inequalities in Nonnegative Variables129

11.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
11.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
11.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131

12 Best Upper Bound of Jensen’s Difference 133

12.1 Theoretical Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133
12.2 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134
12.3 Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135

A Glossary 137
Chapter 1

Half Convex Function Method

1.1 Theoretical Basis

Half Convex Function Theorem (Vasile Cirtoaje, 2004). Let f (u) be a function defined
on a real interval I and convex on Iu≤s or Iu≥s , where s ∈ I. The inequality
a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f
n
holds for all a1 , a2 , . . . , an ∈ I satisfying a1 + a2 + · · · + an = ns if and only if

f (x) + (n − 1) f ( y) ≥ n f (s)

for all x, y ∈ I such that x + (n − 1) y = ns.

Proof (for the right convexity). The necessity is obvious. Without loss of generality,
assume that a1 ≤ a2 ≤ · · · ≤ an . If a1 ≥ s, then the required inequality follows from
Jensen’s inequality for convex functions. Otherwise, there exists k ∈ {1, 2, . . . , n − 1}
such that
a1 ≤ · · · ≤ ak < s ≤ ak+1 ≤ · · · ≤ an .
Since f is convex on Iu≥s , we can apply Jensen’s inequality to get
ak+1 + · · · + an
f (ak+1 ) + · · · + f (an ) ≥ (n − k) f (z), z= .
n−k
Thus, it suffices to show that

f (a1 ) + · · · + f (ak ) + (n − k) f (z) ≥ n f (s).

Let b1 , . . . , bk ∈ I defined by

ai + (n − 1)bi = ns, i = 1, . . . , k.

1
2 Vasile Cîrtoaje

We claim that
z ≥ b1 ≥ · · · ≥ bk > s.
Indeed, we have
b1 ≥ · · · ≥ bk ,
s − ak
bk − s = > 0,
n−1

(n − 1)b1 = ns − a1 = (a2 + · · · + ak ) + ak+1 + · · · + an ≤ (k − 1)s + ak+1 + · · · + an

= (k − 1)s + (n − k)z ≤ (n − 1)z.

By hypothesis, we have
f (a1 ) + (n − 1) f (b1 ) ≥ n f (s),
···
f (ak ) + (n − 1) f (bk ) ≥ n f (s),
hence
f (a1 ) + · · · + f (ak ) + (n − 1)[ f (b1 ) + · · · + f (bk )] ≥ kn f (s).
Consequently, it suffices to show that

kn f (s) − (n − 1)[ f (b1 ) + · · · + f (bk )] + (n − k) f (z) ≥ n f (s),

which is equivalent to

n−k
p f (z) + (k − p) f (s) ≥ f (b1 ) + · · · + f (bk ), p= ≤ 1.
n−1
By Jensen’s inequality, we have

p f (z) + (1 − p) f (s) ≥ f (w), w = pz + (1 − p)s.

Thus, we only need to show that

f (w) + (k − 1) f (s) ≥ f (b1 ) + · · · + f (bk ).

Since the decreasingly ordered vector A~ = (w, s, . . . , s) majorizes the decreasingly or-
~ = (b1 , b2 , . . . , bk ), this inequality follows from Karamata’s inequality for
dered vector B
convex functions.
The proof for the left convexity is similar.

Remark 1. Let us denote

f (u) − f (s) g(x) − g( y)
g(u) = , h(x, y) = .
u−s x−y
Half Convex Function Method 3

In many applications, it is useful to replace the hypothesis f (x) + (n − 1) f ( y) ≥ n f (s)

in Half Convex Function Theorem (HCF-Theorem) by the equivalent condition
h(x, y) ≥ 0 for all x, y ∈ I such that x + (n − 1) y = ns.

This equivalence is true since

f (x) + (n − 1) f ( y) − n f (s) = [ f (x) − f (s)] + (n − 1)[ f ( y) − f (s)]

= (x − s)g(x) + (n − 1)( y − s)g( y)
n−1
= (x − y)[g(x) − g( y)]
n
n−1
= (x − y)2 h(x, y).
n
Remark 2. Assume that f is differentiable on I, and let

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y
Then, the desired inequality of Jensen’s type in HCF-Theorem holds true by replacing
the hypothesis
f (x) + (n − 1) f ( y) ≥ n f (s)
with the more restrictive condition
H(x, y) ≥ 0 for all x, y ∈ I such that x + (n − 1) y = ns.

To prove this claim, we will show that the new condition implies f (x)+(n−1) f ( y) ≥
n f (s) for all x, y ∈ I such that x + (n − 1) y = ns. Write this inequality as f1 (x) ≥ n f (s),
where  ns − x 
f1 (x) = f (x) + (n − 1) f ( y) = f (x) + (n − 1) f .
n−1
From
 ns − x  n
f10 (x) = f 0 (x) − f 0 = f 0 (x) − f 0 ( y) = (x − s)H(x, y),
n−1 n−1
it follows that f1 is decreasing for x ≤ s and increasing for x ≥ s; therefore,

f1 (x) ≥ f1 (s) = n f (s).

Remark 3. The inequality in HCF-Theorem becomes an equality for

a1 = a2 = · · · = an = s.

If there exist x, y ∈ I such that x 6= y, x + (n − 1) y = ns and f (x) + (n − 1) f ( y) = n f (s)

(which is equivalent to h(x, y) = 0), then the equality holds again for a1 = x and
a2 = · · · = an = y (or any cyclic permutation).
4 Vasile Cîrtoaje

Remark 4. HCF-Theorem is also valid in the case when I = [a, b] \ {u0 } or I = (a, b) \
{u0 }, where a, b, u0 are real numbers such that a < u0 < b. Clearly, two cases are
possible:
(1) u0 < s - when f is right convex, i.e. convex on Iu≥s ;
(2) u0 > s - when f is left convex, i.e. convex on Iu≤s .
Remark 5. We can see that in the proof of HCF-Theorem for the right convexity (when
HCF-Theorem is called RHCF-Theorem), the hypothesis

f (x) + (n − 1) f ( y) ≥ n f (s)

is necessary to get the inequalities

f (ai ) + (n − 1) f (bi ) ≥ n f (s), i = 1, 2, · · · , k.

Since ai < s for i = 1, 2, · · · , k, we may consider that x ≤ s ≤ y in RHCF-Theorem.

Similarly, we may consider x ≥ s ≥ y in HCF-Theorem for the left convexity (when
HCF-Theorem is called LHCF-Theorem).

The following theorem is also useful to prove some symmetric inequalities.

Left Convex-Right Concave Function Theorem (Vasile Cirtoaje, 2004). Let a < c be
real numbers, let f be a continuous function on I = [a, ∞), strictly convex on [a, c] and
strictly concave on [c, ∞), and let

E(a1 , a2 , . . . , an ) = f (a1 ) + f (a2 ) + · · · + f (an ).

If a1 , a2 , . . . , an ∈ I such that

a1 + a2 + · · · + an = S = const ant,

then
(a) E is minimum for a1 = a2 = · · · = an−1 ≤ an ;
(b) E is maximum for either a1 = a or a < a1 ≤ a2 = · · · = an .

Proof. Without loss of generality, assume that a1 ≤ a2 ≤ . . . ≤ an . Since E(a1 , a2 , . . . , an )

is a continuous function on the compact set

Λ = {(a1 , a2 , . . . , an ) : a1 + a2 + · · · + an = S, a1 , a2 , . . . , an ∈ I},

E attains its minimum and maximum values.

(a) For the sake of contradiction, suppose that E is minimum at a point (b1 , b2 , . . . , bn )
with b1 ≤ b2 ≤ . . . ≤ bn and b1 < bn−1 . For bn−1 ≤ c, by Jensen’s inequality for strictly
convex functions, we have
b1 + bn−1
 ‹
f (b1 ) + f (bn−1 ) > 2 f ,
2
Half Convex Function Method 5

while for bn−1 > c, by Karamata’s inequality for strictly concave functions, we have

f (bn−1 ) + f (bn ) > f (c) + f (bn−1 + bn − c).

The both results contradict the assumption that E is minimum at (b1 , b2 , . . . , bn ).

(b) For the sake of contradiction, suppose that E is maximum at a point (b1 , b2 , . . . , bn )
with a < b1 ≤ b2 ≤ . . . ≤ bn and b2 < bn . There are three cases to consider.
Case 1: b2 ≥ c. By Jensen’s inequality for strictly concave functions, we have

b2 + bn
 ‹
f (b2 ) + f (bn ) < 2 f .
2

Case 2: b2 < c and b1 + b2 −a ≤ c. By Karamata’s inequality for strictly convex functions,

we have
f (b1 ) + f (b2 ) < f (a) + f (b1 + b2 − a).

Case 3: b2 < c and b1 + b2 −c ≥ a. By Karamata’s inequality for strictly convex functions,

we have
f (b1 ) + f (b2 ) < f (b1 + b2 − c) + f (c).
Clearly, the result of each case contradicts the assumption that E is msximum at (b1 , b2 , . . . , bn ).

Remark 6. The part (a) in Left Convex-Right Concave Function Theorem (LCRCF-
Theorem) is also true in the case where I = (a, ∞) and lim x→a f (x) = ∞.
6 Vasile Cîrtoaje
Half Convex Function Method 7

1.2 Applications

1.1. If a, b, c are real numbers such that a + b + c = 3, then

3(a4 + b4 + c 4 ) + a2 + b2 + c 2 + 6 ≥ 6(a3 + b3 + c 3 ).

1 − 2n
1.2. If a1 , a2 , . . . , an ≥ such that a1 + a2 + · · · + an = n, then
n−2
a13 + a23 + · · · + an3 ≥ n.

−n
1.3. If a1 , a2 , . . . , an ≥ such that a1 + a2 + · · · + an = n, then
n−2
a13 + a23 + · · · + an3 ≥ a12 + a22 + · · · + an2 .

1.4. If a1 , a2 , . . . , an are real numbers such that a1 + a2 + · · · + an = n, then

(n2 − 3n + 3)(a14 + a24 + · · · + an4 − n) ≥ 2(n2 − n + 1)(a12 + a22 + · · · + an2 − n).

1.5. If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

(n2 + n + 1)(a13 + a23 + · · · + an3 − n) ≥ (n + 1)(a14 + a24 + · · · + an4 − n).

1.6. If a, b, c are real numbers such that a + b + c = 3, then

p
(a) a4 + b4 + c 4 − 3 + 2(7 + 3 7)(a3 + b3 + c 3 − 3) ≥ 0;
p
(b) a4 + b4 + c 4 − 3 + 2(7 − 3 7)(a3 + b3 + c 3 − 3) ≥ 0.

1.7. Let k ≥ 3 and n ≥ 3 be integer numbers such that k ≤ n + 1. If a1 , a2 , . . . , an are

nonnegative real numbers such that a1 + a2 + · · · + an = n, then

a1k + a2k + · · · + ank − n n k−1

• ˜
≥ (n − 1) −1 .
a12 + a22 + · · · + an2 − n n−1
8 Vasile Cîrtoaje

1.8. Let k ≥ 3 and n ≥ 3 be integer numbers. If a1 , a2 , . . . , an are nonnegative real

numbers such that a1 + a2 + · · · + an = n, then

a1k + a2k + · · · + ank − n nk−1 − 1

≤ .
a12 + a22 + · · · + an2 − n n−1

1.9. If a1 , a2 , . . . , an are positive real numbers such that a1 + a2 + · · · + an = n, then

1 1 1
 ‹
2
n + + ··· + − n ≥ 4(n − 1)(a12 + a22 + · · · + an2 − n).
a1 a2 an

1.10. If a1 , a2 , . . . , a8 are positive real numbers such that a1 + a2 + · · · + a8 = n, then

1 1 1
+ + ··· + ≥ a12 + a22 + · · · + a82 .
a12 a22 a82

1 1 1
1.11. If a1 , a2 , . . . , an are positive real numbers such that + + ··· + = n, then
a1 a2 an
 p 
n−1
a12 + a22 + · · · + an2 −n≥2 1+ (a1 + a2 + · · · + an ).
n

1.12. If a, b, c are nonnegative real numbers, no two of which are zero, then

1 1 1 2 1 1 1
 ‹
+ + ≤ + + .
3a + b + c 3b + c + a 3c + a + b 5 b+c c+a a+b

p
1.13. If a, b, c, d ≥ 3 − 7 such that a + b + c + d = 4, then
1 1 1 1 4
+ + + ≥ .
2+a 2 2+ b 2 2+c 2 2+d 2 3

1.14. If a1 , a2 , . . . , an ∈ [0, n − 2] such that a1 + a2 + · · · + an = n, then

1 1 1 n
+ + ≤ .
n + a12 n + a22 n + an
2 n+1
Half Convex Function Method 9

1.15. If a, b, c are nonnegative real numbers such that a + b + c = 3, then

3−a 3− b 3−c 3
+ + ≥ .
9+a 2 9+ b 2 9+c 2 5

1.16. If a, b, c are nonnegative real numbers such that a + b + c = 3, then

1 1 1 3
+ + ≥ .
5+a+a 2 5+ b+ b 2 5+c+c 2 7

1.17. If a, b, c, d are nonnegative real numbers such that a + b + c + d = 4, then

1 1 1 1 1
+ + + ≤ .
10 + a + a 2 10 + b + b 2 10 + c + c 2 10 + d + d 2 3

1.18. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

1
k ≥ 1 − , then
n
1 1 1 n
+ + ≥ .
1 + ka1 1 + ka2 1 + kan
2 2 2 1+k

1.19. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n−1
0<k≤ 2 , then
n −n+1
1 1 1 n
+ + ≤ .
1 + ka12 1 + ka22 1 + kan2 1+k

1.20. Let a1 , a2 , . . . , an be nonnegative numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
4(n − 1)
a1 (a1 − 1) a2 (a2 − 1) an (an − 1)
+ + ··· + ≥ 0.
a12 +k a22 +k an2 + k

1.21. If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n,

then
1 − a1 1 − a2 1 − an
+ + ··· + ≤ 0.
(n − 2a1 )2 (n − 2a2 )2 (n − 2an )2
10 Vasile Cîrtoaje

1.22. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n
k ≥1+ p , then
n−1

a12 − 1 a22 − 1 an2 − 1

+ + ··· + ≥ 0.
(a1 + k)2 (a2 + k)2 (an + k)2

, a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

1.23. Let a1s
2n − 1
0< k ≤1+ , then
n−1

a12 − 1 a22 − 1 an2 − 1

+ + ··· + ≤ 0.
(a1 + k)2 (a2 + k)2 (an + k)2

1.24. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

(n − 1)(2n − 1)
k≥ , then
n2
1 1 1 n
+ + ··· + ≥ .
1 + ka13 1 + ka23 1 + kan
3 1+k

1.25. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n−1
0<k≤ 2 , then
n − 2n + 2
1 1 1 n
+ + ··· + ≤ .
1 + ka13 1 + ka23 1 + kan3 1+k

1.26. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
n−1
v v v
t a1 t a1 t a1 n
+ + ··· + ≤p .
k − a1 k − a1 k − a1 k−1

1.27. If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n,

then
2 2 2
n−a1 + n−a2 + · · · + n−an ≥ 1.
Half Convex Function Method 11

1.28. If a, b, c, d, e are nonnegative real numbers such that a + b + c + d + e = 5, then

(a2 + 1)(b2 + 1)(c 2 + 1)(d 2 + 1)(e2 + 1) ≥ (a + 1)(b + 1)(c + 1)(d + 1)(e + 1).

1.29. If a1 , a2 , . . . , a10 are nonnegative real numbers such that a1 + a2 + · · · + a10 = 10,
then
(1 − a1 + a12 )(1 − a2 + a22 ) · · · (1 − a10 + a10
2
) ≥ 1.

1.30. If a1 , a2 , . . . , an (n ≥ 3) are positive real numbers such that a1 + a2 + · · · + an = 1,

then
1 n
     
1 1 1 p
‹
p p p
p − a1 p − a2 · · · p − a n ≥ n − p .
a1 a2 an n

1.31. Let a1 , a2 , . . . , an be positive real numbers such that a1 + a2 + · · · + an = n. If

 p 2
2 n−1
k ≤ 1+ ,
n

then
1 1 1
 ‹ ‹  ‹
ka1 + ka2 + · · · kan + ≥ (k + 1)n .
a1 a2 an

1.32. If a, b, c, d are nonzero real numbers such that

−1
a, b, c, d ≥ , a + b + c + d = 4,
2
then
1 1 1 1 1 1 1 1
 ‹
3 2 + 2 + 2 + 2 + + + + ≥ 16.
a b c d a b c d

1.33. If a1 , a2 , . . . , an are nonnegative real numbers such that a12 + a22 + · · · + an2 = n,
then s
n
a13 + a23 + · · · + an3 − n + (a1 + a2 + · · · + an − n) ≥ 0.
n−1
12 Vasile Cîrtoaje

1.34. If a, b, c, d, e are nonnegative real numbers such that a2 + b2 + c 2 + d 2 + e2 = 5,

then
1 1 1 1 1
+ + + + ≤ 1.
7 − 2a 7 − 2b 7 − 2c 7 − 2d 7 − 2e

s
n
1.35. If 0 ≤ a1 , a2 , . . . , an < k such that a12 +a22 +· · ·+an2 = n, where 1 < k ≤ 1+ ,
n−1
then
1 1 1 n
+ + ··· + ≥ .
k − a1 k − a2 k − an k−1

1.36. If a, b, c are nonnegative real numbers, no two of which are zero, then
v v v
t 48a t 48b t 48c
1+ + 1+ + 1+ ≥ 15.
b+c c+a a+b

1.37. If a, b, c are nonnegative real numbers, then

v v v
t 3a2 t 3b2 t 3c 2
+ + ≤ 1.
7a2 + 5(b + c)2 7b2 + 5(c + a)2 7c 2 + 5(a + b)2

1.38. If a, b, c are nonnegative real numbers, then

v v v
t a2 t b2 t c2
+ + ≥ 1.
a2 + 2(b + c)2 b2 + 2(c + a)2 c 2 + 2(a + b)2

1.39. Let a, b, c be nonnegative real numbers, no two of which are zero. If

ln 3
k ≥ k0 , k0 = − 1 ≈ 0.585,
ln 2
then ‹k ‹k ‹k
2a 2b 2c
  
+ + ≥ 3.
b+c c+a a+b

p
1.40. If a, b, c ∈ [1, 7 + 4 3], then
v v v
t 2a t 2b t 2c
+ + ≥ 3.
b+c c+a a+b
Half Convex Function Method 13

1.41. Let a, b, c be nonnegative real numbers such that a + b + c = 3. If

ln 2
0 < k ≤ k0 , k0 = ≈ 1.71,
ln 3 − ln 2
then
a k (b + c) + b k (c + a) + c k (a + b) ≤ 6.

1.42. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
4(n − 1)
(a12 + k)(a22 + k) · · · (an2 + k) ≥ (1 + k)n .

1.43. Let a, b, c be nonnegative real numbers such a + b + c = 3. If k ≥ k0 , where

p
6−2 p p
k0 = p p = (2 + 2)(2 + 3) ≈ 12.74 ,
6− 2−1
then ‚v v Œ
p p p ta + b tb+c s
c+a
a+ b+ c−3≥ k + + −3 .
2 2 2

1.44. Let a, b, c be nonnegative real numbers such a + b + c = 3. If k ≤ k1 , where

p p p
k1 = ( 3 − 1)( 3 + 2) ≈ 2.303 ,

then ‚v v Œ
p p p ta + b tb+c s
c+a
a+ b+ c−3≤ k + + −3 .
2 2 2

1.45. If a, b, c are positive real numbers such that a bc = 1, then

a2 + b2 + c 2 − 3 ≥ 18(a + b + c − a b − bc − ca).

1.46. If a, b, c are positive real numbers such that a bc = 1, then

p p p
a2 − a + 1 + b2 − b + 1 + c 2 − c + 1 ≥ a + b + c.
14 Vasile Cîrtoaje

1
1.47. If a, b, c, d ≥ p such that a bcd = 1, then
1+ 6
1 1 1 1 4
+ + + ≤ .
a+2 b+2 c+2 d +2 3

1.48. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 · · · an = 1, then

p 1 1 1
 ‹
2 2 2
a1 + a2 + · · · + an − n ≥ 6 3 a1 + a2 + · · · + an − − − ··· − .
a1 a2 an

1.49. If a1 , a2 , . . . , an (n ≥ 4) are positive real numbers such that a1 a2 · · · an = 1, then

(n − 1)(a12 + a22 + · · · + an2 ) + n(n + 3) ≥ (2n + 2)(a1 + a2 + · · · + an ).

1.50. Let a1 , a2 , . . . , an (n ≥ 3) be positive real numbers such that a1 a2 . . . an = 1. If p

and q are nonnegative real numbers such that p + q ≥ n − 1, then

1 1 1 n
+ + ··· + ≥ .
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan
2 1+p+q

1.51. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If k ≥ n2 − 1,

then
1 1 1 n
+p + ··· + p ≥p .
1 + ka1 1 + ka2 1 + kan 1+k
p

1.52. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 . . . an = 1, then

1 1 1
+ + ··· + ≥ 1.
1 + a1 + · · · + a1n−1 1 + a2 + · · · + a2n−1 1 + an + · · · + ann−1

1.53. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If p, q ≥ 0

1
such that 0 < p + q ≤ , then
n−1
1 1 1 n
+ + ··· + ≤ .
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan
2 1+p+q
Half Convex Function Method 15

1.54. Let a1 , a2 , . . . , an (n ≥ 3) be positive real numbers such that a1 a2 . . . an = 1. If

 n 2
0<k≤ − 1,
n−1
then
1 1 1 n
+p + ··· + p ≤p .
1 + ka1 1 + ka2 1 + kan 1+k
p

1.55. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 . . . an = 1, then

1 1 1
 ‹
a1n−1 + a2n−1 + · · · + ann−1 + n(n − 2) ≥ (n − 1) + + ··· + .
a1 a2 an

1.56. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If k ≥ n, then

1 1 1
 ‹
k k k
a1 + a2 + · · · + an + kn ≥ (k + 1) + + ··· + .
a1 a2 an

1.57. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 . . . an = 1, then

1 a1 1 a2 1 an
 ‹  ‹  ‹
1− + 1− + ··· + 1 − ≤ n − 1.
n n n

1.58. If a, b, c are positive real numbers such that a bc = 1, then

1 1 1
p + p + p ≤ 1.
1 + 1 + 3a 1 + 1 + 3b 1 + 1 + 3c

1.59. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 · · · an = 1, then

1 1 1 1
+ ··· + ≥ .
1+ 1 + 4n(n − 1)a1 1 + 1 + 4n(n − 1)a2 1+ 1 + 4n(n − 1)an
p p p
2

1.60. If a, b, c are positive real numbers such that a bc = 1, then

a6 b6 c6
+ + ≥ 1.
1 + 2a5 1 + 2b5 1 + 2c 5
16 Vasile Cîrtoaje

1.61. If a, b, c are positive real numbers such that a bc = 1, then

p p p
25a2 + 144 + 25b2 + 144 + 25c 2 + 144 ≤ 5(a + b + c) + 24.

1.62. If a, b, c are positive real numbers such that a bc = 1, then

p p p
16a2 + 9 + 16b2 + 9 + 16c 2 + 9 ≥ 4(a + b + c) + 3.

1.63. If a, b, c are nonnegative real numbers such that a + b + c = 12, then

(a2 + 10)(b2 + 10)(c 2 + 10) ≥ 13310.

1.64. Let a, b, c be nonnegative real numbers. If

ln 2
k0 ≤ k ≤ 3, k0 = ≈ 1.71,
ln 3 − ln 2
then ‹k+1
a+b+c

k k k
a (b + c) + b (c + a) + c (a + b) ≤ 2 .
2

1.65. If a1 , a2 , . . . , an are positive real numbers such that a1 + a2 + · · · + an = n, then

1 1 1
 ‹
(n + 1)2 + + ··· + ≥ 4(n + 2)(a12 + a22 + · · · + an2 ) + n(n2 − 3n + 6).
a1 a2 an
Half Convex Function Method 17

1.3 Solutions

P 1.1. If a, b, c are real numbers such that a + b + c = 3, then

3(a4 + b4 + c 4 ) + a2 + b2 + c 2 + 6 ≥ 6(a3 + b3 + c 3 ).

(Vasile Cirtoaje, 2006)

Solution. Write the inequality as

a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where
f (u) = 3u4 − 6u3 + u2 , u ∈ R.
From
f 00 (u) = 2(18u2 − 18u + 1),
it follows that f 00 (u) > 0 for u ≥ 1, hence f is convex for u ≥ 1. By HCF-Theorem, it
suffices to show that f (x) + 2 f ( y) ≥ 3 f (1) for all real x, y such that x + 2 y = 3. Using
Remark 1, we only need to show that h(x, y) ≥ 0, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have

g(u) = 3(u3 + u2 + u + 1) − 6(u2 + u + 1) + u + 1 = 3u3 − 3u2 − 2u − 2,

h(x, y) = 3(x 2 + x y + y 2 ) − 3(x + y) − 2 = (3 y − 4)2 ≥ 0.

The equality holds for a = b = c = 0, and also for a = 1/3 and b = c = 4/3 (or any
cyclic permutation).
Remark. Similarly, we can prove the following generalization:
• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then
n−1
(a12 − a1 )2 + (a22 − a2 )2 + · · · + (an2 − an )2 ≥ (a2 + a22 + · · · + an2 − n),
n2 − 3n + 3 1
1
with equality for a1 = a2 = · · · = an = 1, and also for a1 = and a2 = a3 =
n2 − 3n + 3
n−2
· · · = an = 1 + (or any cyclic permutation).
n2 − 3n + 3
18 Vasile Cîrtoaje

1 − 2n
P 1.2. If a1 , a2 , . . . , an ≥ such that a1 + a2 + · · · + an = n, then
n−2

a13 + a23 + · · · + an3 ≥ n.

(Vasile Cirtoaje, 2000)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1 − 2n
f (u) = u3 , u≥ .
n−2
From f 00 (u) = 6u, it follows that f is convex for u ≥ 1. According to HCF-Theorem
1 − 2n
and Remark 1, it suffices to show that h(x, y) ≥ 0 for all x, y ≥ such that
n−2
x + (n − 1) y = n. We have

f (u) − f (1)
g(u) = = u2 + u + 1,
u−1

g(x) − g( y) (n − 2)x + 2n − 1
h(x, y) = = x + y +1= ≥ 0.
x−y n−1
The equality holds for a1 = a2 = · · · = an = 1, and also for

1 − 2n n+1
a1 = , a2 = · · · = a n =
n−2 n−2
(or any cyclic permutation).

−n
P 1.3. If a1 , a2 , . . . , an ≥ such that a1 + a2 + · · · + an = n, then
n−2

a13 + a23 + · · · + an3 ≥ a12 + a22 + · · · + an2 .

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
−n
f (u) = u3 − u2 , u≥ .
n−2
Half Convex Function Method 19

From f 00 (u) = 6u − 2, it follows that f is convex for u ≥ 1. According to HCF-Theorem

1 − 2n
and Remark 1, it suffices to show that h(x, y) ≥ 0 for all x, y ≥ such that
n−2
x + (n − 1) y = n. We have
f (u) − f (1)
g(u) = = u2 ,
u−1
g(x) − g( y) (n − 2)x + n
h(x, y) = =x+y= ≥ 0.
x−y n−1
The equality holds for a1 = a2 = · · · = an = 1, and also for
−n n
a1 = , a2 = · · · = an =
n−2 n−2
(or any cyclic permutation).

P 1.4. If a1 , a2 , . . . , an are real numbers such that a1 + a2 + · · · + an = n, then

(n2 − 3n + 3)(a14 + a24 + · · · + an4 − n) ≥ 2(n2 − n + 1)(a12 + a22 + · · · + an2 − n).
(Vasile Cirtoaje, 2009)
Solution. Write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
f (u) = (n2 − 3n + 3)u4 − 2(n2 − n + 1)u2 , u ∈ R.
For u ≥ 1, we have
1 00
f (u) = 3(n2 − 3n + 3)u2 − (n2 − n + 1) ≥ 3(n2 − 3n + 3) − (n2 − n + 1) = 2(n − 2)2 ≥ 0.
4
By HCF-Theorem and Remark 1, it suffices to show that h(x, y) ≥ 0 for x, y ∈ R such
that x + (n − 1) y = n, where
g(x) − g( y) f (u) − f (1)
h(x, y) = , g(u) = .
x−y u−1
We have
g(u) = (n2 − 3n + 3)(u3 + u2 + u + 1) − 2(n2 − n + 1)(u + 1)
and
h(x, y) = (n2 −3n+3)(x 2 +x y+ y 2 +x+ y+1)−2(n2 −n+1) = [(n2 −3n+3) y−n2 +n+1]2 ≥ 0.
2
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = −1 + and
n2 − 3n + 3
2n − 4
a2 = a3 = · · · = an = 1 + (or any cyclic permutation).
n2 − 3n + 3
20 Vasile Cîrtoaje

P 1.5. If a1 , a2 , · · · , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

(n2 + n + 1)(a13 + a23 + · · · + an3 − n) ≥ (n + 1)(a14 + a24 + · · · + an4 − n).

(Vasile Cirtoaje, 2009)

Solution. Write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
f (u) = (n2 + n + 1)u3 − (n + 1)u4 , u ∈ [0, n].
For u ∈ [0, 1], we have

f 00 (u) = 6u[n2 + n + 1 − 2(n + 1)u] ≥ 6u[n2 + n + 1 − 2(n + 1)] = 6(n2 − n − 1)u ≥ 0.

By HCF-Theorem and Remark 1, it suffices to show that h(x, y) ≥ 0 for x, y ≥ 0 such

that x + (n − 1) y = n, where
g(x) − g( y) f (u) − f (1)
h(x, y) = , g(u) = .
x−y u−1
We have

g(u) = (n2 + n + 1)(u2 + u + 1) − (n + 1)(u3 + u2 + u + 1) = −(n + 1)u3 + n2 (u2 + u + 1)

and

h(x, y) = −(n + 1)(x 2 + x y + y 2 ) + n2 (x + y + 1)

= y[−(n + 1)(n2 − 3n − 3) y + n(n2 + n − 3)]
h n i
≥ y −(n + 1)(n2 − 3n − 3) + n(n2 + n − 3)
n−1
2n (n + 2) y
2
= ≥ 0.
n−1
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = n and a2 = a3 = · · · =
an = 0 (or any cyclic permutation).

P 1.6. If a, b, c are real numbers such that a + b + c = 3, then

p
(a) a4 + b4 + c 4 − 3 + 2(7 + 3 7)(a3 + b3 + c 3 − 3) ≥ 0;
p
(b) a4 + b4 + c 4 − 3 + 2(7 − 3 7)(a3 + b3 + c 3 − 3) ≥ 0.

(Vasile Cirtoaje, 2009)

Half Convex Function Method 21

Solution. Setting p
p = 2(7 ± 3 7),
we can write the desired inequalities as

a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where
f (u) = u4 + pu3 , u ∈ R.
From
f 00 (u) = 6u(2u2 + p),
it follows that f 00 (u) > 0 for u ≥ 1, hence f is convex for u ≥ 1. By HCF-Theorem, it
suffices to show that f (x) + 2 f ( y) ≥ 3 f (1) for all real x, y such that x + 2 y = 3. Using
Remark 1, we only need to show that h(x, y) ≥ 0, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have

g(u) = u3 + u2 + u + 1 + p(u2 + u + 1) + u + 1 = u3 + (p + 1)(u2 + u + 1),

h(x, y) = x 2 + x y + y 2 ) + (p + 1)(x + y + 1) = 3 y 2 − (10 + p) y + 13 + 4p

10 + p 2
 ‹
=3 y− ≥ 0.
6

The equality holds for a = b = c = 1, and also for a = −(1+ p)/3 and b = c = (10+ p)/6
(or any cyclic permutation).
p
(a) Since
p p = 2(7 + 3 7),p the equality holds for a = b = c = 1, and also for
a = −5 − 2 7 and b = c = 4 + 7 (or any cyclic permutation).
p
(b) Since
p p = 2(7 − 3 p the equality holds for a = b = c = 1, and also for
7),
a = −5 + 2 7 and b = c = 4 − 7 (or any cyclic permutation).
Remark. Similarly, we can prove the following generalization:
• If a1 , a2 , . . . , an are real numbers such that a1 + a2 + · · · + an = n, then

a14 + a24 + · · · + an4 − n + p(a12 + a22 + · · · + an2 − n) ≥ 0,

where p
2(n2 − n + 1) ± 2 3(n2 − n + 1)(n2 − 3n + 3)
p= .
(n − 2)2
22 Vasile Cîrtoaje

The equality holds for a1 = a2 = · · · = an = 1, and also for

−2(n2 − 3n + 1) − (n − 1)(n − 2)p 2(n2 − n − 1) + (n − 2)p

a1 = , a2 = a3 = · · · = a n =
2(n2 − 3n + 3) 2(n2 − 3n + 3)
(or any cyclic permutation).

P 1.7. Let k ≥ 3 and n ≥ 3 be integer numbers such that k ≤ n + 1. If a1 , a2 , . . . , an are

nonnegative real numbers such that a1 + a2 + · · · + an = n, then

a1k + a2k + · · · + ank − n n k−1

• ˜
≥ (n − 1) −1 .
a12 + a22 + · · · + an2 − n n−1

(Vasile Cirtoaje, 2012)

Solution. Denote
n k−1 n k−2  n k−3
• ˜ 
m = (n − 1) −1 = + + · · · + 1,
n−1 n−1 n−1
and write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
f (u) = uk − mu2 , u ∈ [0, n].
We will show that f (u) is convex for u ∈ [1, n]. Since

f 00 (u) = k(k − 1)uk−2 − 2m ≥ k(k − 1) − 2m,

we need to show that

k(k − 1)  n k−2  n k−3
≥ + + · · · + 1.
2 n−1 n−1
Since n ≥ k − 1, this inequality is true if

k(k − 1) k − 1 k−2 k − 1 k−3

 ‹  ‹
≥ + + · · · + 1.
2 k−2 k−2
By Bernoulli’s inequality, we have
‹j
k−1 1 1 k−1

=
j ≤ j
= , 0 ≤ j ≤ k − 2.
k−2 1− 1 1− k− j−1
k−1 k−1
Half Convex Function Method 23

Therefore, it suffices to show that

k(k − 1) 1 1
 ‹
≥ (k − 1) 1 + + · · · + .
2 2 k−1

This is true if
k 1 1
≥ 1 + + ··· + ,
2 2 k−1
which can be easily proved by induction. According to HCF-Theorem and Remark 1, we
only need to show that h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have

(uk − 1) − m(u2 − 1)
g(u) = = (uk−1 + uk−2 + · · · + 1) − m(u + 1),
u−1
 k−1
− y k−1 x k−2 − y k−1

x
h(x, y) = + + ··· + 1 − m
x−y x−y
 2
x − y2
 k−1
− y k−1  n k−2
  k−2
− y k−2  n k−3
 
x x n
= − + − +· · ·+ − .
x−y n−1 x−y n−1 x−y n−1
It suffices to show that
x j+1 − y j+1  n  j
≥
x−y n−1
n i
h
for x =
6 y and j = 1, 2, · · · , k − 2. This is true if f j ( y) ≥ 0 for y ∈ 0, , where
n−1
 n j
j
f j ( y) = x + x j−1
y + ··· + x y j−1
+y −j
, x = n − (n − 1) y.
n−1

Since x 0 = −(n − 1) and n − 1 ≥ k − 2 ≥ j, we get

f j0 ( y) = −(n − 1)[ j x j−1 + ( j − 1)x j−2 y + · · · + y j−1 ] + x j−1 + 2x j−2 y + · · · + j y j−1

≤ − j[ j x j−1 + ( j − 1)x j−2 y + · · · + y j−1 ] + x j−1 + 2x j−2 y + · · · + j y j−1

= −( j · j − 1)x j−1 − [ j · ( j − 1) − 2]x j−2 y − · · · − ( j · 2 − j + 1)x y j−2 ≤ 0.

n
Therefore, f j ( y) is decreasing, hence f j ( y) is minimal for y = , when x = 0. Thus,
n−1
 n 
f j ( y) ≥ f j = 0.
n−1
24 Vasile Cîrtoaje

n
This completes the proof. The equality holds for a1 = 0 and a2 = a3 = · · · = an =
n−1
(or any cyclic permutation).
Remark. For k = 3 and k = 4, we get the following statements (Vasile Cirtoaje, 2002):
• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

(n − 1)(a13 + a23 + · · · + an3 − n) ≥ (2n − 1)(a12 + a22 + · · · + an2 − n),

with equality for a1 = a2 = · · · = an = 1, and also for a1 = 0 and a2 = a3 = · · · = an =

n
(or any cyclic permutation).
n−1
• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

(n − 1)2 (a14 + a24 + · · · + an4 − n) ≥ (3n2 − 3n + 1)(a12 + a22 + · · · + an2 − n),

with equality for a1 = a2 = · · · = an = 1, and also for a1 = 0 and a2 = a3 = · · · = an =

n
(or any cyclic permutation).
n−1

P 1.8. Let k ≥ 3 and n ≥ 3 be integer numbers. If a1 , a2 , . . . , an are nonnegative real

numbers such that a1 + a2 + · · · + an = n, then

a1k + a2k + · · · + ank − n nk−1 − 1

≤ .
a12 + a22 + · · · + an2 − n n−1

(Vasile Cirtoaje, 2012)

Solution. Denote
nk−1 − 1
m= = nk−2 + nk−3 + · · · + 1,
n−1
and write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
f (u) = mu2 − uk , u ∈ [0, n].
We will show that f (u) is convex for u ∈ [0, 1]. Since

f 00 (u) = 2m − k(k − 1)uk−2 ≥ 2m − k(k − 1),

we need to show that

k(k − 1)
nk−2 + nk−3 + · · · + 1 ≥ .
2
Half Convex Function Method 25

This is true if
k(k − 1)
3k−2 + 3k−3 + · · · + 1 ≥ .
2
By Bernoulli’s inequality, we have

3k−2 + 3k−3 + · · · + 1 ≥ [1 + 2(k − 2)] + [1 + 2(k − 3)] + · · · + [1 + 2 · 0]

k(k − 1)
= (k − 1) + (k − 2)(k − 1) = (k − 1)2 > .
2
According to HCF-Theorem and Remark 1, we only need to show that h(x, y) ≥ 0 for
x, y ≥ 0 such that x + (n − 1) y = n, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have

m(u2 − 1) − (uk − 1)
g(u) = = m(u + 1) − (uk−1 + uk−2 + · · · + 1),
u−1

x k−1 − y k−1 x k−2 − y k−1

h(x, y) = m − − − ··· − 1
x−y x−y
x k−1 − y k−1 x k−2 − y k−2 x2 − y2
     
= n k−2
− + n k−3
− + ··· + n − .
x−y x−y x−y
It suffices to show that
x j+1 − y j+1
nj ≥
x−y
for x 6= y and j = 1, 2, · · · , k − 2. We will show that

x j+1 − y j+1
n j ≥ (x + y) j ≥ .
x−y

The left inequality is true since

n − (x + y) = x + (n − 1) y − (x + y) = (n − 2) y ≥ 0.

The right inequality is also true since

 ‹  ‹
j j−1 j
j
(x + y) = x + j
x y + ··· + x y j−1 + y j
1 j−1

and
x j+1 − y j+1
= x j + x j−1 y + · · · + x y j−1 + y j .
x−y
26 Vasile Cîrtoaje

The equality holds for a1 = n and a2 = a3 = · · · = an = 0 (or any cyclic permutation).

Remark. For k = 3 and k = 4, we get the following statements (Vasile Cirtoaje, 2002):
• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

a13 + a23 + · · · + an3 − n ≤ (n + 1)(a12 + a22 + · · · + an2 − n),

with equality for a1 = a2 = · · · = an = 1, and also for a1 = n and a2 = a3 = · · · = an = 0

(or any cyclic permutation).

• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n, then

a14 + a24 + · · · + an4 − n ≤ (n2 + n + 1)(a12 + a22 + · · · + an2 − n),

with equality for a1 = a2 = · · · = an = 1, and also for a1 = n and a2 = a3 = · · · = an = 0

(or any cyclic permutation).

P 1.9. If a1 , a2 , . . . , an are positive real numbers such that a1 + a2 + · · · + an = n, then

1 1 1
 ‹
2
n + + ··· + − n ≥ 4(n − 1)(a12 + a22 + · · · + an2 − n).
a1 a2 an
(Vasile Cirtoaje, 2004)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
n2
f (u) = − 4(n − 1)u2 , u ∈ (0, n).
u
For u ∈ (0, 1], we have

2n2
f 00 (u) = − 8(n − 1) ≥ 2n2 − 8(n − 1) = 2(n − 2)2 ≥ 0.
u3
Thus, f is convex on (0, 1)]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y > 0 such that x + (n − 1) y = n, where
g(x) − g( y) f (u) − f (1)
h(x, y) = , g(u) = .
x−y u−1
We have
−n2
g(u) = − 4(n − 1)(u + 1)
u
Half Convex Function Method 27

and
n2 [n − (2n − 2) y]2
h(x, y) = − 4(n − 1) = ≥ 0.
xy xy
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = n/2 and a2 = a3 =
· · · = an = n/(2n − 2) (or any cyclic permutation).

P 1.10. If a1 , a2 , . . . , a8 are positive real numbers such that a1 + a2 + · · · + a8 = n, then

1 1 1
+ + ··· + ≥ a12 + a22 + · · · + a82 .
a12 a22 a82

(Vasile Cirtoaje, 2007)

Solution. Write the inequality as

a1 + a2 + · · · + a8
f (a1 ) + f (a2 ) + · · · + f (a8 ) ≥ 8 f (s), s= = 1,
8
where
1
f (u) = − u2 , u ∈ (0, n).
u2
For u ∈ (0, 1], we have
6
f 00 (u) =
− 2 ≥ 6 − 2 > 0.
u4
Thus, f is convex on (0, 1)]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y > 0 such that x + 7 y = 8, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have
1 1
g(u) = −u − 1 − − 2
u u
and
1 x+y
h(x, y) = −1 + + 2 2.
xy x y
From 8 = x + 7 y ≥ 2
p
7x y, we get x y ≤ 16/7. Therefore,

1 7(x + y) 112 y 2 − 170 y + 72

h(x, y) ≥ −1 + + =
xy 16x y 16x y
112 y − 176 y + 72 14 y − 22 y + 9
2 2
> = > 0.
16x y 2x y
28 Vasile Cîrtoaje

The equality holds for a1 = a2 = · · · = a8 = 1.

Remark. Similarly, we can prove the following generalization.
• If a1 , a2 , . . . , an (n ≥ 4) are positive real numbers such that a1 + a2 + · · · + an = n,
then
1 1 1 8 2
a1 + a22 + · · · + an2 .


2
+ 2 + ··· + 2 + 8 − n ≥
a1 a2 an n

1 1 1
P 1.11. If a1 , a2 , . . . , an are positive real numbers such that + + ··· + = n, then
a1 a2 an
 p 
n−1
a12 + a22 + · · · + an2 −n≥2 1+ (a1 + a2 + · · · + an ).
n

(Vasile Cirtoaje, 2006)

Solution. Replacing each ai by 1/ai , we need to prove that

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where  p 
1 n−1 1
f (u) = 2 − 2 1 + , u ∈ (0, n).
u n u
For u ∈ (0, 1], we have
p p
p
€ Š € Š
6 − 4 1 + n−1
n u 6 − 4 1+ n−1
n 2( n − 1 − 1)2
f 00 (u) = ≥ = ≥ 0.
u4 u4 nu4
Thus, f is convex on (0, 1)]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y > 0 such that x + (n − 1) y = n, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have  p 
−1 2 n−1 1
g(u) = 2 + 1 +
u n u
and  p 
1 1 1 2 n−1
h(x, y) = + −1− .
xy x y n
Half Convex Function Method 29

We only need to show that

p
1 1 2 n−1
+ ≥1+ .
x y n
Indeed, using the Cauchy-Schwarz inequality, we get
p p p
1 1 (1 + n − 1)2 (1 + n − 1)2 2 n−1
+ ≥ = =1+ .
x y x + (n − 1) y n n
p
1+ n−1
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = and
p n
n−1+ n−1
a2 = a3 = · · · = an = (or any cyclic permutation).
n

P 1.12. If a, b, c are nonnegative real numbers, no two of which are zero, then

1 1 1 2 1 1 1
 ‹
+ + ≤ + + .
3a + b + c 3b + c + a 3c + a + b 5 b+c c+a a+b

(Vasile Cirtoaje, 2006)

Solution. Due to homogeneity, we may assume that a + b + c = 3. So, we need to show

that
a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s = = 1,
3
where
2 5
f (u) = − , u ∈ [0, 3).
3 − u 2u + 3
For u ∈ [1, 3), we have

4 40 36[2u3 + 3u2 + 9(u − 1)(3 − u)]

f 00 (u) = − = > 0;
(3 − u)3 (2u + 3)3 (3 − u)3 (2u + 3)3

therefore, f is convex on [1, 3). By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + 2 y = 3, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have
1 2
g(u) = +
3 − u 2u + 3
30 Vasile Cîrtoaje

and
1 2 9(2x + 2 y − 3)
h(x, y) = − =
(3 − x)(3 − y) (2x + 3)(2 y + 3) (3 − x)(3 − y)(2x + 3)(2 y + 3)
9x
= ≥ 0.
(3 − x)(3 − y)(2x + 3)(2 y + 3)

The equality holds for a = b = c, and also for a = 0 and b = c (or any cyclic permuta-
tion).

p
P 1.13. If a, b, c, d ≥ 3 − 7 such that a + b + c + d = 4, then

1 1 1 1 4
+ + + ≥ .
2+a 2 2+ b 2 2+c 2 2+d 2 3
(Vasile Cirtoaje, 2008)

Solution. Write the inequality as

a+b+c+d
f (a) + f (b) + f (c) + f (d) ≥ 4 f (s), s= = 1,
4
where
1 p
f (u) = , u ≥ 3 − 7.
2 + u2
For u ≥ 1, we have
3(3u2 − 2)
f 00 (u) = > 0.
(2 + u2 )3
Thus, f is convex for u ≥ 1. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + 3 y = 4. We have

f (u) − f (1) −1 − u
g(u) = =
u−1 3(2 + u2 )

and
g(x) − g( y) xy + x + y −2
h(x, y) = = ≥0
x−y 3(2 + x 2 )(2 + y 2 )
since p p
−x 2 + 6x − 2 (3 + 7 − x)(x − 3 + 7)
xy + x + y −2= = ≥ 0.
3 3
p
equality holds for a = b = c = d = 1, and also for a = 3 − 7 and b = c = d =
The p
1+ 7
(or any cyclic permutation).
3
Half Convex Function Method 31

Remark. Similarly, we can prove the following generalization.

p
• If a1 , a2 , . . . , an ≥ n − 1 − n2 − 3n + 3 such that a1 + a2 + · · · + an = n, then
1 1 1 n
+ + ··· + ≥ ,
2 + a12 2 + a22 2 + an2 3
p
with equality for a1 = a2 p= · · · = an = 1, and also for a1 = n − 1 − n2 − 3n + 3 and
1 + n2 − 3n + 3
a2 = a3 = · · · = an = (or any cyclic permutation).
n−1

P 1.14. If a1 , a2 , . . . , an ∈ [0, n − 2] such that a1 + a2 + · · · + an = n, then

1 1 1 n
+ + ≤ .
n + a12 n + a22 n + an2 n+1
(Vasile Cirtoaje, 2008)
Solution. Write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
−1
f (u) = , u ∈ [0, n − 2], n ≥ 3.
n + u2
For u ∈ [0, 1], we have
2(n − 3u2 )
f 00 (u) = ≥ 0.
(n + u2 )3
Thus, f is convex on [0, 1]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. We have
f (u) − f (1) u+1
g(u) = =
u−1 (n + 1)(n + u2 )
and
g(x) − g( y) n− x − y − xy
h(x, y) = = .
x−y (n + 1)(n + x 2 )(n + y 2 )
We need to show that
n − x − y − x y ≥ 0.
Indeed, we have
(n − x)(n − 2 − x)
n− x − y − xy = ≥ 0.
n−1
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = n − 2 and a2 = a3 =
2
· · · = an = (or any cyclic permutation).
n−1
32 Vasile Cîrtoaje

P 1.15. If a, b, c are nonnegative real numbers such that a + b + c = 3, then

3−a 3− b 3−c 3
+ + ≥ .
9+a 2 9+ b 2 9+c 2 5
(Vasile Cirtoaje, 2013)

Solution. Write the inequality as

a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where
3−u
f (u) = , u ∈ [0, 3].
9 + u2
For u ∈ [1, 3], we have

1 00 u2 (9 − u) + 27(u − 1)
f (u) = > 0.
2 (9 + u2 )3

Thus, f is convex on [1, 3]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + 2 y = 3, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have
−(6 + u)
g(u) =
5(9 + u2 )
and
x y + 6x + 6 y − 9 x(9 − x)
h(x, y) = = ≥ 0.
5(9 + x 2 )(9 + y 2 ) 10(9 + x 2 )(9 + y 2 )
The equality holds for a = b = c = 1, and also for a = 0 and b = c = 3/2 (or any cyclic
permutation).
Remark. Similarly, we can prove the following generalization.
• If a1 , a2 , . . . , an (n ≥ 3) are nonnegative real numbers such that a1 + a2 + · · · + an = n,
then
n − a1 n − a2 n − an n
+ + ··· + ≥ ,
n2 + (n2 − 3n + 1)a12 n2 + (n2 − 3n + 1)a22 n2 + (n2− 3n + 1)an
2 2n − 1

with equality for a1 = a2 = · · · = an = 1, and also for a1 = 0 and a2 = a3 = · · · = an =

n
(or any cyclic permutation).
n−1
Half Convex Function Method 33

P 1.16. If a, b, c are nonnegative real numbers such that a + b + c = 3, then

1 1 1 3
+ + ≥ .
5+a+a 2 5+ b+ b 2 5+c+c 2 7
(Vasile Cirtoaje, 2008)

Solution. Write the inequality as

a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where
1
f (u) = , u ∈ [0, 3].
5 + u + u2
For u ≥, we have
2(3u2 + 3u − 4)
f 00 (u) = > 0.
(5 + u + u2 )3
Thus, f is convex on [1,3]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + 2 y = 3. We have

f (u) − f (1) −2 − u
g(u) = =
u−1 7(5 + u + u2 )

and
g(x) − g( y) x y + 2(x + y) − 3 x(5 − x)
h(x, y) = = = ≥ 0.
x−y 7(5 + x + x )(5 + y + y ) 14(5 + x + x 2 )(5 + y + y 2 )
2 2

The equality holds for a = b = c = 1, and also for a = 0 and b = c = 3/2 (or any cyclic
permutation).
Remark. Similarly, we can prove the following generalization.
• Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If
2(2n − 1)
0<k≤ , then
n−1
1 1 1 n
+ + ··· + ≥ ,
k + a1 + a12 k + a2 + a22 k + an + an
2 k+2

2(2n − 1)
with equality for a1 = a2 = · · · = an = 1. If k = , then the equality holds also
n−1
n
for a1 = 0 and a2 = a3 = · · · = an = (or any cyclic permutation).
n−1
34 Vasile Cîrtoaje

P 1.17. If a, b, c, d are nonnegative real numbers such that a + b + c + d = 4, then

1 1 1 1 1
+ + + ≤ .
10 + a + a 2 10 + b + b 2 10 + c + c 2 10 + d + d 2 3
(Vasile Cirtoaje, 2008)

Solution. Write the inequality as

a+b+c+d
f (a) + f (b) + f (c) + f (d) ≥ 4 f (s), s= = 1,
4
where
−1
f (u) = , u ∈ [0, 4].
10 + u + u2
For u ∈ [0, 1], we have
6(3 − u − u2 )
f 00 (u) = > 0.
(10 + u + u2 )3
Thus, f is convex on [0,1]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + 3 y = 4. We have

f (u) − f (1) 2+u

g(u) = =
u−1 12(10 + u + u2 )

and
g(x) − g( y) 8 − 2(x + y) − x y
h(x, y) = = .
x−y 12(10 + x + x 2 )(10 + y + y 2 )
We need to show that
8 − 2(x + y) − x y ≥ 0.
Indeed, we have
8 − 2(x + y) − x y = 3 y 2 ≥ 0.
The equality holds for a = b = c = d = 1, and also for a = 4 and b = c = d = 0 (or any
cyclic permutation).
Remark. Similarly, we can prove the following generalization.
• Let a1 , a2 , . . . , an (n ≥ 4) be nonnegative real numbers such that a1 + a2 +· · ·+ an = n.
If k ≥ 2n + 2, then

1 1 1 n
+ + ··· + ≤ ,
k + a1 + a12 k + a2 + a22 k + an + an2 k+2

with equality for a1 = a2 = · · · = an = 1. If k = 2n + 2, then the equality holds also for

a1 = n and a2 = a3 = · · · = an = 0 (or any cyclic permutation).
Half Convex Function Method 35

P 1.18. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

1
k ≥ 1 − , then
n
1 1 1 n
+ + ≥ .
1 + ka1 1 + ka2 1 + kan
2 2 2 1+k
(Vasile Cirtoaje, 2005)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1
f (u) = , u ∈ [0, n].
1 + ku2
For u ∈ [1, n], we have
2k(3ku2 − 1)
f 00 (u) = > 0,
(1 + ku2 )3
since
1 3
 ‹
2
3ku − 1 ≥ 3k − 1 ≥ 3 1 − − 1 = 2 − > 0.
n n
Thus, f is convex on [1, n]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. We have

f (u) − f (1) −k(u + 1)

g(u) = =
u−1 (1 + k)(1 + ku2 )

and
g(x) − g( y) k2 (x + y + x y) − k
h(x, y) = = .
x−y (1 + k)(1 + k x 2 )(1 + k y 2 )
We need to show that
k(x + y + x y) − 1 ≥ 0.
Indeed, we have

1 x(2n − 2 − x)
 ‹
k(x + y + x y) − 1 ≥ 1 − (x + y + x y) − 1 = ≥ 0.
n n
1
The equality holds for a1 = a2 = · · · = an = 1. If k = 1 − , then the equality holds also
n
n
for a1 = 0 and a2 = a3 = · · · = an = (or any cyclic permutation).
n−1
36 Vasile Cîrtoaje

P 1.19. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n−1
0<k≤ 2 , then
n −n+1
1 1 1 n
+ + ≤ .
1 + ka12 1 + ka22 1 + kan
2 1+k

(Vasile Cirtoaje, 2005)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
−1
f (u) = , u ∈ [0, n].
1 + ku2
For u ∈ [0, 1], we have
2k(1 − 3ku2 )
f 00 (u) = ≥ 0,
(1 + ku2 )3
since
3(n − 1) (n − 2)2
1 − 3ku2 ≥ 1 − 3k ≥ 1 − = ≥ 0.
n2 − n + 1 n2 − n + 1
Thus, f is convex on [0, 1]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. We have

f (u) − f (1) k(u + 1)

g(u) = =
u−1 (1 + k)(1 + ku2 )
and
g(x) − g( y) k − k2 (x + y + x y)
h(x, y) = = .
x−y (1 + k)(1 + k x 2 )(1 + k y 2 )
We need to show that
1 − k(x + y + x y) ≥ 0.
Indeed, we have

n−1 (x − n + 1)2
1 − k(x + y + x y) ≥ 1 − (x + y + x y) = ≥ 0.
n2 − n + 1 n2 − n + 1
n−1
The equality holds for a1 = a2 = · · · = an = 1. If k = , then the equality holds
n2 −n+1
1
also for a1 = n − 1 and a2 = a3 = · · · = an = (or any cyclic permutation).
n−1
Half Convex Function Method 37

P 1.20. Let a1 , a2 , . . . , an be nonnegative numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
4(n − 1)
a1 (a1 − 1) a2 (a2 − 1) an (an − 1)
+ + ··· + ≥ 0.
a12 +k a22 +k an2 + k

(Vasile Cîrtoaje, 2012)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
u(u − 1)
f (u) = , u ∈ [0, n].
u2 + k
From
u2 + 2ku − k 2(k2 − u3 ) + 6ku(1 − u)
f 0 (u) = , f 00 (u) = ,
(u2 + k)2 (u2 + k)3
it follow that f is convex on [0, 1]. By HCF-Theorem and Remark 1, it suffices to show
that h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n, where
g(x) − g( y) f (u) − f (1)
h(x, y) = , g(u) = .
x−y u−1
We have
u k−xy n2 − 4(n − 1)x y
g(u) = , h(x, y) = ≥ .
u +k
2 (x 2 + k)( y 2 + k) 4(n − 1)(x 2 + k)( y 2 + k)

We only need to show that n2 ≥ 4(n − 1)x y. Indeed, this follows by the AM-GM in-
equality, as follows:
” Æ —2
n2 = [x + (n − 1) y]2 ≥ 2 (n − 1)x y = 4(n − 1)x y.

The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = n/2 and a2 = a3 =

· · · = an = n/(2n − 2) (or any cyclic permutation).

P 1.21. If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n,

then
1 − a1 1 − a2 1 − an
+ + ··· + ≤ 0.
(n − 2a1 )2 (n − 2a2 )2 (n − 2an )2
(Vasile Cîrtoaje, 2012)
38 Vasile Cîrtoaje

Solution. For n = 2, the inequality is an identity. Consider further n ≥ 3 and write the
inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
u−1
f (u) = , u ∈ I = [0, n] \ {n/2}.
(n − 2u)2
From
2u + n − 4 8(u + n − 3)
f 0 (u) = , f 00 (u) = ,
(n − 2u)3 (n − 2u)4
it follow that f is convex on [0, 1]. By HCF-Theorem, Remark 1 and Remark 4, it suffices
to show that h(x, y) ≥ 0 for x, y ∈ I such that x + (n − 1) y = n, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have
1
g(u) =
(n − 2u)2
and
4(n − x − y) 4(n − 2) y
h(x, y) = = ≥ 0.
(n − 2x) (n − 2 y)
2 2 (n − 2x)2 (n − 2 y)2
The equality holds for a1 = a2 = · · · = an = 1, and also for a1 = n and a2 = a3 = · · · =
an = 0 (or any cyclic permutation).

P 1.22. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n
k ≥1+ p , then
n−1

a12 − 1 a22 − 1 an2 − 1

+ + ··· + ≥ 0.
(a1 + k)2 (a2 + k)2 (an + k)2

(Vasile Cirtoaje, 2008)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
u2 − 1
f (u) = , u ∈ [0, n].
(u + k)2
Half Convex Function Method 39

For u ∈ [0, 1], we have

2(k2 − 3 − 2ku) 2(k2 − 2k − 3) 2(k + 1)(k − 3)

f 00 (u) = ≥ = ≥ 0.
(u + k)4 (u + k)4 (u + k)4
Thus, f is convex on [0, 1]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. We have
f (u) − f (1) u+1
g(u) = =
u−1 (u + k)2
and
g(x) − g( y) (k − 1)2 − (1 + x)(1 + y)
h(x, y) = = .
x−y (x + k)2 ( y + k)2
Since
n2
(k − 1)2 ≥ ,
n−1
we need to show that
n2 ≥ (n − 1)(1 + x)(1 + y).
Indeed,

n2 − (n − 1)(1 + x)(1 + y) = n2 − (1 + x)(2n − 1 − x) = (x − n + 1)2 ≥ 0.

Thus, the proof is completed. The equality holds for a1 = a2 = · · · = an = 1. If k =

n 1
1+ p , then the equality holds also for a1 = n − 1 and a2 = a3 = · · · = an =
n−1 n − 1
(or any cyclic permutation).

1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

P 1.23. Let as
2n − 1
0< k ≤1+ , then
n−1
a12 − 1 a22 − 1 an2 − 1
+ + ··· + ≤ 0.
(a1 + k)2 (a2 + k)2 (an + k)2
(Vasile Cirtoaje, 2008)
Solution. Write the inequality as
a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1 − u2
f (u) = , u ∈ [0, n].
(u + k)2
40 Vasile Cîrtoaje

For u ≥ 1, we have

2(2ku − k2 + 3) 2(2k − k2 + 3) 2(1 + k)(3 − k)

f 00 (u) = ≥ = > 0.
(u + k)4 (u + k)4 (u + k)4

Thus, f is convex on [1, n]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. We have

f (u) − f (1) −u − 1
g(u) = =
u−1 (u + k)2

and
g(x) − g( y) 2k − k2 + x + y + x y 2k − k2 + x + y
h(x, y) = = ≥ .
x−y (x + k)2 ( y + k)2 (x + k)2 ( y + k)2
Since
x + (n − 1) y n
x+y≥ = ,
n−1 n−1
we get
n 2n − 1
2k − k2 + x + y ≥ 2k − k2 + = −(k − 1)2 + ≥ 0,
n−1 n−1
hence h(x, y) ≥ 0.sThus, the proof is completed. The equality holds for a1 = a2 = · · · =
2n − 1
an = 1. If k = 1 + , then the equality holds also for a1 = 0 and a2 = a3 = · · · =
n−1
n
an = (or any cyclic permutation).
n−1

P 1.24. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

(n − 1)(2n − 1)
k≥ , then
n2
1 1 1 n
+ + ··· + ≥ .
1 + ka13 1 + ka23 1 + kan
3 1+k

(Vasile Cirtoaje, 2008)

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1
f (u) = , u ∈ [0, n].
1 + ku3
Half Convex Function Method 41

For u ∈ [1, n], we have

6ku(2ku3 − 1) 6ku(2k − 1)
f 00 (u) = ≥ > 0.
(1 + ku3 )3 (1 + ku3 )3

Thus, f is convex on [1, n]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

We have
−k(u2 + u + 1)
g(u) =
(1 + k)(1 + ku3 )
and
1 x 2 y 2 + x y(x + y − 1) + (x + y)2 − (x + y + 1)/k
h(x, y) = .
k2 (1 + k)(1 + k x 3 )(1 + k y 3 )
Since
x + (n − 1) y n
x+y≥ = > 1,
n−1 n−1
n
it suffices to show that k(x + y)2 ≥ x + y + 1. From x + y ≥ , we get
n−1
2n − 1
k(x + y) ≥
n
and
2n − 1
• ˜
2 n
k(x + y) − x − y ≥ (x + y)[k(x + y) − 1] ≥ − 1 = 1.
n−1 n
(n − 1)(2n − 1)
The equality holds for a1 = a2 = · · · = an = 1. If k = , then the equality
n2
n
holds also for a1 = 0 and a2 = a3 = · · · = an = (or any cyclic permutation).
n−1

P 1.25. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n−1
0<k≤ 2 , then
n − 2n + 2
1 1 1 n
+ + ··· + ≤ .
1 + ka13 1 + ka23 1 + kan3 1+k

(Vasile Cirtoaje, 2008)

42 Vasile Cîrtoaje

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
−1
f (u) = , u ∈ [0, n].
1 + ku3
For u ∈ [0, 1], we have
6ku(1 − 2ku3 ) 6ku(1 − 2k)
f 00 (u) = ≥ > 0.
(1 + ku3 )3 (1 + ku3 )3
Thus, f is convex on [0, 1]. By HCF-Theorem and Remark 1, it suffices to show that
h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n, where
g(x) − g( y) f (u) − f (1)
h(x, y) = , g(u) = .
x−y u−1
We have
k(u2 + u + 1)
g(u) =
(1 + k)(1 + ku3 )
and
1 (x + y + 1)/k − x 2 y 2 − x y(x + y − 1) − (x + y)2
h(x, y) = .
k2 (1 + k)(1 + k x 3 )(1 + k y 3 )
It suffices to show that
(n2 − 2n + 2)(x + y + 1)
− x 2 y 2 − x y(x + y − 1) − (x + y)2 ≥ 0.
n−1
Indeed, this inequality is equivalent to

( y − 1)2 [(n − 1) y − 1]2 ≥ 0.

n − 1)
The equality holds for a1 = a2 = · · · = an = 1. If k = , then the equality
n2 − 2n + 2
1
holds also for a1 = n − 1 and a2 = a3 = · · · = an = (or any cyclic permutation).
n−1

P 1.26. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
n−1
v v v
t a1 t a1 t a1 n
+ + ··· + ≤p .
k − a1 k − a1 k − a1 k−1
(Vasile Cirtoaje, 2008)
Half Convex Function Method 43

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where s
u
f (u) = − , u ∈ [0, n].
k−u
For u ∈ [0, 1], we have
p(p − 4u) p(p − 4)
f 00 (u) = ≥ ≥ 0.
4u3/2 (p − u)5/2 4u3/2 (p − u)5/2

Thus, f is convex on [0, 1]. By HCF-Theorem, it suffices to prove that f (x) + (n −

1) f ( y) ≥ n f (1) for all x, y ≥ 0 such that x + (n − 1) y = n. We write the inequality as
v v
t (k − 1)x t (k − 1) y
+ (n − 1) ≤ n,
k−x k− y
v – v ™
t (n − 1)k(1 − y) t (k − 1) y
1+ ≤ 1 + (n − 1) 1 − .
(n − 1) y + k − n k− y
Let v
t (k − 1) y
z= ,
k− y
which yields
kz 2
y= ,
z2 + k − 1
(k − 1)(1 − z 2 ) (k − 1)(nz 2 + k − n)
1− y = , (n − 1) y + k − n = ,
z2 + k − 1 z2 + k − 1
hence
k(1 − y) k(1 − z 2 ) 1
= =
(n − 1) y + k − n k − n(1 − z 2 ) 1/(1 − z 2 ) − n/k
1 n(1 − z 2 )
≤ = .
1/(1 − z 2 ) − (n − 1)/n (n − 1)z 2 + 1
Therefore, it suffices to show that
v
t n(n − 1)(1 − z 2 )
1+ ≤ 1 + (n − 1)(1 − z).
(n − 1)z 2 + 1
By squaring, we get the obvious inequality

(z − 1)2 [(n − 1)z − 1]2 ≥ 0.

44 Vasile Cîrtoaje

So, we only need to show that 1 + (n − 1)(1 − z) ≥ 0, that is, z ≤ n/(n − 1). Since
n− x n
y= ≤
n−1 n−1
and
1 1 n−1
≤ 2 = 2 ,
k−1 n /(n − 1) − 1 n −n+1
we have v v v
t k−1 t k−1 t n
z= ≤ =
k/ y − 1 k(n − 1)/n − 1 n − 1 − 1/(k − 1)
p
n2 − n + 1
v
t n n
≤ = < .
n − 1 − (n − 1)/(n − n + 1)
2 n−1 n−1
The proof is completed. The equality holds for a1 = a2 = · · · = an = 1. If k =
n2 n(n − 1)2
, then the equality holds also for a1 = 2 and a2 = a3 = · · · = an =
n−1 n − 2n + 2
n
(or any cyclic permutation).
(n − 1)(n2 − 2n + 2)

P 1.27. If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = n,

then
2 2 2
n−a1 + n−a2 + · · · + n−an ≥ 1.
(Vasile Cîrtoaje, 2006)

Solution. Let k = ln n. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
2
f (u) = n−u , u ∈ [0, n].
For u ≥ 1, we have
2 2 2
f 00 (u) = 2kn−u (2ku2 − 1) ≥ 2kn−u (2k − 1) ≥ 2kn−u (2 ln 2 − 1) > 0;

therefore, f is convex on [1, n]. By HCF-Theorem and Remark 5, it suffices to show that
f (x) + (n − 1) f ( y) ≥ n f (1) for 0 ≤ x ≤ 1 ≤ y and x + (n − 1) y = n. The desired
inequality is equivalent to g(x) ≥ 0, where
2 2 n− x
g(x) = n−x + (n − 1)n− y , y= , 0 ≤ x ≤ 1.
n−1
Half Convex Function Method 45

Since y 0 = −1/(n − 1), we get

2 2 2 2
g 0 (x) = −2x kn−x − 2(n − 1)k y y 0 n− y = 2k( y n− y − x n−x ).

The derivative g 0 (x) has the same sign as g1 (x), where

2 2
g1 (x) = ln( y n− y ) − ln(x n−x ) = ln y − ln x + k(x 2 − y 2 ).

From
y0 1 −1 2k + 2(n − 2)k x
• ˜
g10 (x) = − + 2k(x − y y 0 ) = n + ,
y x x(n − x) (n − 1)2
we see that g10 (x) has for 0 < x ≤ 1 the same sign as

−(n − 1)2
h(x) = + x(n − x)(1 + nx − 2x).
2k

Since

h0 (x) = n + 2(n2 − 2n − 1)x − 3(n − 2)x 2 ≥ nx + 2(n2 − 2n − 1)x − 3(n − 2)x

= 2(n − 1)(n − 2)x ≥ 0,

h is strictly increasing on [0, 1]. From

−(n − 1)2 1
 ‹
h(0) = < 0, h(1) = (n − 1)2 1 − > 0,
2k 2k

it follows that there is x 1 ∈ (0, 1) such that h(x) < 0 for x ∈ [0, x 1 ), h(x 1 ) = 0 and
h(x) > 0 for x ∈ (x 1 , 1]. Therefore, g1 is strictly decreasing on (0, x 1 ] and strictly
increasing on [x 1 , 1]. Since lim x→0 g1 (x) = ∞ and g1 (1) = 0, there is x 2 ∈ (0, x 1 ) such
that g1 (x) > 0 for x ∈ (0, x 2 ), g1 (x 2 ) = 0 and g1 (x) < 0 for x ∈ (x 2 , 1). Consequently,
g is strictly increasing on [0, x 2 ] and strictly decreasing on [x 2 , 1]. From g(0) > 0 and
g(1) = 0, it follows that g(x) ≥ 0 for x ∈ [0, 1]. The proof is completed. The equality
holds for a1 = a2 = · · · = an = 1.

P 1.28. If a, b, c, d, e are nonnegative real numbers such that a + b + c + d + e = 5, then

then

(a2 + 1)(b2 + 1)(c 2 + 1)(d 2 + 1)(e2 + 1) ≥ (a + 1)(b + 1)(c + 1)(d + 1)(e + 1).
46 Vasile Cîrtoaje

Solution. Write the inequality as

a+b+c+d+e
f (a) + f (b) + f (c) + f (d) + f (e) ≥ n f (s), s= = 1,
5
where
f (u) = ln(u2 + 1) − ln(u + 1), u ∈ [0, 5].

For u ∈ [0, 1], we have

2(1 − u2 ) 1 (u2 − u4 ) + 4u(1 − u2 ) + u2 + 3

f 00 (u) = + = > 0.
(u2 + 1)2 (u + 1)2 (u2 + 1)2 (u + 1)2

Therefore, f is convex on [0, 1]. By HCF-Theorem and Remark 2, we only need to show
that H(x, y) ≥ 0 for x, y ≥ 0 such that x + 4 y = 5, where

f 0 (x) − f 0 ( y) 2(1 − x y) 1
H(x, y) = = 2 + ;
x−y (x + 1)( y 2 + 1) (x + 1)( y + 1)

that is,
(x 2 + 1)( y 2 + 1)
(x 2 + 1)( y 2 + 1)H(x, y) = 2(1 − x y) + .
(x + 1)( y + 1)
Since
x2 + 1 x +1 y2 + 1 y +1
≥ , ≥ ,
x +1 2 y +1 2
it suffices to prove that

(x + 1)( y + 1)
2(1 − x y) + ≥ 0,
4

which is equivalent to x + y + 9 − 7x y ≥ 0. Indeed,

x + y + 9 − 7x y = 28x 2 − 38x + 14 = 28(x − 19/28)2 + 31/28 > 0.

The proof is completed. The equality holds for a = b = c = d = e = 1.

P 1.29. If a1 , a2 , · · · , a10 are nonnegative real numbers such that a1 + a2 + · · · + a10 = 10,
then
(1 − a1 + a12 )(1 − a2 + a22 ) · · · (1 − a10 + a10
2
) ≥ 1.

(Vasile Cîrtoaje, 2006)

Half Convex Function Method 47

Solution. Write the inequality as

a1 + a2 + · · · + a10
f (a1 ) + f (a2 ) + · · · + f (a10 ) ≥ 10 f (s), s= = 1,
10
where
f (u) = ln(1 − u + u2 ), u ∈ [0, 10].
From
1 + 2u(1 − u)
f 00 (u) = ,
(1 − u + u2 )2
it follows that f 00 (u) > 0 for u ∈ [0, 1], hence f is convex on [0, 1]. According to HCF-
Theorem, we only need to show that f (x) + 9 f ( y) ≥ 10 f (1) for all x, y ≥ 0 such that
x + 9 y = 10. Using Remark 2, it suffices to prove that H(x, y) ≥ 0, where

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y
Since
1 + x + y − 2x y
H(x, y) = ,
(1 − x + x 2 )(1 − y + y 2 )
we need to show that
1 + x + y − 2x y ≥ 0.
Indeed,
‹2
7 1

2
1 + x + y − 2x y = 18 y − 28 y + 11 = 18 y − + > 0.
9 9
The proof is completed. The equality holds for a1 = a2 = · · · = a10 = 1.

P 1.30. If a1 , a2 , . . . , an (n ≥ 3) are positive real numbers such that a1 + a2 + · · · + an = 1,

then
1 n
     
1 1 1 p
‹
p p p
p − a1 p − a2 · · · p − an ≥ n− p .
a1 a2 an n
(Vasile Cîrtoaje, 2006)

Solution. Apply HCF-Theorem to the function

1 p 1
 ‹
f (u) = ln p − u = ln(1 − u) − ln u, u ∈ (0, 1),
u 2
for s = 1/n. From

−1 1 1 − 2u − u2
f 0 (u) = − , f 00 (u) = ,
1 − u 2u 2u2 (1 − u)2
48 Vasile Cîrtoaje

p
it follows that f is convex on (0, 2 − 1]. Since

1 1 p
s= ≤ < 2 − 1,
n 3
f is also convex on (0, s].
First Solution. By HCF-Theorem, it suffices to show that f (x) + (n − 1) f ( y) ≥ n f (1/n)
for all x, y > 0 such that x + (n − 1) y = 1; that is, to show that
‹ n−1 ‹n
1 p 1 p 1
 
p
p − x p − y ≥ n− p .
x y n

Write this inequality as

nn/2 (1 − y)n−1 ≥ (n − 1)n−1 x 1/2 y (n−3)/2 .

By squaring, this inequality becomes as follows

nn (1 − y)2n−2 ≥ (n − 1)2n−2 x y n−3 ,

(2n − 2)2n−2
(2 − 2 y)2n−2 ≥ x y n−3 ,
nn
˜2n−2
1 1
•
n · + x + (n − 3) y ≥ [n + 1 + (n − 3)]n+1+(n−3) · · x · y n−3 .
n nn
Clearly, the last inequality follows from the AM-GM inequality. The proof is completed.
The equality holds for a1 = a2 = · · · = an = 1/n.
Second Solution. By HCF-Theorem and Remark 2, it suffices to prove that H(x, y) ≥ 0
for x, y > 0 such that x + (n − 1) y = 1, where

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y

We have
1− x − y − xy (n − 1)(1 + y) − 2
H(x, y) = =
2x y(1 − x)(1 − y) 2x(1 − x)(1 − y)
2(1 + y) − 2 y
≥ = > 0.
2x(1 − x)(1 − y) x(1 − x)(1 − y)

Remark 1. We may write the inequality in P 1.30 in the form

n  n
1 n
 Y
1 p
Y  ‹
(1 + )
p
p − 1 · a i ≥ n − p .
i=1
ai i=1
n
Half Convex Function Method 49

On the other hand, by the AM-GM inequality and the Cauchy-Schwarz inequality, we
have
Œn v !n
n n n
‚
1 Xp t1 1 n
Y u X  ‹
(1 + ai ) ≤ 1 + ai ≤ 1 + = 1+ p
p
ai .
i=1
n i=1 n i=1 n

Thus, the following statement follows.

• If a1 , a2 , . . . , an (n ≥ 3) are positive real numbers such that a1 + a2 + · · · + an = 1,
then     
1 1 1 p
p − 1 · · · p − 1 ≥ ( n − 1) ,
n
p −1
a1 a2 an
with equality for a1 = a2 = · · · = an = 1/n.
Remark 2. By squaring, the inequality in P 1.30 becomes
n
Y (1 − ai )2 (n − 1)2n
≥ .
i=1
ai nn

1+ x
On the other hand, since the function f (x) = ln is convex on (0, 1), by Jensen’s
1− x
inequality,
a1 + a2 + · · · + an n
 
n 1+
1 + ai n+1 n
 ‹  ‹
n
Y
≥ = .
 
1 − ai a1 + a2 + · · · + an  n−1
i=1 1−
n
Multiplying these inequality yields the following result (Kee-Wai Lau, 2000).
• If a1 , a2 , . . . , an (n ≥ 3) are positive real numbers such that a1 + a2 + · · · + an = 1,
then
1 1 1 1 n
 ‹ ‹  ‹  ‹
− a1 − a2 · · · − an ≥ n − ,
a1 a2 an n
with equality for a1 = a2 = · · · = an = 1/n.

P 1.31. Let a1 , a2 , . . . , an be positive real numbers such that a1 + a2 + · · · + an = n. If

 p 2
2 n−1
0< k ≤ 1+ ,
n

then
1 1 1
 ‹ ‹  ‹
ka1 + ka2 + · · · kan + ≥ (k + 1)n .
a1 a2 an
(Vasile Cîrtoaje, 2006)
50 Vasile Cîrtoaje

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1
 ‹
f (u) = ln ku + , u ∈ (0, n).
u
We have
ku2 − 1 1 + 4ku2 − k2 u4
f 0 (u) = , f 00 (u) = .
u(ku2 + 1) u2 (ku2 + 1)2
For u ∈ (0, 1], we have f 00 (u) > 0, since

1 + 4ku2 − k2 u4 > ku2 (4 − ku2 ) ≥ ku2 (4 − k) ≥ 0.

Therefore, f is convex on (0, 1]. By HCF-Theorem and Remark 2, it suffices to prove

that H(x, y) ≥ 0 for x, y > 0 such that x + (n − 1) y = n, where

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y

Since
1 + k(x + y)2 − k2 x 6 y 2 k[(x + y)2 − k x 6 y 2 ]
H(x, y) = > ,
x y(k x 2 + 1)(k y 2 + 1) x y(k x 2 + 1)(k y 2 + 1)
it suffices to show that p
x+y≥ k x y.
Indeed, by the Cauchy-Schwarz inequality, we have
p
(x + y)[(n − 1) y + x] ≥ ( n − 1 + 1)2 x y,

hence
1 p p
x+y≥ ( n − 1 + 1)2 x y ≥ k x y.
n
The equality holds for a1 = a2 = · · · = an = 1.

P 1.32. If a, b, c, d are nonzero real numbers such that

−1
a, b, c, d ≥ , a + b + c + d = 4,
2
then
1 1 1 1 1 1 1 1
 ‹
3 2 + 2 + 2 + 2 + + + + ≥ 16.
a b c d a b c d
Half Convex Function Method 51

Solution. Write the inequality as

a+b+c+d
f (a) + f (b) + f (c) + f (d) ≥ 4 f (s), s = = 1,
4
where
3 1 −1 11
• ˜
f (u) = + , u ∈ I = , \ {0}.
u2 u 2 2
Clearly, f is convex for u ∈ I, u ≥ s. Therefore, by HCF-Theorem and Remark 4, it
suffices to prove that f (x) + 3 f ( y) ≥ 4 f (1) for all x, y ∈ I such that x + 3 y = 4.
According to Remark 1, we only need to show that h(x, y) ≥ 0, where

g(x) − g( y) f (u) − f (1)

h(x, y) = , g(u) = .
x−y u−1

Indeed, we have
4 3
g(u) = − − 2 ,
u u
4x y + 3x + 3 y 2(1 + 2x)(6 − x)
h(x, y) = 2 2
= ≥ 0.
x y 3x 2 y 2
−1
The proof is completed. The equality holds for a = b = c = d = 1, and also for a =
2
3
and b = c = d = (or any cyclic permutation).
2

P 1.33. If a1 , a2 , . . . , an are nonnegative real numbers such that a12 + a22 + · · · + an2 = n,
then s
3 3 3 n
a1 + a2 + · · · + an − n + (a1 + a2 + · · · + an − n) ≥ 0.
n−1
(Vasile Cirtoaje, 2007)
p
Solution. Replacing each ai by ai , we have to prove that

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
p p
s
n
f (u) = u u + k u, k= , u ∈ [0, n].
n−1
For u ≥ 1, we have
3u − k 3−k
f 00 (u) = p ≥ p > 0.
4u u 4u u
52 Vasile Cîrtoaje

Therefore, f is convex for u ≥ 1. According to HCF-Theorem and Remark 1, it suffices

to show that h(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n. Since
f (u) − f (1) u+k
g(u) = =1+ p
u−1 u+1
and p p p
g(x) − g( y) x + y+ xy−k
h(x, y) = = p p p p ,
x−y ( x + y)( x + 1)( y + 1)
we need to show that
p p p
x+ y+ x y ≥ k.
This is true if s
n
x+y≥
p
.
n−1
Indeed, we have
x n
x+y≥ +y= .
n−1 n−1
The proof is completed. The s equality holds for a1 = a2 = · · · = an = 1, and also for
n
a1 = 0 and a2 = · · · = an = (or any cyclic permutation).
n−1

P 1.34. If a, b, c, d, e are nonnegative real numbers such that a2 + b2 + c 2 + d 2 + e2 = 5,

then
1 1 1 1 1
+ + + + ≤ 1.
7 − 2a 7 − 2b 7 − 2c 7 − 2d 7 − 2e
(Vasile Cirtoaje, 2010)
p p p p p
Solution. Replacing a, b, c, d, e by a, b, c, d, e, we have to prove that
a+b+c+d+e
f (a) + f (b) + f (c) + f (d) + f (e) ≥ 5 f (s), s= = 1,
5
where
1
f (u) = p , u ∈ [0, 5].
2 u−7
For u ∈ [0, 1], we have p
00 7−6 u
f (u) = p p > 0.
2u u(7 − 2 u)3
Therefore, f is convex for u ∈ [0, 1]. According to HCF-Theorem and Remark 1, it
suffices to show that h(x, y) ≥ 0 for x, y ≥ 0 such that x + 4 y = 5. Since
f (u) − f (1) −2
g(u) = = p p
u−1 5(7 − 2 u)(1 + u)
Half Convex Function Method 53

and
p p
g(x) − g( y) 2(5 − 2 x − 2 y)
h(x, y) = = p p p p p p ,
x−y ( x + y)(1 + x)(1 + y)(7 − 2 x)(7 − 2 y)

we need to show that

p5 p
.x+ y≤
2
Indeed, by the Cauchy-Schwarz inequality, we have

p 1 25
 ‹
p 2
( x + y) ≤ 1 + (x + 4 y) = .
4 4

The proof is completed. The equality holds for a = b = c = d = e = 1, and also for
1
a = 2 and b = c = d = e = (or any cyclic permutation).
2
Remark Similarly, we can prove the following generalization.
• Let a1 , a2 , . . . , an be positive real numbers such that a12 + a22 + · · · + an2 = n. If
n
k ≥1+ p , then
n−1
1 1 1 n
+ + ··· + ≤ ,
k − a1 k − a2 k − an k−1
n
with equality for a1 = a2 = · · · = an = 1. If k = 1 + p , then the equality holds also
n−1
p 1
for a1 = n − 1 and a2 = · · · = an = p .
n−1

s
n
P 1.35. If 0 ≤ a1 , a2 , . . . , an < k such that a12 +a22 +· · ·+an2 = n, where 1 < k ≤ 1+ ,
n−1
then
1 1 1 n
+ + ··· + ≥ .
k − a1 k − a2 k − an k−1
(Vasile Cirtoaje, 2010)
p p p
Solution. Replacing a1 , a2 , . . . , an by a1 , a2 , . . . , an , we have to prove that

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
1
f (u) = p , u ∈ [0, k2 ).
k− u
54 Vasile Cîrtoaje

From p
00 3 u−k
f (u) = p p ,
4u u(k − u)3
it follows that f is convex for u ≥ 1, since

p
s
n
3 u−k ≥3−k ≥2− > 0.
n−1
According to HCF-Theorem and Remark 1, it suffices to show that h(x, y) ≥ 0 for all
0 ≤ x, y < k2 such that x + (n − 1) y = n. Since

f (u) − f (1) 1
g(u) = = p p
u−1 (k − 1)(k − u)(1 + u)

and
p p
g(x) − g( y) x + y +1−k
h(x, y) = = p p p p p p ,
x−y (k − 1)( x + y)(1 + x)(1 + y)(k − x)(k − y)

we need to show that

p p
x+ y ≥ k − 1.
Indeed,
p
s s
p x n
x+ x+y≥ +y=
p
y≥ ≥ k − 1.
n−1 n−1
The proof is completed. The s equality holds for a1 = a2 = · · · = an = 1, and also for
n
a1 = 0 and a2 = · · · = an = (or any cyclic permutation).
n−1

P 1.36. If a, b, c are nonnegative real numbers, no two of which are zero, then
v v v
t 48a t 48b t 48c
1+ + 1+ + 1+ ≥ 15.
b+c c+a a+b

(Vasile Cirtoaje, 2005)

Solution. Due to homogeneity, we may assume that a + b + c = 1. Thus, we need to

show that
a+b+c 1
f (a) + f (b) + f (c) ≥ 3 f (s), s = = ,
3 3
where v
t 1 + 47u
f (u) = , u ∈ [0, 1).
1−u
Half Convex Function Method 55

From
48(47u − 11)
f 00 (u) = p ,
(1 − u)5 (1 + 47u)3
it follows that f is convex on [1/3, 1). By HCF Theorem, it suffices to show that f (x) +
2 f ( y) ≥ 3 f (1/3) for x, y ≥ 0 such that x + 2 y = 1; that is,
v v
t 1 + 47x t 49 − 47x
+2 ≥ 15.
1− x 1+ x
Setting v
t 49 − 47x
t= , 1 < t ≤ 7,
1+ x
the inequality turns into v
t 1175 − 23t 2
≥ 15 − 2t.
t2 − 1
By squaring, this inequality becomes

350 − 15t − 61t 2 + 15t 3 − t 4 ≥ 0,

(5 − t)2 (2 + t)(7 − t) ≥ 0.
The last inequality is clearly true. The equality holds for a = b = c, and also for a = 0
and b = c (or any cyclic permutation).

P 1.37. If a, b, c are nonnegative real numbers, then

v v v
t 3a2 t 3b2 t 3c 2
+ + ≤ 1.
7a2 + 5(b + c)2 7b2 + 5(c + a)2 7c 2 + 5(a + b)2
(Vasile Cirtoaje, 2008)

Solution. Due to homogeneity, we may assume that a + b + c = 3. Thus, we need to

show that
a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s = = 1,
3
where v
t 3u2 −u
f (u) = − =p , u ∈ [0, 3].
7u + 5(3 − u)
2 2
4u2 − 10u + 15
From
5(−8u2 + 41u − 30) 5(−8u2 + 38u − 30) 10(u − 1)(15 − 4u)
f 00 (u) = ≥ = ,
(4u − 10u + 15)
2 5/2 (4u − 10u + 15)
2 5/2 (4u2 − 10u + 15)5/2
56 Vasile Cîrtoaje

it follows that f is convex on [1, 3]. By HCF Theorem, it suffices to prove the original
homogeneous inequality for b = c = 1; that is
v v
t 3a2 t 3
+ 2 ≤ 1.
7a2 + 20 5a2 + 10a + 12
By squaring two times, the inequality becomes
Æ
a(5a3 + 10a2 + 16a + 50) ≥ 3a (7a2 + 20)(5a2 + 10a + 12),

a2 (5a6 + 20a5 − 11a4 + 38a3 − 80a2 − 40a + 68) ≥ 0,

a2 (a − 1)2 (5a4 + 30a3 + 44a2 + 96a + 68) ≥ 0.
The last inequality is clearly true. The equality holds for a = b = c, and also for a = 0
and b = c (or any cyclic permutation).

P 1.38. If a, b, c are nonnegative real numbers, then

v v v
t a2 t b2 t c2
+ + ≥ 1.
a2 + 2(b + c)2 b2 + 2(c + a)2 c 2 + 2(a + b)2

(Vasile Cirtoaje, 2008)

Solution. Due to homogeneity, we may assume that a + b + c = 3. Thus, we need to

show that
a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s = = 1,
3
where v
t 3u2 u
f (u) = = p , u ∈ [0, 3].
u2 + 2(3 − u)2 u2 − 4u + 6
From
2(2u2 − 11u + 12) 2(−11u + 12)
f 00 (u) = ≥ 2 ,
(u − 4u + 6)
2 5/2 (u − 4u + 6)5/2
it follows that f is convex on [0, 1]. By HCF Theorem, it suffices to prove the original
homogeneous inequality for b = c = 1; that is
a 2
p +p ≥ 1.
a2 +8 2a + 4a + 3
2

By squaring, the inequality becomes

Æ
a (a2 + 8)(2a2 + 4a + 3) ≥ 3a2 + 8a − 2.
Half Convex Function Method 57

For the nontrivial case 3a2 + 8a − 2 > 0, squaring both sides, we get

a6 + 2a5 + 5a4 − 8a3 − 14a2 + 16a − 2 ≥ 0,

(a − 1)2 [a4 + 4a3 + 9a2 + 4a + (3a2 + 8a − 2)] ≥ 0.

The last inequality is clearly true. The equality holds for a = b = c.

P 1.39. Let a, b, c be nonnegative real numbers, no two of which are zero. If

ln 3
k ≥ k0 , k0 = − 1 ≈ 0.585,
ln 2

then
‹k ‹k ‹k
2a 2b 2c
  
+ + ≥ 3.
b+c c+a a+b
(Vasile Cirtoaje, 2005)

Solution. For k = 1, the inequality is just the well known Nesbitt’s inequality

2a 2b 2c
+ + ≥ 3,
b+c c+a a+b

while for k ≥ 1, the inequality follows from Jensens’s inequality applied to the convex
function f (u) = uk :

2a 2b 2c
Œk
+ +
‹k ‹k ‹k ‚
2a 2b 2c
  
b+c c+a a+b
+ + ≥3 ≥ 3.
b+c c+a a+b 3

Consider now that k0 ≤ k < 1. Due to homogeneity, we may assume that a + b + c = 1.

Thus, we need to show that

a+b+c 1
f (a) + f (b) + f (c) ≥ 3 f (s), s= = ,
3 3
where
‹k
2u

f (u) = , u ∈ [0, 1).
1−u
From
‹k−2
4k 2u

f 00 (u) = (2u + k − 1),
(1 − u)4 1−u
58 Vasile Cîrtoaje

it follows that f is convex on [1/3, 1) (since u ≥ 1/3 involves 2u + k − 1 ≥ 2/3 + k − 1 =

k −1/3 > 0). By HCF Theorem, it suffices to prove the original homogeneous inequality
for b = c = 1; that is, to show that h(a) ≥ 3 for all a ≥ 0, where
‹k
2

h(a) = a k + 2 .
a+1
For a > 0, the derivative
‹k+1
2

0
h (a) = ka k−1
−k
a+1
has the same sign as
2
g(a) = (k − 1) ln a − (k + 1) ln .
a+1
From
2ka + k − 1
g 0 (a) = ,
a(a + 1)
it follows that g 0 (a) = 0 for a0 = (1 − k)/(2k) < 1, g 0 (a) < 0 for a ∈ (0, a0 ) and
g 0 (a) > 0 for a ∈ (a0 , ∞). Then, g is strictly decreasing on (0, a0 ] and strictly increasing
on (a0 , ∞). Since lima→0 g(a) = ∞ and g(1) = 0, there exists a1 ∈ (0, a0 ) such that
g(a1 ) = 0, g(a) > 0 for a ∈ (0, a1 ) ∪ (1, ∞) and g(a) < 0 for a ∈ (a1 , 1); hence, h(a) is
strictly increasing on [0, a1 ] ∪ [1, ∞) and strictly decreasing on [a1 , 1]. Consequently,

h(a) ≥ min{h(0), h(1)}.

Since h(0) = 2k+1 ≥ 3 and h(1) = 3, we get h(a) ≥ 3. The proof is completed. The
equality holds for a = b = c. If k = k0 , then the equality holds also for a = 0 and b = c
(or any cyclic permutation).

p
P 1.40. If a, b, c ∈ [1, 7 + 4 3], then
v v v
t 2a t 2b t 2c
+ + ≥ 3.
b+c c+a a+b

(Vasile Cirtoaje, 2007)

Solution. Denoting
a+b+c
s= ,
3
we need to show that
f (a) + f (b) + f (c) ≥ 3 f (s),
Half Convex Function Method 59

where v
t 2u
f (u) = , 1 ≤ u < 3s.
3s − u
For u ≥ s, we have
‹3/2
3s − u 4u − 3s

f 00 (u) = 3s > 0.
2u (3s − u)4
Therefore, f is convex for u ≥ s. By HCF Theorem, it suffices to prove the original
inequality for b = c; that is,
s v
a t 2b
+2 ≥ 3.
b a+b
v
tb p
Putting t = , the condition a, b ∈ [1, 7 + 4 3] involves
a
p p
2− 3 ≤ t ≤ 2 + 3.

We need to show that v

t 2t 2 1
2 ≥3− .
t +1
2 t
This is true if
8t 2 1 2
 ‹
≥ 3− .
t2 + 1 t
This is equivalent to the obvious inequality

(t − 1)2 (t 2 − 4t + 1) ≥ 0.

completed. The equality holds for a = b = c, and also for a = 1 and

The proof is p
b = c = 7 + 4 3 (or any cyclic permutation).

P 1.41. Let a, b, c be nonnegative real numbers such that a + b + c = 3. If

ln 2
0 < k ≤ k0 , k0 = ≈ 1.71,
ln 3 − ln 2

then
a k (b + c) + b k (c + a) + c k (a + b) ≤ 6.
60 Vasile Cîrtoaje

Solution. For 0 < k ≤ 1, the inequality follows from Jensens’s inequality applied to the
convex function f (u) = uk :

(b + c)a + (c + a)b + (a + b)c k

• ˜
(b + c)a k + (c + a)b k + (a + b)c k ≤ 2(a + b + c)
2(a + b + c)

a b + bc + ca k a + b + c 2k
 ‹  ‹
=6 ≤6 = 6.
3 3
Consider now that 1 < k ≤ k0 , and write the inequality as
a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s = = 1,
3
where
f (u) = uk (u − 3), u ∈ [0, 3].
For u ≥ 1, we have

f 00 (u) = kuk−2 [(k + 1)u − 3k + 3] ≥ kuk−2 [(k + 1) − 3k + 3] = 2k(2 − k)uk−2 > 0;

therefore, f is convex for u ≥ 1. By HCF-Theorem, it suffices to consider the case where

two of a, b, c are equal. Write the desired inequality in the homogeneous form

a + b + c k+1
 ‹
k k k
a (b + c) + b (c + a) + c (a + b) ≤ 6 .
3
Since this inequality is trivial for b = c = 0, we may consider that b = c = 1. So, we
need to show that g(a) ≥ 0 for a ≥ 0, where

a + 2 k+1
 ‹
g(a) = 3 − a k − a − 1.
3
We have
‹k ‹k−1
a+2 1 00 k+1 a+2 k−1
 
0
g (a) = (k + 1) − ka k−1
− 1, g (a) = − .
3 k 3 3 a2−k
Since g 00 is strictly increasing, lima→0 g(a) = −∞ and g 00 (1) = 2k(2 − k)/3 > 0, there
exists a1 ∈ (0, 1) such that g 00 (a1 ) = 0, g 00 (a) < 0 for a ∈ (0, a1 ), and g 00 (a) > 0 for
a > 1. Therefore, g 0 is strictly decreasing on [0, a1 ] and strictly increasing on [a1 , ∞).
Since
k+1 k−1
g 0 (0) = (k + 1)(2/3)k − 1 ≥ (k + 1)(2/3)k0 − 1 = −1= > 0, g 0 (1) = 0,
2 2
there exists a2 ∈ (0, a1 ) such that g 0 (a2 ) = 0, g 0 (a) > 0 for a ∈ [0, a2 ) ∪ (1, ∞), and
g 0 (a) < 0 for a ∈ (a2 , 1). Thus, g is strictly increasing on [0, a2 ] ∪ [1, ∞) and strictly
decreasing on [a2 , 1]. Consequently,

g(a) ≥ min{g(0), g(1)},

Half Convex Function Method 61

and from

g(0) = 3(2/3)k+1 − 1 ≥ 3(2/3)k0 +1 − 1 = 1 − 1 = 0, g(1) = 0,

we get g(a) ≥ 0. This completes the proof. The equality holds for a = b = c = 1. If k =
k0 , then the equality holds also for a = 0 and b = c = 3/2 (or any cyclic permutation).
Remark 1. Using the Cauchy-Schwarz inequality, we get
X a (a + b + c)2 9 3
≥ =P ≥ .
b +c a(b + c ) a (b + c) 2
P
k k k k k

Thus, the following statement holds.

• Let a, b, c be nonnegative real numbers such that a + b + c = 3. If

ln 2
0 < k ≤ k0 , k0 = ≈ 1.71,
ln 3 − ln 2

then
a b c 3
+ + ≥ ,
bk + c k c k + ak ak + bk 2

with equality for a = b = c = 1. If k = k0 , then the equality holds also for a = 0 and
b = c = 3/2 (or any cyclic permutation).
Remark 2. Also, the following statement holds.
• Let a, b, c be nonnegative real numbers such that a + b + c = 3. If

ln 9 − ln 8
k ≥ k1 , k1 = ≈ 0.2905,
ln 3 − ln 2

then
ak bk ck 3
+ + ≥ ,
b+c c+a a+b 2

with equality for a = b = c = 1. If k = k1 , then the equality holds also for a = 0 and
b = c = 3/2 (or any cyclic permutation).

For k1 ≤ k ≤ 2, the inequality can be proved using the Cauchy-Schwarz inequality, as

follows:
X ak (a + b + c)2 9 3
≥P =P = .
b+c a (b + c)
2−k a (b + c) 2
2−k
62 Vasile Cîrtoaje

For k > 2, the inequality can be deduced from the Cauchy-Schwarz inequality and
Bernoulli’s inequality, as follows:
P k/2
2 P k/2
2
X ak a a
≥ P = ,
b+c (b + c) 6
X X• k
˜
k/2
a ≥ 1 + (a − 1) = 3.
2

P 1.42. Let a1 , a2 , . . . , an be nonnegative real numbers such that a1 + a2 + · · · + an = n. If

n2
k≥ , then
4(n − 1)
(a12 + k)(a22 + k) · · · (an2 + k) ≥ (1 + k)n .

Solution. Write the inequality as

a1 + a2 + · · · + an
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f (s), s= = 1,
n
where
f (u) = ln(u2 + k), u ∈ [0, n].
We have
2u 2(k − u2 )
f 0 (u) = , f 00 (u) = .
u2 + k (u2 + k)2
For u ∈ [0, 1], we have f 00 (u) > 0, since
n2
k − u2 ≥ k − 1 ≥ − 1 ≥ 0.
4(n − 1)
Therefore, f is convex on [0, 1]. By HCF-Theorem and Remark 2, it suffices to prove
that H(x, y) ≥ 0 for x, y ≥ 0 such that x + (n − 1) y = n, where
f 0 (x) − f 0 ( y)
H(x, y) = .
x−y
Since
2(k − x y) 2[n2 − 4(n − 1)x y]
H(x, y) = ≥ ,
(x 2 + k)( y 2 + k) 4(n − 1)(x 2 + k)( y 2 + k)
we only need to show that
n2 ≥ 4(n − 1)x y.
Indeed, we have
n2 = [x + (n − 1) y]2 ≥ 4(n − 1)x y.
The equality holds for a1 = a2 = · · · = an = 1.
Half Convex Function Method 63

P 1.43. Let a, b, c be nonnegative real numbers such a + b + c = 3. If k ≥ k0 , where

p
6−2 p p
k0 = p p = (2 + 2)(2 + 3) ≈ 12.74 ,
6− 2−1
then ‚v v Œ
p p p ta + b tb+c s
c+a
a+ b+ c−3≥ k + + −3 .
2 2 2
(Vasile Cirtoaje, 2008)

Solution. By the Cauchy-Schwarz inequality

€p p p Š2
(1 + 1 + 1)[(a + b) + (b + c) + (c + a)] ≥ a+b+ b+c+ c+a ,

we get v v
ta + b tb+c s
c+a
+ + ≤ 3.
2 2 2
Therefore, it suffices to consider the case k = k0 . Write the inequality as
a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where v
p t3 − u
f (u) = u − k0 , u ∈ [0, 3).
2
For u ≥ 1, we have
‹−3/2
k0 3−u k0

00 −3/2
4 f (u) = −u + ≥ −1 + > 0.
4 2 4
Therefore, f is convex on [1, 3]. By HCF-Theorem and Remark 5, it suffices to consider
only the case a ≤ 1 ≤ b = c. Write the original inequality in the homogeneous form
v ‚v v v Œ
p p p ta + b + c ta + b t b + c sc + a ta + b + c
a+ b+ c−3 ≥ k0 + + −3 .
3 2 2 2 3

Due to homogeneity, we may assume that b = c = 1. Moreover, it is convenient to use

p
the substitution x = a. Thus, we need to show that g(x) ≥ 0 for x ∈ [0, 1], where
v v
t x2 + 2 t x2 + 1
g(x) = x + 2 − k0 + 3(k0 − 1) − 2k0 .
3 2
We have v v
0
t 3 t 2
g (x) = 1 + (k0 − 1)x − k0 x ,
x2 + 2 x2 + 1
64 Vasile Cîrtoaje

‹3/2 – 3/2 ™
k0 2 x2 + 1

g 00 (x) = m· 2 −1 ,
2 x +1
2 x +2
where v
1 2
u  ‹
3
m= 6 1−
t
≈ 1.72.
k0

Clearly, g 00 (x) has the same sign as h(x), where

x2 + 1
h(x) = m · − 1.
x2 + 2
Since
m 2m
h(0) = − 1 < 0, h(1) = − 1 > 0,
2 3
there is x 1 ∈ (0, 1) such that h(x) < 0 for x ∈ [0, x 1 ), h(x 1 ) = 0 and h(x) > 0 for
x ∈ (x 1 , 1]. Therefore, g 0 is strictly decreasing on [0, x 1 ] and strictly increasing on
[x 1 , 1]. Since g 0 (0) = 1 and g 0 (1) = 0, there is x 2 ∈ (0, x 1 ) such that g 0 (x) > 0 for
x ∈ [0, x 2 ), g 0 (x 2 ) = 0 and g 0 (x) < 0 for x ∈ (x 2 , 1). Thus, g(x) is strictly
p increasing
p on
[0, x 2 ] and strictly decreasing on [x 2 , 1]. From g(0) = 2 − k0 + (k0 − 1) 6 − k0 2 = 0
and g(1) = 0, it follows that g(x) ≥ 0 for x ∈ [0, 1]. This completes the proof. The
equality holds for a = b = c. If k = k0 , then the equality holds also for a = 0 and
b = c = 3/2 (or any cyclic permutation).

P 1.44. Let a, b, c be nonnegative real numbers such a + b + c = 3. If k ≤ k1 , where

p p p
k1 = ( 3 − 1)( 3 + 2) ≈ 2.303 ,

then ‚v v Œ
p p p ta + b tb+c s
c+a
a+ b+ c−3≤ k + + −3 .
2 2 2

(Vasile Cirtoaje, 2008)

Solution. By the Cauchy-Schwarz inequality

€p p p Š2
(1 + 1 + 1)[(a + b) + (b + c) + (c + a)] ≥ a+b+ b+c+ c+a ,

we get
v v
ta + b tb+c s
c+a
+ + ≤ 3.
2 2 2
Half Convex Function Method 65

Therefore, it suffices to consider the case k = k1 . Write the inequality as

a+b+c
f (a) + f (b) + f (c) ≥ 3 f (s), s= = 1,
3
where v
p t3 − u
f (u) = − u + k1 , u ∈ [0, 3).
2
For 0 ≤ u ≤ 1, we have
‹−3/2
k1 3−u k1

4 f 00 (u) = u−3/2 − ≥1− > 0.
4 2 4

Therefore, f is convex on [0, 1]. By HCF-Theorem and Remark 5, it suffices to consider

only the case a ≥ 1 ≥ b = c. Write the original inequality in the homogeneous form
v ‚v v v Œ
p p p ta + b + c ta + b tb+c s
c+a ta + b + c
a+ b+ c−3 ≤ k1 + + −3 .
3 2 2 2 3

Due to homogeneity, we may assume that b = c = 1. Moreover, it is convenient to use

p
the substitution x = a. Thus, we need to show that g(x) ≤ 0 for x ≥ 1, where
v v
t x2 + 2 t x2 + 1
g(x) = x + 2 − k1 + 3(k1 − 1) − 2k1 .
3 2

We have v v
0 3t t 2
g (x) = 1 + (k1 − 1)x − k1 x ,
x2 + 2 x2 + 1
‹3/2 – 3/2 ™
k 2 2
+ 1

1 x
g 00 (x) = m· 2 −1 ,
2 x2 + 1 x +2
where v
1 2
u  ‹
3
m= 6 1−
t
≈ 1.2431 .
k1

Clearly, g 00 (x) has the same sign as h(x), where

x2 + 1
h(x) = m · − 1.
x2 + 2
Since h is strictly increasing on [1, ∞) and

2m
h(1) = − 1 < 0, lim h1 (x) = m − 1 > 0,
3 x→∞
66 Vasile Cîrtoaje

there is x 1 ∈ (1, ∞) such that h(x) < 0 for x ∈ [1, x 1 ), h(x 1 ) = 0 and h(x) > 0
for x ∈ (x 1 , ∞). Therefore, g 0 is strictly decreasing on [1, x 1 ] and strictly increasing
on [x 1 , ∞). Since g 0 (1) = 0 and lim x→∞ g 0 (x) = 0, it follows that g 0 (x) < 0 for
x ∈ (1, ∞). Thus, g(x) is strictly decreasing on [1, ∞), hence g(x) ≤ g(1) = 0. This
completes the proof. The equality holds for a = b = c = 1. If k = k0 , then the equality
holds also for a = 0 and b = c = 3/2 (or any cyclic permutation).

P 1.45. If a, b, c are positive real numbers such that a bc = 1, then

a2 + b2 + c 2 − 3 ≥ 18(a + b + c − a b − bc − ca).

Solution. Using the substitution

a = ex , b = ey, c = ez ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where
f (u) = e2u − 1 − 18(eu − e−u ), u ∈ R.
For u ≤ 0, we have
f 00 (u) = 4e2u + 18(e−u − eu ) > 0,
hence f is convex on (−∞, 0]. By HCF-Theorem, it suffices to prove the original in-
equality for b = c := t and a = 1/t 2 , where t > 0. Since

1 (t 2 − 1)2 (2t 2 + 1)
a2 + b2 + c 2 − 3 = + 2t 2
− 3 =
t4 t4
and
−(t 4 − 2t 3 + 2t − 1) −(t − 1)3 (t + 1)
a + b + c − a b − bc − ca = = ,
t2 t2
we get

(t − 1)2 (2t − 1)2 (t + 1)(5t + 1)

a2 + b2 + c 2 − 3 − 18(a + b + c − a b − bc − ca) = ≥ 0.
t4
The equality holds for a = b = c = 1, and also for a = 4 and b = c = 1/2 (or any cyclic
permutation).
Half Convex Function Method 67

P 1.46. If a, b, c are positive real numbers such that a bc = 1, then

p p p
a2 − a + 1 + b2 − b + 1 + c 2 − c + 1 ≥ a + b + c.

Solution. Using the substitution

a = ex , b = ey, c = ez ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where p
f (u) = e2u − eu + 1 − eu , u ∈ R.
We claim that f is convex for u ≥ 0. Since

4e3u − 6e2u + 9eu − 2

e−u f 00 (u) = − 1,
4(e2u − eu + 1)3/2
we need to show that

(4x 3 − 6x 2 + 9x − 2)2 ≥ 16(x 2 − x + 1)3 ,

where x = eu ≥ 1. Indeed,

(4x 3 − 6x 2 + 9x − 2)2 − 16(x 2 − x + 1)3 = 12x 3 (x − 1) + 9x 2 + 12(x − 1) > 0.

By HCF-Theorem, it suffices to prove the original inequality for b = c := t and a = 1/t 2 ,

where t > 0; that is,
p
t4 − t2 + 1 p 1
+ 2 t 2 − t + 1 ≥ 2 + 2t,
t2 t
t2 − 1 2(1 − t)
p +p ≥ 0.
t4 − t2 + 1 + 1 t2 − t + 1 + t
Since
t2 − 1 t2 − 1
p ≥ ,
t4 − t2 + 1 t2 + 1
it suffices to show that
t2 − 1 2(1 − t)
+p ≥ 0,
t +1
2
t2 − t + 1 + t
which is equivalent to
t +1 2
• ˜
(t − 1) 2 −p ≥ 0,
t +1 t2 − t + 1 + t
68 Vasile Cîrtoaje

” p —
(t − 1) (t + 1) t 2 − t + 1 − t 2 + t − 2 ≥ 0,

(t − 1)2 (3t 2 − 2t + 3)
p ≥ 0.
(t + 1) t 2 − t + 1 + t 2 − t + 2
Clearly, the last inequality is true. The equality holds for a = b = c = 1.

1
P 1.47. If a, b, c, d ≥ p such that a bcd = 1, then
1+ 6
1 1 1 1 4
+ + + ≤ .
a+2 b+2 c+2 d +2 3
(Vasile Cirtoaje, 2005)

Solution. Using the substitution

a = ex , b = ey, c = ez , d = ew,

we need to show that

x + y +z+w
f (x) + f ( y) + f (z) + f (w) ≥ 4 f (s), s= = 0,
4
where
−1
f (u) = , u ∈ R.
eu+2
For u ≤ 0, we have
eu (2 − eu )
f 00 (u) = > 0,
(eu + 2)3
hence f is convex on (−∞, 0]. By HCF-Theorem, it suffices to prove the original in-
1
equality for b = c = d := t and a = 1/t 3 , where t ≥ p ; that is,
1+ 6

t3 3 4
+ ≤ ,
2t + 1 t + 2 3
3

which is equivalent to the obvious inequality

(t − 1)2 (5t 2 + 2t − 1) ≥ 0.
p
The equality holds for a = b = c = d = 1, and also for a = 19 + 9 6 and b = c = d =
1
p (or any cyclic permutation).
1+ 6
Half Convex Function Method 69

P 1.48. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 · · · an = 1, then

p 1 1 1
 ‹
2 2 2
a1 + a2 + · · · + an − n ≥ 6 3 a1 + a2 + · · · + an − − − ··· − .
a1 a2 an

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where p
f (u) = e2u − 1 − 6 3 (eu − e−u ), u ∈ R.
For u ≤ 0, we have p
f 00 (u) = 4e2u + 6 3(e−u − eu ) > 0,
hence f is convex on (−∞, 0]. By HCF-Theorem and Remark 2, it suffices to show that
H(x, y) ≥ 0 for x, y ∈ R such that x + (n − 1) y = 0, where

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y

From p
f 0 (u) = 2e2u − 6 3 (eu + e−u ),
we get
2(e x − e y ) x p p
e + e y − 3 3 + 3 3 e−x e− y .


H(x, y) =
x−y
Since (e x − e y )/(x − y) > 0, we need to prove that
p p
e x + e y + 3 3 e−x e− y ≥ 3 3.

Indeed, by the AM-GM inequality, we have

p Æ
3 p p
e x + e y + 3 3 e−x e− y ≥ 3 e x · e y · 3 3 e−x e− y = 3 3.

The proof is completed. The equality holds for a1 = a2 = · · · = an = 1.

P 1.49. If a1 , a2 , . . . , an (n ≥ 4) are positive real numbers such that a1 a2 · · · an = 1, then

(n − 1)(a12 + a22 + · · · + an2 ) + n(n + 3) ≥ (2n + 2)(a1 + a2 + · · · + an ).

70 Vasile Cîrtoaje

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
f (u) = (n − 1)e2u − (2n + 2)eu , u ∈ R.
For u ≥ 0, we have

f 00 (u) = 4(n − 1)e2u − (2n + 2)eu = 2eu [2(n − 1)eu − n − 1]

≥ 2eu [2(n − 1) − n − 1] = 2(n − 3)eu > 0.

Therefore, f is convex on [0, ∞). By HCF-Theorem and Remark 2, it suffices to show

that H(x, y) ≥ 0 for x, y ∈ R such that x + (n − 1) y = 0, where
f 0 (x) − f 0 ( y)
H(x, y) = .
x−y
From
f 0 (u) = 2(n − 1)e2u − (2n + 2)eu ,
we get
2(e x − e y )
H(x, y) = [(n − 1)(e x + e y ) − (n + 1)] .
x−y
Since (e x − e y )/(x − y) > 0, we need to prove that (n − 1)(e x + e y ) ≥ n + 1. Using the
AM-GM inequality, we have
Æ
n
(n − 1)(e x + e y ) = (n − 1)e x + e y + e y + · · · + e y ≥ n (n − 1)e x · e y · e y · · · e y
Æn pn
= n (n − 1)e x+(n−1) y = n n − 1.

Thus, it suffices to show that p

n
n n − 1 ≥ n + 1,
which is equivalent to
1 n
 ‹
n−1≥ 1+ .
n
This is true for n ≥ 4, since
1 n
 ‹
n−1≥3> 1+ .
n
The proof is completed. The equality holds for a1 = a2 = · · · = an = 1.
Remark. From the proof above, it follows that the following sharper inequality holds
in the same conditions (Gabriel Dospinescu and Calin Popa):
pn
2 2 2 2n n − 1
a1 + a2 + · · · + an − n ≥ (a1 + a2 + · · · + an − n).
n−1
Half Convex Function Method 71

P 1.50. Let a1 , a2 , . . . , an (n ≥ 3) be positive real numbers such that a1 a2 . . . an = 1. If

p, q ≥ 0 such that p + q ≥ n − 1, then
1 1 1 n
+ + ··· + ≥ .
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan
2 1+p+q

(Vasile Cirtoaje, 2007)

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
1
f (u) = , u ∈ R.
1+ peu + qe2u
For u ≥ 0, we have

eu [4q2 e3u + 3pqe2u + (p2 − 4q)eu − p]

f 00 (u) =
(1 + peu + qe2u )3
e [4q + 3pq + (p2 − 4q) − p]
2u 2
≥
(1 + peu + qe2u )3
e2u [(p + 2q)(p + q − 2) + 2q2 + p]
= > 0,
(1 + peu + qe2u )3

therefore f (u) is convex for u ≥ 0. By HCF-Theorem, it suffices to prove the original

inequality for a2 = · · · = an := t and a1 = 1/t n−1 , where t > 0. Write this inequality as

t 2n−2 n−1 n
+ ≥ .
t 2n−2 + pt n−1 + q 1 + pt + qt 2 1+p+q
Applying the Cauchy-Schwarz inequality, it suffices to prove that

(t n−1 + n − 1)2 n
≥ ,
(t 2n−2 + pt n−1 + q) + (n − 1)(1 + pt + qt ) 1 + p + q
2

which is equivalent to
pB + qC ≥ A,
where
A = (n − 1)(t n−1 − 1)2 ≥ 0,
A
B = (t n−1 − 1)2 + nE = + nE, E = t n−1 + n − 2 − (n − 1)t,
n−1
A
C = (t n−1 − 1)2 + nF = + nF, F = 2t n−1 + n − 3 − (n − 1)t 2 .
n−1
72 Vasile Cîrtoaje

By the AM-GM inequality applied to n − 1 positive numbers, we have E ≥ 0 and F ≥ 0

for n ≥ 3. Since A ≥ 0 and p + q ≥ n − 1, we have

(p + q)A
pB + qC − A ≥ pB + qC − = n(pE + qF ) ≥ 0.
n−1
The equality holds for a1 = a2 = · · · = an = 1.

Remark 1. For p = 2k and q = k2 , we get the following result.

• Let a1 , a2 , · · · , an (n ≥ 3) be positive real numbers such that a1 a2 · · · an = 1. If
p
k ≥ n − 1, then
1 1 1 n
+ + ··· + ≥ ,
(1 + ka1 )2 (1 + ka2 )2 (1 + kan )2 (1 + k)2

with equality for a1 = a2 = · · · = an = 1.

In addition, for n = 4 and k = 1, we get the known inequality (Vasile Cirtoaje, 1999):
1 1 1 1
+ + + ≥ 1,
(1 + a)2 (1 + b)2 (1 + c)2 (1 + d)2

where a, b, c, d > 0 such that a bcd = 1.

Remark 2. For p + q = n − 1, we get the beautiful inequality
1 1 1
+ + ··· + ≥ 1, n ≥ 3,
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan2

which is a generalization of the following inequalities:

1 1 1
+ + ··· + ≥ 1,
1 + (n − 1)a1 1 + (n − 1)a2 1 + (n − 1)an

1 1 1
p + p + ··· + p ≥ 1,
[1 + ( n − 1)a1 ] 2 [1 + ( n − 1)a1 ] 2 [1 + ( n − 1)a1 ]2
1 1 1 1
+ + ≥ .
2 + (n − 1)(a1 + a12 ) 2 + (n − 1)(a2 + a22 ) 2 + (n − 1)(an + an ) 2
2

Remark 3. Similarly, we can prove the following statement:

• Let a1 , a2 , . . . , an (n ≥ 4) be positive real numbers such that a1 a2 . . . an = 1. If
p, q, r ≥ 0 such that p + q + r ≥ n − 1, then
n
X 1 n
≥ .
i=1
1+ pai + qai2 + r ai3 1+p+q+r
Half Convex Function Method 73

For n = 4 and p + q + r = 3, we get the following beautiful inequality

4
X 1
≥ 1.
i=1
1 + pai + qai2 + r ai3

In addition, for p = q = r = 1, we get the known inequality (Vasile Cirtoaje, 1999):

4
X 1
≥ 1.
i=1
1 + ai + ai2 + ai3

Conjecture. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1, and let

k1 , k2 , . . . , km ≥ 0 such that k1 + k2 + · · · + km ≥ n − 1. If m ≤ n − 1, then
n
X 1 n
≥ . (*)
i=1
1 + k1 ai + k2 ai2 + · · · + km aim 1 + k1 + k2 + · · · + km

For m = n − 1 and k1 = k2 = · · · = km = 1, (*) turns into the known beautiful inequality

n
X 1
≥ 1.
i=1
1 + ai + ai2 + · · · + ain−1

For k1 = 1m k, k2 = m
2 k2 ,. . . , km = m
m k m , (*) turns into the known inequality (Vasile
Cirtoaje, 2005):
1 1 1 n
+ + ··· + ≥ ,
(1 + ka1 ) m (1 + ka2 ) m (1 + kan ) m (1 + k)m

which holds for 0 < m ≤ n − 1 and k ≥ n1/m − 1.

P 1.51. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If k ≥ n2 − 1,

then
1 1 1 n
+p + ··· + p ≥p .
1 + ka1 1 + ka2 1 + kan 1+k
p

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
1
f (u) = p , u ∈ R.
1 + keu
74 Vasile Cîrtoaje

For u ≥ 0, we have
keu (keu − 2) keu (k − 2)
f 00 (u) = ≥ > 0.
4(1 + keu )5/2 4(1 + keu )5/2
Therefore, f is convex on [0, ∞). By HCF-Theorem and Remark 5, it suffices to prove
the original inequality for a2 = · · · = an := t and a1 = 1/t n−1 , where t ≥ 1. Write this
inequality as h(t) ≥ 0, where
v
t t n−1 n−1 n
h(t) = +p −p .
t n−1 +k 1 + kt 1+k
The derivative
(n − 1)kt (n−3)/2 (n − 1)k
h0 (t) = −
2(t n−1 + k)3/2 2(kt + 1)3/2
has the same sign as
h1 (t) = t n/3−1 (kt + 1) − t n−1 − k.
Denoting m = n/3, m ≥ 2/3, we see that

h1 (t) = kt m + t m−1 − t 3m−1 − k = k(t m − 1) − t m−1 (t 2m − 1) = (t m − 1)h2 (t),

where
h2 (t) = k − t m−1 − t 2m−1 .
For t > 1, we have

h02 (t) = t m−2 [−m + 1 − (2m − 1)t m ] < t m−2 [−m + 1 − (2m − 1)]
= −(3m − 2)t m−2 ≤ 0,

hence h2 (t) is strictly decreasing for t ≥ 1. Since h2 (1) = k − 2 > 0 and lim t→∞ h2 (t) =
−∞, there exists t 1 > 1 such that h2 (t 1 ) = 0, h2 (t) > 0 for t ∈ (1, t 1 ), and h2 (t) < 0 for
t ∈ (t 1 , ∞). Since h2 , h1 and h0 has the same sign for t > 1, h(t) is strictly increasing for
t ∈ [1, t 1 ] and strictly decreasing for t ∈ [t 1 , ∞); this yields h(t) ≥ min{h(1), h(∞)}.
n
From h(1) = 0 and h(∞) = 1 − p ≥ 0, it follows that h(t) ≥ 0 for all t ≥ 1. The
1+k
proof is completed. The equality holds for a1 = a2 = · · · = an = 1.

P 1.52. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 . . . an = 1, then

1 1 1
+ + ··· + ≥ 1.
1 + a1 + · · · + a1n−1 1 + a2 + · · · + a2n−1 1 + an + · · · + ann−1

(Vasile Cirtoaje, 2007)

Half Convex Function Method 75

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
1
f (u) = , u ∈ R.
1 + eu + · · · + e(n−1)u
We will show that f is convex for u ≥ 0. Setting t = eu , t ≥ 1, the necessary and
sufficient condition f 00 (u) ≥ 0 for u ≥ 0 is equivalent to

2A2 ≥ B(1 + C),

where
A = t + 2t 2 + · · · + (n − 1)t n−1 ,
B = t + 4t 2 + · · · + (n − 1)2 t n−1 ,
C = t + t 2 + · · · + t n−1 .
We will prove this inequality by induction on n. For n = 2, the inequality becomes
t(t − 1) ≥ 0, which is clearly true for t ≥ 1. Assume now that the inequality is true for
n and prove it for n + 1, n ≥ 2. So, we need to show that 2A2 ≥ B(1 + C) involves

2(A + nt n )2 ≥ (B + n2 t n )(1 + C + t n ),

which is equivalent to

2A2 − B(1 + C) + t n [n2 (t n − 1) + D] ≥ 0,

where
n−1
X
2
D = 2nA − B − n C = bi t i , bi = 3n2 − (2n − i)2 .
i=1

Since 2A − B(1 + C) ≥ 0, it suffices to show that D ≥ 0. Since

2

b1 < b2 < · · · < bn−1 , t ≤ t 2 ≤ · · · ≤ t n−1 ,

we may apply Cebyshev’s inequality to get

1
D≥ (b1 + b2 + · · · + bn−1 )(t + t 2 + · · · + t n−1 ).
n
Thus, it suffices to show that b1 + b2 + · · · + bn−1 ≥ 0. Indeed,
n−1
X n(n − 1)(4n + 1)
b1 + b2 + · · · + bn−1 = [3n2 − (2n − i)2 ] = > 0.
i=1
6
76 Vasile Cîrtoaje

By HCF-Theorem and Remark 5, it suffices to prove the original inequality for a2 = · · · =

an := t and a1 = 1/t n−1 , where t ≥ 1. Setting k = n − 1, k ≥ 1, we need to show that
2
tk k
+ ≥ 1.
1 + tk + · · · + tk 2
1 + t + · · · + tk

For the nontrivial case t > 1, this inequality is equivalent to the following sequence of
inequalities:
k 1 + t k + · · · + t (k−1)k
≥ ,
1 + t + · · · + tk 1 + t k + · · · + t k2
2
k(t − 1) tk − 1 tk − 1
≥ · ,
t k+1 − 1 t k − 1 t (k+1)k − 1
2
k(t − 1) tk − 1
≥ ,
t k+1 − 1 t (k+1)k − 1
2
t k(k+1) − 1 tk − 1
k ≥ ,
t k+1 − 1 t −1
k 1 + t k+1 + t 2(k+1) + · · · + t (k−1)(k+1) ≥ 1 + t + t 2 + · · · + t (k−1)(k+1) ,
 

k 1 · 1 + t · t k + · · · + t k−1 · t (k−1)k ≥ 1 + t + · · · + t k−1 1 + t k + · · · + t (k−1)k .

 
 

Since 1 < t < · · · < t k−1 and 1 < t k < · · · < t (k−1)k , the last inequality follows from
Cebishev’s inequality. This completes the proof. The equality holds for a1 = a2 = · · · =
an = 1.

P 1.53. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If p, q ≥ 0

1
such that 0 < p + q ≤ , then
n−1
1 1 1 n
+ + ··· + ≤ .
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan2 1+p+q

(Vasile Cirtoaje, 2007)

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
−1
f (u) = , u ∈ R.
1 + peu + qe2u
Half Convex Function Method 77

For u ≤ 0, we have

eu [−4q2 e3u − 3pqe2u + (4q − p2 )eu + p]

f 00 (u) =
(1 + peu + qe2u )3
e2u [−4q2 − 3pq + (4q − p2 ) + p]
≥
(1 + peu + qe2u )3
e2u [(p + 4q)(1 − p − q) + 2pq]
= ≥ 0,
(1 + peu + qe2u )3

therefore f (u) is convex for u ≤ 0. By HCF-Theorem, it suffices to prove the original

inequality for a2 = · · · = an := t and a1 = 1/t n−1 , where t > 0. Write this inequality as

t 2n−2 n−1 n
+ ≤ ,
t 2n−2 + pt n−1 + q 1 + pt + qt 2 1+p+q

p2 A + q2 B + pqC ≤ pD + qE,
where
A = t n−1 (t n − nt + n − 1), B = t 2n − nt 2 + n − 1,
C = t 2n−1 + t 2n − nt n+1 + (n − 1)t n−1 − nt + n − 1,
D = t n−1 [(n − 1)t n − nt n−1 + 1], E = (n − 1)t 2n − nt 2n−2 + 1.
Applying the AM-GM inequality to n positive numbers yields D ≥ 0 and E ≥ 0. Then,
since p + q ≤ 1/(n − 1) involves pD + qE ≥ (n − 1)(p + q)(pD + qE), it suffices to show
that
p2 A + q2 B + pqC ≤ (n − 1)(p + q)(pD + qE).
Write this inequality as
p2 A1 + q2 B1 + pqC1 ≥ 0,
where
A1 = (n − 1)D − A = nt n [(n − 2)t n−1 − (n − 1)t n−2 + 1],
B1 = (n − 1)E − B = nt 2 [(n − 2)t 2n−2 − (n − 1)t 2n−4 + 1],
C1 = (n − 1)(D + E) − C = n y[(n − 2)(t 2n−1 + t 2n−2 ) − 2(n − 1)t 2n−3 + t n + 1].
Applying the AM-GM inequality to n−1 nonnegative numbers yields A1 ≥ 0 and B1 ≥ 0.
So, it suffices to show that C1 ≥ 0. Indeed, we have

(n − 2)(t 2n−1 + t 2n−2 ) − 2(n − 1)t 2n−3 + t n + 1 = A2 + B2 + C2 ,

where
A2 = (n − 2)t 2n−1 − (n − 1)t 2n−3 + t ≥ 0,
B2 = (n − 2)t 2n−2 − (n − 1)t 2n−3 + t n−1 ≥ 0,
78 Vasile Cîrtoaje

C2 = t n − t n−1 − t + 1 = (t − 1)(t n−1 − 1) ≥ 0.

The inequalities A2 ≥ 0 and B2 ≥ 0 follows by the AM-GM inequality applied to n − 1
nonnegative numbers. This completes the proof. The equality holds for a1 = a2 = · · · =
an = 1.
1
Remark 1. For p + q = , we get the inequality
n−1
1 1 1
+ + ··· + ≤ n − 1,
1+ pa1 + qa12 1+ pa2 + qa22 1 + pan + qan2

which is a generalization of the following inequalities:

1 1 1
+ + ··· + ≤ 1,
n − 1 + a1 n − 1 + a2 n − 1 + an

1 1 1 1
+ + ≤ .
2n − 2 + a1 + a12 2n − 2 + a2 + a22 2n − 2 + an + an
2 2

Remark 2. For p = 2k and q = k2 , we get the following result.

• Let a1 , a2 , · · · , an be positive real numbers such that a1 a2 · · · an = 1. If
s
n
0<k≤ − 1,
n−1

then
1 1 1 n
+ + ··· + ≤ ,
(1 + ka1 )2 (1 + ka2 )2 (1 + kan )2 (1 + k)2
with equality for a1 = a2 = · · · = an = 1.
The following generalization holds (Vasile Cirtoaje, 2005).
1
• Let a1 , a2 , · · · , an be positive real numbers such that a1 a2 · · · an = 1. If m ≥
n−1
and  n 1/m
0<k≤ − 1,
n−1
then
1 1 1 n
+ + ··· + ≤ ,
(1 + ka1 )m (1 + ka2 )m (1 + kan )m (1 + k)m
with equality for a1 = a2 = · · · = an = 1.
Half Convex Function Method 79

P 1.54. Let a1 , a2 , . . . , an (n ≥ 3) be positive real numbers such that a1 a2 . . . an = 1. If

 n 2
0<k≤ − 1,
n−1
then
1 1 1 n
+p + ··· + p ≤p .
1 + ka1 1 + ka2 1 + kan 1+k
p

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
−1
f (u) = p , u ∈ R.
1 + keu
For u ≤ 0, we have

keu (2 − keu ) keu (2 − k)

f 00 (u) = ≥ > 0.
4(1 + keu )5/2 4(1 + keu )5/2

Therefore, f is convex on (−∞, 0]. By HCF-Theorem and Remark 5, it suffices to prove

the original inequality for a2 = · · · = an := t and a1 = 1/t n−1 , where 0 < t ≤ 1. Write
this inequality as h(t) ≤ 0, where
v
t t n−1 n−1 n
h(t) = +p −p .
t n−1 +k 1 + kt 1+k
The derivative
(n − 1)kt (n−3)/2 (n − 1)k
h0 (t) = −
2(t n−1 + k)3/2 2(kt + 1)3/2
has the same sign as
h1 (t) = t n/3−1 (kt + 1) − t n−1 − k.

Denoting m = n/3, m ≥ 1, we see that

h1 (t) = kt m + t m−1 − t 3m−1 − k = −k(1 − t m ) + t m−1 (1 − t 2m ) = (1 − t m )h2 (t),

where
h2 (t) = t m−1 + t 2m−1 − k

is strictly increasing for t ∈ (0, 1]. There are two possible cases: h2 (0) ≥ 0 and h2 (0) <
0.
80 Vasile Cîrtoaje

Case 1: h2 (0) ≥ 0. This case is possible only for m = 1 (n = 3) and k ≤ 1, when

h2 (t) = t + 1 − k > 0 for t ∈ (0, 1]. Also, we have h1 (t) > 0 and h0 (t) > 0 for t ∈ (0, 1).
Therefore, h is strictly increasing on [0, 1], hence h(t) ≤ h(1) = 0.
Case 2: h2 (0) < 0. This case is possible for either m = 1 (n = 3) and 1 < k ≤ 5/4, or
m > 1 (n ≥ 4). Since h2 (1) = 2 − k > 0, there exists t 1 ∈ (0, 1) such that h2 (t 1 ) = 0,
h2 (t) < 0 for t ∈ (0, t 1 ), and h2 (t) > 0 for t ∈ (t 1 , 1). Since h0 has the same sign as h2 on
(0, 1), it follows that h is strictly decreasing on [0, t 1 ], and strictly increasing on [t 1 , 1].
n
Therefore, h(t) ≤ min{h(0), h(1)}. Since h(0) = n − 1 − p ≤ 0 and h(1) = 0,
1+k
we have h(t) ≤ 0 for all t ∈ (0, 1]. This completes the proof. The equality holds for
a1 = a2 = · · · = an = 1.

P 1.55. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If k ≥ n2 − 1,

then
1 1 1
 ‹
a1n−1 + a2n−1 + · · · + ann−1 + n(n − 2) ≥ (n − 1) + + ··· + .
a1 a2 an

Solution. Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that

x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
f (u) = e(n−1)u − (n − 1)e−u , u ∈ R.
For u ≥ 0, we have

f 00 (u) = (n − 1)2 e(n−1)u − (n − 1)e−u = (n − 1)e−u [(n − 1)e nu − 1] ≥ 0;

therefore, f (u) is convex on [0, ∞). By HCF-Theorem and Remark 2, it suffices to show
that H(x, y) ≥ 0 for x, y ∈ R such that x + (n − 1) y = 0, where

f 0 (x) − f 0 ( y)
H(x, y) = .
x−y
From
f 0 (u) = (n − 1)[e(n−1)u + e−u ],
we get
(n − 1)(e x − e y )  (n−2)x
+ e(n−3)x+ y + · · · + e x+(n−3) y + e(n−2) y − e−x− y

H(x, y) = e
x−y
(n − 1)(e x − e y )  (n−2)x
+ e(n−3)x+ y + · · · + e x+(n−3) y ) .

= e
x−y
Half Convex Function Method 81

Since (e x − e y )/(x − y) > 0, we have H(x, y) > 0. The equality holds for a1 = a2 =
· · · = an = 1.

P 1.56. Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 . . . an = 1. If k ≥ n, then

1 1 1
 ‹
a1k + a2k + · · · + ank + kn ≥ (k + 1) + + ··· + .
a1 a2 an
(Vasile Cirtoaje, 2006)
Solution. Using the substitutions ai = e xi
for i = 1, 2, . . . , n, we need to show that
x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
f (u) = e ku − (k + 1)e−u , u ∈ R.
For u ≥ 0, we have
f 00 (u) = k2 e ku − (k + 1)e−u = e−u k2 e(k+1)u − k − 1 ≥ e−u (k2 − k − 1) > 0;
 

therefore, f is convex on [0, ∞). By HCF-Theorem and Remark 5, it suffices to to prove

the original inequality for a2 = · · · = an := b ≥ 1 and a1 := a ≤ 1, a b n−1 = 1; that is
k + 1 (k + 1)(n − 1)
a k + (n − 1)b k −
− + kn ≥ 0.
a b
By the weighted AM-GM inequality, we have
1 k(n − 1)
a k + (kn − k − 1) ≥ [1 + (kn − k − 1)](a k ) 1+(kn−k−1) = .
b
Then, we still have to show that
1 1
 ‹  ‹
k
(n − 1) b − − (k + 1) − 1 ≥ 0,
b a
which is equivalent to h(b) ≥ 0 for b ≥ 1, where
h(b) = (n − 1)(b k+1 − 1) − (k + 1)(b n − b).
Since
h0 (b)
= (n − 1)b k − nb n−1 + 1 ≥ (n − 1)b n − nb n−1 + 1
k+1
= nb n−1 (b − 1) − (b n − 1)
 
= (b − 1) (b n−1 − b n−2 ) + (b n−1 − b n−3 ) + · · · + (b n−1 − 1) ≥ 0,
h is increasing on [1, ∞), hence h(b) ≥ h(1) = 0. The proof is completed. The equality
holds for a1 = a2 = · · · = an = 1.
82 Vasile Cîrtoaje

P 1.57. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 . . . an = 1, then

1 a1 1 a2 1 an
 ‹  ‹  ‹
1− + 1− + ··· + 1 − ≤ n − 1.
n n n
(Vasile Cîrtoaje, 2006)
Solution. Let
n
k= , k > 1,
n−1
and
m = ln k, 0 < m ≤ ln 2 < 1.
Using the substitutions ai = e x i for i = 1, 2, . . . , n, we need to show that
x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
u
f (u) = −k−e , u ∈ R.
From
u
f 00 (u) = meu k−e (1 − meu ),
it follows that f 00 (u) > 0 for u ≤ 0, since
1 − meu ≥ 1 − m ≥ 1 − ln 2 > 0.
Therefore, f is convex on (−∞, 0]. By HCF-Theorem and Remark 5, it suffices to prove
the original inequality for a2 = · · · = an := t and a1 = t −n+1 , where 0 < t ≤ 1. Write
this inequality as
h(t) ≤ n − 1,
where
−n+1
h(t) = k−t + (n − 1)k−t , t ∈ (0, 1].
We have
−n+1 −n+1
h0 (t) = (n − 1)mt −n k−t h1 (t), h1 (t) = 1 − t n k−t −t
,
−n+1
h01 (t) = k−t −t
h2 (t), h2 (t) = [m(n − 1 + t n ) − nt n−1 ,
h02 (t) = nt n−2 (mt − n + 1) ≤ nt n−2 (m − n + 1) ≤ nt n−2 (m − 1) < 0,
hence h2 is strictly decreasing on [0, 1]. Since h2 (0) = (n − 1)m > 0 and h2 (1) =
n(m − 1) < 0, there is t 1 ∈ (0, 1) such that h2 (t 1 ) = 0, h2 (t) > 0 for t ∈ [0, t 1 ) and
h2 (t) < 0 for t ∈ (t 1 , 1]. Therefore, h1 is strictly increasing on (0, t 1 ] and is strictly
decreasing on [t 1 , 1]. Since lim t→0 h1 (u) = −∞ and h1 (1) = 0, there is t 2 ∈ (0, t 1 ) such
that h1 (t 2 ) = 0, h1 (t) < 0 for t ∈ (0, t 2 ) and h1 (t) > 0 for t ∈ (t 2 , 1). Thus, h is strictly
decreasing on (0, t 2 ] and is strictly increasing on [t 2 , 1]. Since lim t→0 h(u) = n − 1 and
h(1) = n − 1, we have h(t) ≤ n − 1 for all t ∈ (0, 1]. This completes the proof. The
equality holds for a1 = a2 = · · · = an = 1.
Half Convex Function Method 83

P 1.58. If a, b, c are positive real numbers such that a bc = 1, then

1 1 1
p + p + p ≤ 1.
1 + 1 + 3a 1 + 1 + 3b 1 + 1 + 3c
(Vasile Cîrtoaje, 2008)

Solution. Using the substitution

a = e−x , b = e− y , c = e−z ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where
−3 p
f (u) = p = eu − e2u + 3eu , u ∈ R.
1 + 1 + 3e−u
For u ≥ 0, which involves t = eu ≥ 1, we have

4t 2 + 18t + 9
 
00
f (u) = t 1 − p >0
4(t + 3) t(t + 3)

since
16t(t + 3)3 − (4t 2 + 18t + 9)2 = 9(4t 2 + 12t − 9) > 0.
Therefore, f is half convex for u ≥ 0. By HCF-Theorem, it suffices to prove that f (x) +
2 f ( y) ≥ 3 f (0), where x, y ∈ R such that x + 2 y = 0. Substituting a = e x and b = e y ,
we need to show that
p p
a − a2 + 3a + 2(b − b2 + 3b ) ≥ −3,

where a, b > 0 such that a b2 = 1. Write this inequality as

p p
2b3 + 3b2 + 1 ≥ 3b2 + 1 + 2b2 b2 + 3b.

Squaring and dividing by b2 , the inequality becomes

Æ
9b2 + 4b + 3 ≥ 4 (b2 + 3b)(3b2 + 1).

Since Æ
2 (b2 + 3b)(3b2 + 1) ≤ (b2 + 3b) + (3b2 + 1) = 4b2 + 3b + 1,
we get
Æ
9b2 + 4b + 3 − 4 (b2 + 3b)(3b2 + 1) ≥ 9b2 + 4b + 3 − 2(4b2 + 3b + 1) = (b − 1)2 ≥ 0.
84 Vasile Cîrtoaje

The equality holds for a = b = c = 1.

Remark. Similarly, we can prove the following generalization.
• Let a1 , a2 , . . . , an be positive real numbers such that a1 a2 · · · an = 1. If

4n
0<k≤ ,
(n − 1)2

then
1 1 1 n
+ ··· + ≤ p .
1+ 1 + ka1 1 + 1 + ka2 1+ 1 + kan 1+ 1+k
p p p

P 1.59. If a1 , a2 , . . . , an are positive real numbers such that a1 a2 · · · an = 1, then

1 1 1 1
+ ··· + ≥ .
1+ 1 + 4n(n − 1)a1 1 + 1 + 4n(n − 1)a2 1+ 1 + 4n(n − 1)an
p p p
2

(Vasile Cîrtoaje, 2008)

Solution. Let k = 4n(n − 1), k ≥ 8. Using the substitutions ai = e−x i for i = 1, 2, . . . , n,

we need to show that
x1 + x2 + · · · + x n
f (x 1 ) + f (x 2 ) + · · · + f (x n ) ≥ n f (s), s= = 0,
n
where
k p
f (u) = p = e2u + keu − eu , u ∈ R.
1 + 1 + ke−u
For u ≤ 0, which involves t = eu ∈ (0, 1], we have

4t 2 + 6kt + k2
 
00
f (u) = t p −1 >0
4(t + k) t(t + k)

since

(4t 2 + 6kt + k2 )2 − 16t(t + k)3 = k2 (k2 − 4kt − 4t 2 ) ≥ k2 (k2 − 4k − 4) > 0.

Therefore, f is convex on (−∞, 0]. By HCF-Theorem, it suffices to prove that f (x) +

(n − 1) f ( y) ≥ n f (0), where x, y ∈ R such that x + (n − 1) y = 0. Substituting a = e x
and b = e y , we need to show that
p p p
a2 + ka − a + (n − 1)( b2 + k b − b) ≥ n( 1 + k − 1),
Half Convex Function Method 85

where a, b > 0 such that a b n−1 = 1. Write this inequality as

Æ Æ
4n(n − 1)b n−1 + 1 + (n − 1) 4n(n − 1)b2n−1 + b2n ≥ (n − 1)b n + 2n(n − 1)b n−1 + 1.

By Minkowski’s inequality, we have

Æ Æ
4n(n − 1)b n−1 + 1 + (n − 1) 4n(n − 1)b2n−1 + b2n ≥
Æ
≥ 4n(n − 1)b n−1 [1 + (n − 1)b n/2 ]2 + [1 + (n − 1)b n ]2 .
Thus, it suffices to show that

4n(n − 1)b n−1 [1 + (n − 1)b n/2 ]2 + [1 + (n − 1)b n ]2 ≥ [(n − 1)b n + 2n(n − 1)b n−1 + 1]2 ,

which is equivalent to
3n−2 n n−2
” —
4n(n − 1)2 b 2 2 + (n − 2)b 2 − nb 2 ≥ 0.

This inequality follows immediately by the AM-GM inequality. Thus, the proof is com-
pleted. The equality holds for a1 = a2 = · · · = an = 1.

P 1.60. If a, b, c are positive real numbers such that a bc = 1, then

a6 b6 c6
+ + ≥ 1.
1 + 2a5 1 + 2b5 1 + 2c 5
(Vasile Cîrtoaje, 2008)

Solution. Using the substitution

a = ex , b = ey, c = ez ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where
e6u
f (u) = , u ∈ R.
1 + 2e5u
For u ≤ 0, which involves w = eu ∈ (0, 1], we have

2w6 (2 − w5 )(9 − 2w5 )

f 00 (u) = > 0.
(1 + 2w5 )3
86 Vasile Cîrtoaje

Therefore, f is convex for u ≤ 0. By HCF-Theorem, it suffices to prove the original

inequality for b = c := t and a = 1/t 2 , where t > 0; that is,

1 2t 6
+ ≥ 1.
t 2 (t 10 + 2) 1 + 2t 5

Since
1 + 2t 5 ≤ 1 + t 4 + t 6 ,
it suffices to show that

1 2x 3 p
+ ≥ 1, x= t.
x(x 5 + 2) 1 + x 2 + x 3

This inequality can be written as follows:

x 3 (x 6 − x 5 − x 3 + 2x − 1) + (x − 1)2 ≥ 0,

x 3 (x − 1)2 (x 4 + x 3 + x 2 − 1) + (x − 1)2 ≥ 0,
(x − 1)2 [x 7 + x 5 + (x 6 − x 3 + 1)] ≥ 0.
Clearly, the last inequality is true. The equality holds for a = b = c = 1.

P 1.61. If a, b, c are positive real numbers such that a bc = 1, then

p p p
25a2 + 144 + 25b2 + 144 + 25c 2 + 144 ≤ 5(a + b + c) + 24.

(Vasile Cîrtoaje, 2008)

Solution. Using the substitution

a = ex , b = ey, c = ez ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where p
f (u) = 5eu − 25e2u + 144, u ∈ R.
We will show that f is convex for u ≤ 0. From

5w(25w2 + 288)
 
00
f (u) = 5w 1 − , w = eu ∈ (0, 1],
(25w2 + 144)3/2
Half Convex Function Method 87

we need to show that

(25w2 + 144)3 ≥ 25w2 (25w2 + 288)2 .

Setting 25w2 = 144z, z ∈ (0, 25/144], we have

(25w2 +144)3 −25w2 (25w2 +288)2 = 1443 (z+1)3 −1443 z(z+2)2 = 1443 (1−z−z 2 ) > 0.

By HCF-Theorem, it suffices to prove the original inequality for a = t 2 and b = c = 1/t,

where t > 0; that is,
p p
5t 3 + 24t + 10 ≥ 25t 6 + 144t 2 + 2 25 + 144t 2 .

Squaring and dividing by 4t give

Æ
60t 3 + 25t 2 − 36t + 120 ≥ (25t 4 + 144)(144t 2 + 25).

Squaring again and dividing by 120, the inequality becomes

25t 5 − 36t 4 + 105t 3 − 112t 2 − 72t + 90 ≥ 0,

(t − 1)2 (25t 3 + 14t 2 + 108t + 90) ≥ 0.

Since the last inequality is true, the proof is completed. The equality holds for a = b =
c = 1.

P 1.62. If a, b, c are positive real numbers such that a bc = 1, then

p p p
16a2 + 9 + 16b2 + 9 + 16c 2 + 9 ≥ 4(a + b + c) + 3.

(Vasile Cîrtoaje, 2008)

Solution. Using the substitution

a = ex , b = ey, c = ez ,

we need to show that

x + y +z
f (x) + f ( y) + f (z) ≥ 3 f (s), s= = 0,
3
where p
f (u) = 16e2u + 9 − 4eu , u ∈ R.
88 Vasile Cîrtoaje

We will show that f is convex for u ≥ 0. From

2
+
 
4w(16w 18)
f 00 (u) = 4w −1 , w = eu ≥ 1,
(16w2 + 9)3/2

we need to show that

16w2 (16w2 + 18)2 ≥ (16w2 + 9)3 .
Setting 16w2 = 9z, z ≥ 16/9, we have
Indeed,

16w2 (16w2 + 18)2 − (16w2 + 9)3 = 729z(z + 2)2 − 729(z + 1)3 = 729(z 2 + z − 1) > 0.

By HCF-Theorem, it suffices to prove the original inequality for a = t 2 and b = c = 1/t,

where t > 0; that is,
p p
16a6 + 9a2 + 2 16 + 9a2 ≥ 4t 3 + 3t + 8.

Squaring and dividing by 4a give

Æ
(16a4 + 9)(9a2 + 16) ≥ 6a3 + 16a2 − 9a + 12.

Squaring again and dividing by 12a, the inequality becomes

9a5 − 16a4 + 9a3 + 12a2 − 32a + 18 ≥ 0,

(a − 1)2 (9a3 + 2a2 + 4a + 18) ≥ 0.

Since the last inequality is true, the proof is completed. The equality holds for a = b =
c = 1.

P 1.63. If a, b, c are nonnegative real numbers such that a + b + c = 12, then

(a2 + 10)(b2 + 10)(c 2 + 10) ≥ 13310.

(Vasile Cîrtoaje, 2006)

Solution. Let
f (u) = ln(u2 + 10), u ∈ [0, ∞).
From
2(10 − u2 )
f 00 (u) = ,
(u2 + 10)2
Half Convex Function Method 89

p p
it follows that f is convex on [0, 10] and concave on [ 10, ∞). According to LCRCF-
Theorem, the sum f (a) + f (b) + f (c) is minimum when two of a, b, c are equal. There-
fore, it suffices to prove the original inequality for b = c. So, we need to show that

(a2 + 10)(b2 + 10)2 ≥ 13310

for a + 2b = 12. Write this inequality as follows:

[(12 − 2b)2 + 10](b2 + 10)2 ≥ 13310,

(2b2 − 24b + 77)(b4 + 20b2 + 100) ≥ 6655,

2b6 − 24b5 + 117b4 − 480b3 + 1740b2 − 2400b + 1045 ≥ 0,

(b − 1)2 (2b4 − 20b3 + 75b2 − 310b + 1045) ≥ 0,

(b − 1)2 [2b2 (b − 5)2 + 5(5b2 − 62b + 209)] ≥ 0.

The last inequality is true since

‹2
31 84

2
5b − 62b + 209 = 5 b − + > 0.
5 5

The proof is completed. The equality holds for a = 10 and b = c = 1 (or any cyclic
permutation).
Remark. Similarly, we can prove the following generalization.
• If a1 , a2 , . . . , an are nonnegative real numbers such that a1 + a2 + · · · + an = 2n(n − 1),
then
(a12 + k)(a22 + k) · · · (an2 + k) ≥ k(k + 1)n , k = (n − 1)(2n − 1).

The equality holds for a1 = k and a2 = · · · = an = 1 (or any cyclic permutation).

P 1.64. Let a, b, c be nonnegative real numbers. If

ln 2
k0 ≤ k ≤ 3, k0 = ≈ 1.71,
ln 3 − ln 2

then
‹k+1
a+b+c

k k k
a (b + c) + b (c + a) + c (a + b) ≤ 2 .
2
90 Vasile Cîrtoaje

Solution. Due to homogeneity, we may assume that a + b + c = 2. Write the inequality

as
f (a) + f (b) + f (c) ≤ 2,

where
f (u) = uk (2 − u), u ∈ [0, ∞).

From
f 00 (u) = kuk−2 [2k − 2 − (k + 1)u],
2k − 2 2k − 2
• ˜ • ˜
it follows that therefore, f is convex on 0, and concave on , 2 . By
k+1 k+1
LCRCF-Theorem, the sum f (a) + f (b) + f (c) is maximum when a = 0 or 0 < a ≤ b = c.

Case 1: a = 0. We need to show that

bc(b k−1 + c k−1 ) ≤ 2

for b + c = 2. Since 0 < (k − 1)/2 ≤ 1, Bernoulli’s inequality gives

k−1 2 k−1 2
b k−1 + c k−1 = (b2 )(k−1)/2 + (c 2 )(k−1)/2 ≤ 1 + (b − 1) + 1 + (b − 1)
2 2
k−1 2
=3−k+ (b + c 2 ).
2

Thus, it suffices to show that

k−1
(3 − k)bc + bc(b2 + c 2 ) ≤ 2.
2
Since ‹2
b+c

bc ≤ = 1,
2
we only need to show that
bc(b2 + c 2 ) ≤ 2.

Indeed, we have

8[2 − bc(b2 + c 2 )] = (b + c)4 − 8bc(b2 + c 2 ) = (b − c)4 ≥ 0.

Case 2: 0 < a ≤ b = c. We only need to prove the original homogeneous inequality for
b = c = 1 and 0 < a ≤ 1; that is,
 a k+1
1+ − a k − a − 1 ≥ 0.
2
Half Convex Function Method 91

 a k+1
Since 1 + is increasing and a k is decreasing when k increases, it suffices to prove
2
that g(a) ≥ 0 for 0 < a ≤ 1, where
 a k0 +1
g(a) = 1 + − a k0 − a − 1.
2

We have
k0 + 1  a k0
g 0 (a) = 1+ − k0 a k0 −1 − 1,
2 2
1 00 k0 + 1  a k0 k0 − 1
g (a) = 1+ − 2−k .
k0 4 2 a 0

Since g 00 is increasing on (0, 1], lim x→0 g 00 (a) = −∞ and

1 00 k0 + 1 3 k0 k0 + 1 3 − k0
 ‹
g (1) = − k0 + 1 = − k0 + 1 = > 0,
k0 4 2 2 2

there exists a1 ∈ (0, 1) such that g 00 (a1 ) = 0, g 00 (a) < 0 for a ∈ (0, a1 ), and g 00 (a) > 0
for a ∈ (a1 , 1]. Therefore, g 0 is strictly decreasing on [0, a1 ] and strictly increasing on
k0 − 1 k0 + 1 
[a1 , 1]. Since g 0 (0) = > 0 and g 0 (1) =

(3/2)k0 − 2 = 0, there exists
2 2
a2 ∈ (0, a1 ) such that g 0 (a2 ) = 0, g 0 (a) > 0 for a ∈ [0, a2 ), and g 0 (a) < 0 for a ∈ (a2 , 1).
Thus, g is strictly increasing on [0, a2 ], and strictly decreasing on [a2 , 1]. Consequently,

g(a) ≥ min{g(0), g(1)},

and from
g(0) = 0, g(1) = (3/2)k0 +1 − 3 = 0,

we get g(a) ≥ 0.
This completes the proof. The equality holds for a = 0 and b = c (or any cyclic permu-
tation). If k = k0 , then the equality holds also for a = b = c.

P 1.65. If a1 , a2 , . . . , an are positive real numbers such that a1 + a2 + · · · + an = n, then

1 1 1
 ‹
2
(n + 1) + + ··· + ≥ 4(n + 2)(a12 + a22 + · · · + an2 ) + n(n2 − 3n − 6).
a1 a2 an

(Vasile Cîrtoaje, 2006)

92 Vasile Cîrtoaje

Solution. Write the inequality as

f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n(n2 − 3n − 6),

where
(n + 1)2
f (u) = − 4(n + 2)u2 , u ∈ (0, ∞).
u
From
2(n + 1)2
f 00 (u) = − 8(n + 2),
u3
it follows that f is strictly convex on (0,c] and strictly concave on [c, ∞), where
v
3 (n + 1)
t 2
c= .
4(n + 2)

According to LCRCF-Theorem and Remark 6, it suffices to consider the case

a1 = a2 = · · · = an−1 = x, 0 < x ≤ 1, an = n − (n − 1)x,

when the inequality becomes as follows:

2 n−1 1
 ‹
(n + 1) + ≥ 4(n + 2)[(n − 1)x 2 + an2 ) + n(n2 − 3n − 6),
x an

n(n − 1)(2x − 1)2 [(n + 2)(n − 1)x 2 − (n + 2)(2n − 1)x + (n + 1)2 ] ≥ 0.

The last inequality is true since
‹2
2n − 1 3(n − 2)

2 2
(n+2)(n−1)x −(n+2)(2n−1)x +(n+1) = (n+2)(n−1) x − + ≥ 0.
2n − 2 4(n − 1)

1 n+1
The equality holds for a1 = a2 = · · · = an−1 = and an = (or any cyclic permu-
2 2
tation).
Chapter 2

Partially Convex Function Method

2.1 Theoretical Basis

93
94 Vasile Crtoaje

2.2 Applications
Partially Convex Function Method 95

2.3 Solutions
96 Vasile Crtoaje
Chapter 3

Half Convex Function Method for

Ordered Variables

3.1 Theoretical Basis

97
98 Vasile Cîrtoaje

3.2 Applications
HCF Method for Ordered Variables 99

3.3 Solutions
100 Vasile Cîrtoaje
Chapter 4

Partially Convex Function Method

for Ordered Variables

4.1 Theoretical Basis

101
102 Vasile Cîrtoaje

4.2 Applications
PCF Method for Ordered Variables 103

4.3 Solutions
104 Vasile Cîrtoaje
Chapter 5

Equal Variable Method for

Nonnegative Variables

5.1 Theoretical Basis

105
106 Vasile Cîrtoaje

5.2 Applications
EV Method for Nonnegative Variables 107

5.3 Solutions
108 Vasile Cîrtoaje
Chapter 6

Equal Variable Method for Real

Variables

6.1 Theoretical Basis

109
110 Vasile Cîrtoaje

6.2 Applications
EV Method for Real Variables 111

6.3 Solutions
112 Vasile Cîrtoaje
Chapter 7

Arithmetic Compensation Method

7.1 Theoretical Basis

113
114 Vasile Cîrtoaje

7.2 Applications
Arithmetic Compensation Method 115

7.3 Solutions
116 Vasile Cîrtoaje
Chapter 8

Cyclic Homogeneous Polynomial

Inequalities in Real Variables

8.1 Theoretical Basis

117
118 Vasile Cîrtoaje

8.2 Applications
CHP Inequalities in Real Variables 119

8.3 Solutions
120 Vasile Cîrtoaje
Chapter 9

Cyclic Homogeneous Polynomial

Inequalities in Nonnegative
Variables

9.1 Theoretical Basis

121
122 Vasile Cîrtoaje

9.2 Applications
CHP Inequalities in Nonnegative Variables 123

9.3 Solutions
124 Vasile Cîrtoaje
Chapter 10

Symmetric Homogeneous
Polynomial Inequalities in Real
Variables

10.1 Theoretical Basis

125
126 Vasile Cîrtoaje

10.2 Applications
SHP Inequalities in Real Variables 127

10.3 Solutions
128 Vasile Cîrtoaje
Chapter 11

Symmetric Homogeneous
Polynomial Inequalities in
Nonnegative Variables

11.1 Theoretical Basis

129
130 Vasile Cîrtoaje

11.2 Applications
SHP Inequalities in Nonnegative Variables 131

11.3 Solutions
132 Vasile Cîrtoaje
Chapter 12

Best Upper Bound of Jensen’s

Difference

12.1 Theoretical Basis

133
134 Vasile Cîrtoaje

12.2 Applications
Best Upper Bound of Jensen’s Difference 135

12.3 Solutions
136 Vasile Cîrtoaje
Appendix A

Glossary

1. AM-GM (ARITHMETIC MEAN-GEOMETRIC MEAN) INEQUALITY

If a1 , a2 , · · · , an are nonnegative real numbers, then

a1 + a2 + · · · + an ≥ n n a1 a2 · · · an ,
p

with equality if and only if a1 = a2 = · · · = an .

ƒ
2. WEIGHTED AM-GM INEQUALITY
Let p1 , p2 , · · · , pn be positive real numbers satisfying

p1 + p2 + · · · + pn = 1.

If a1 , a2 , · · · , an are nonnegative real numbers, then

p p
p1 a1 + p2 a2 + · · · + pn an ≥ a1 1 a2 2 · · · anpn ,

with equality if and only if a1 = a2 = · · · = an .

ƒ
3. AM-HM (ARITHMETIC MEAN-HARMONIC MEAN) INEQUALITY
If a1 , a2 , · · · , an are positive real numbers, then

1 1 1
 ‹
(a1 + a2 + · · · + an ) + + ··· + ≥ n2 ,
a1 a2 an

with equality if and only if a1 = a2 = · · · = an .

137
138 Vasile Cîrtoaje

4. POWER MEAN INEQUALITY

The power mean of order k of positive real numbers a1 , a2 , · · · , an , that is

1
a1 +a2 +···+ank k
 k k
, k=


 n 6 0
Mk = p ,



n
a a
1 2 · · · a n , k = 0

is an increasing function with respect to k ∈ R. For instant, M2 ≥ M1 ≥ M0 ≥ M−1 is

equivalent to
v
t a1 + a22 + · · · + an2
u 2
a1 + a2 + · · · + an p n
≥ ≥ n a1 a2 · · · an ≥ .
n n 1 1 1
+ + ··· +
a1 a2 an

ƒ
5. BERNOULLI’S INEQUALITY
For any real number x ≥ −1, we have
a) (1 + x) r ≥ 1 + r x for r ≥ 1 and r ≤ 0;
b) (1 + x) r ≤ 1 + r x for 0 ≤ r ≤ 1.
In addition, if a1 , a2 , · · · , an are real numbers such that either a1 , a2 , · · · , an ≥ 0 or −1 ≤
a1 , a2 , · · · , an ≤ 0, then

(1 + a1 )(1 + a2 ) · · · (1 + an ) ≥ 1 + a1 + a2 + · · · + an .

ƒ
6. SCHUR’S INEQUALITY
For any nonnegative real numbers a, b, c and any positive number k, the inequality
holds
a k (a − b)(a − c) + b k (b − c)(b − a) + c k (c − a)(c − b) ≥ 0,
with equality for a = b = c, and for a = 0 and b = c (or any cyclic permutation).
For k = 1, we get the third degree Schur’s inequality, which can be rewritten as follows

a3 + b3 + c 3 + 3a bc ≥ a b(a + b) + bc(b + c) + ca(c + a),

(a + b + c)3 + 9a bc ≥ 4(a + b + c)(a b + bc + ca),

9a bc
a2 + b2 + c 2 + ≥ 2(a b + bc + ca),
a+b+c
(b − c)2 (b + c − a) + (c − a)2 (c + a − b) + (a − b)2 (a + b − c) ≥ 0.
Glossary 139

For k = 2, we get the fourth degree Schur’s inequality, which holds for any real numbers
a, b, c, and can be rewritten as follows

a4 + b4 + c 4 + a bc(a + b + c) ≥ a b(a2 + b2 ) + bc(b2 + c 2 ) + ca(c 2 + a2 ),

(b − c)2 (b + c − a)2 + (c − a)2 (c + a − b)2 + (a − b)2 (a + b − c)2 ≥ 0,

6a bc p ≥ (p2 − q)(4q − p2 ),
where p = a + b + c, q = a b + bc + ca.
A generalization of the fourth degree Schur’s inequality, which holds for any real num-
bers a, b, c and any real number m, is the following (Vasile Cirtoaje, 2004):
X
(a − mb)(a − mc)(a − b)(a − c) ≥ 0,

where the equality holds for a = b = c, and for a/m = b = c (or any cyclic permutation).
This inequality is equivalent to
X X X X
a4 + m(m + 2) a2 b2 + (1 − m2 )a bc a ≥ (m + 1) a b(a2 + b2 ),
X
(b − c)2 (b + c − a − ma)2 ≥ 0.
Another generalization of the fourth degree Schur’s inequality (Vasile Cirtoaje, 2004):
Let α, β, γ be real numbers such that

1 + α + β = 2γ.

The inequality
X X X X
a4 + α a2 b2 + β a bc a≥γ a b(a2 + b2 )

holds for any real numbers a, b, c if and only if

1 + α ≥ γ2 .

ƒ
7. CAUCHY-SCHWARZ INEQUALITY
For any real numbers a1 , a2 , · · · , an and b1 , b2 , · · · , bn we have

(a12 + a22 + · · · + an2 )(b12 + b22 + · · · + bn2 ) ≥ (a1 b1 + a2 b2 + · · · + an bn )2 ,

with equality if and only if ai and bi are proportional for all i.

ƒ
140 Vasile Cîrtoaje

8. HÖLDER’S INEQUALITY
If x i j (i = 1, 2, · · · , m; j = 1, 2, · · · n) are nonnegative real numbers, then
! v !m
m
Y n
X n uY
X m
m
xi j ≥ .
t
xi j
i=1 j=1 j=1 i=1

ƒ
9. CHEBYSHEV’S INEQUALITY
Let a1 ≥ a2 ≥ · · · ≥ an be real numbers.

a) If b1 ≥ b2 ≥ · · · bn , then
n n n
‚ Œ‚ Œ
X X X
n ai bi ≥ ai bi ;
i=1 i=1 i=1

b) If b1 ≤ b2 ≤ · · · ≤ bn , then
n n n
‚ Œ‚ Œ
X X X
n ai bi ≤ ai bi .
i=1 i=1 i=1

ƒ
10. MINKOWSKI’S INEQUALITY
For any real number k ≥ 1 and any positive real numbers a1 , a2 , · · · , an and b1 , b2 , · · · , bn ,
the inequalities hold
 1
Œk Œk k
n n n
‚ ‚
X
1 X X
aik + bi k k
≥ ai + bi  ;
i=1 i=1 i=1

 1
Œk Œk Œk k
n n n n
‚ ‚ ‚
X
1 X X X
aik + bik + ci
k k
≥ ai + bi + ci  .
i=1 i=1 i=1 i=1

ƒ
11. REARRANGEMENT INEQUALITY
(1) If a1 , a2 , · · · , an and b1 , b2 , · · · , bn are two increasing (or decreasing) real se-
quences, and (i1 , i2 , · · · , in ) is an arbitrary permutation of (1, 2, · · · , n), then

a1 b1 + a2 b2 + · · · + an bn ≥ a1 bi1 + a2 bi2 + · · · + an bin

Glossary 141

and
n(a1 b1 + a2 b2 + · · · + an bn ) ≥ (a1 + a2 + · · · + an )(b1 + b2 + · · · + bn ).
(2) If a1 , a2 , · · · , an is decreasing and b1 , b2 , · · · , bn is increasing, then

a1 b1 + a2 b2 + · · · + an bn ≤ a1 bi1 + a2 bi2 + · · · + an bin

and
n(a1 b1 + a2 b2 + · · · + an bn ) ≤ (a1 + a2 + · · · + an )(b1 + b2 + · · · + bn ).
(3) Let b1 , b2 , · · · , bn and c1 , c2 , · · · , cn be two real sequences such that

b1 + · · · + bk ≥ c1 + · · · + ck , k = 1, 2, · · · , n.

If a1 ≥ a2 ≥ · · · ≥ an ≥ 0, then

a1 b1 + a2 b2 + · · · + an bn ≥ a1 c1 + a2 c2 + · · · + an cn .

Notice that all these inequalities follow immediately from the identity
!
X n n
X i
X i
X
ai (bi − ci ) = (ai − ai+1 ) bj − cj ,
i=1 i=1 j=1 j=1

where an+1 = 0.

ƒ
12. MACLAURIN’S INEQUALITY and NEWTON’S INEQUALITY
If a1 , a2 , . . . , an are nonnegative real numbers, then

S1 ≥ S2 ≥ · · · ≥ S n (M acl aur in)

and
Sk2 ≥ Sk−1 Sk+1 , (N ewt on)
where
v X
u
u
u a i1 a i2 · · · a i k
k 1≤i1 <···<ik ≤n
Sk = u
u
 ‹ .
t n
k
ƒ
142 Vasile Cîrtoaje

13. CONVEX FUNCTIONS

A function f defined on a real interval I is said to be convex if

f (αx + β y) ≤ α f (x) + β f ( y)

for all x, y ∈ I and any α, β ≥ 0 with α + β = 1. If the inequality is reversed, then f is

said to be concave.
If f is differentiable on I, then f is (strictly) convex if and only if the derivative f 0 is
(strictly) increasing. If f 00 ≥ 0 on I, then f is convex on I. Also, if f 00 ≥ 0 on (a, b) and
f is continuous on [a, b], then f is convex on [a, b].
A function f : I → R is half convex on a real interval I if there exists a point s ∈ I such
that f is convex on Iu≤s or Iu≥s .
A function f : I → R is right partially convex related to a a point s ∈ I if there exists a
number s0 ∈ I, s0 > s, such that f is convex on Iu∈[s,s0 ] . Also, a function f : I → R is left
partially convex related to a point s ∈ I if there exists a point s0 ∈ I, s0 < s, such that f
is convex on Iu∈[s0 ,s] .
Jensen’s inequality. Let p1 , p2 , . . . , pn be positive real numbers. If f is a convex function
on a real interval I, then for any a1 , a2 , . . . , an ∈ I, the inequality holds

p1 f (a1 ) + p2 f (a2 ) + · · · + pn f (an ) p1 a1 + p2 a2 + · · · + pn an

 ‹
≥f .
p1 + p2 + · · · + p n p1 + p2 + · · · + p n
For p1 = p2 = · · · = pn , Jensen’s inequality becomes
a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f .
n
Based on the following three theorems, we can extend this form of Jensen’s in-
equality to half or partially convex functions.
Half Convex Function-Theorem (Vasile Cirtoaje, 2004). Let f (u) be a function defined
on a real interval I and convex on Iu≤s or Iu≥s , where s ∈ I. The inequality
a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f
n
holds for all a1 , a2 , . . . , an ∈ I satisfying a1 + a2 + . . . + an = ns if and only if

f (x) + (n − 1) f ( y) ≥ n f (s)

for all x, y ∈ I such that x + (n − 1) y = ns.

Right Partially Convex Function-Theorem (Vasile Cirtoaje, 2012). Let f be a function
defined on a real interval I and convex on [s, s0 ], where s, s0 ∈ I, s < s0 . In addition, f is
decreasing on Iu≤s0 and
min f (u) = f (s0 ).
u≥s
Glossary 143

The inequality
a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f
n
holds for all a1 , a2 , · · · , an ∈ I satisfying a1 + a2 + · · · + an = ns if and only if

f (x) + (n − 1) f ( y) ≥ n f (s)

for all x, y ∈ I such that x ≤ s ≤ y and x + (n − 1) y = ns.

Left Partially Convex Function-Theorem (Vasile Cirtoaje, 2012). Let f be a function
defined on a real interval I and convex on [s0 , s], where s0 , s ∈ I, s0 < s. In addition, f is
increasing on Iu≥s0 and satisfies

min f (u) = f (s0 ).

u≤s

The inequality
a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ n f
n
holds for all x 1 , x 2 , · · · , x n ∈ I satisfying a1 + a2 + · · · + an = ns if and only if

f (x) + (n − 1) f ( y) ≥ n f (s)

for all x, y ∈ I such that x ≥ s ≥ y and x + (n − 1) y = ns.

In all these theorems, we may replace the hypothesis condition

f (x) + (n − 1) f ( y) ≥ n f (s),

by the equivalent condition

h(x, y) ≥ 0 for all x, y ∈ I such that x + (n − 1) y = ns,
where
g(x) − g( y) f (u) − f (s)
h(x, y) = , g(u) = .
x−y u−s
The following theorem is also useful to prove some symmetric inequalities.
Left Convex-Right Concave Function Theorem (Vasile Cirtoaje, 2004). Let a < c be
real numbers, let f be a continuous function on I = [a, ∞), strictly convex on [a, c] and
strictly concave on [c, ∞), and let

E(a1 , a2 , . . . , an ) = f (a1 ) + f (a2 ) + · · · + f (an ).

If a1 , a2 , . . . , an ∈ I such that

a1 + a2 + · · · + an = S = const ant,
144 Vasile Cîrtoaje

then
(a) E is minimum for a1 = a2 = · · · = an−1 ≤ an ;
(b) E is maximum for either a1 = a or a < a1 ≤ a2 = · · · = an .
On the other hand, it is known the following result concerning the best upper bound
of Jensen’s difference.
Best Upper Bound of Jensen’s Difference-Theorem (Vasile Cirtoaje, 1989). Let p1 , p2 , · · · , pn
be fixed positive real numbers, and let f be a convex function on a closed interval I = [a, b].
If a1 , a2 , · · · , an ∈ I, then Jensen’s difference

p1 f (a1 ) + p2 f (a2 ) + · · · + pn f (an ) p1 a1 + p2 a2 + · · · + pn an

 ‹
D= −f
p1 + p2 + · · · + p n p1 + p2 + · · · + pn

is maximum when some of ai are equal to a, and the others ai are equal to b; that is, when
all ai ∈ {a, b}.
ƒ

14. KARAMATA’S MAJORIZATION INEQUALITY

−
→
We say that a vector A = (a1 , a2 , . . . , an ) with a1 ≥ a2 ≥ · · · ≥ an majorizes a vector
−
→
B = (b1 , b2 , . . . , bn ) with b1 ≥ b2 ≥ · · · ≥ bn , and write it as
−
→ − →
A ≥ B,

if
a1 ≥ b1 ,
a1 + a2 ≥ b1 + b2 ,
·····················
a1 + a2 + · · · + an−1 ≥ b1 + b2 + · · · + bn−1 ,
a1 + a2 + · · · + an = b1 + b2 + · · · + bn .
Let f be a convex function on a real interval I. If a decreasingly ordered vector
−
→
A = (a1 , a2 , . . . , an ), ai ∈ I,

majorizes a decreasingly ordered vector

−
→
B = (b1 , b2 , . . . , bn ), bi ∈ I,

then
f (a1 ) + f (a2 ) + · · · + f (an ) ≥ f (b1 ) + f (b2 ) + · · · + f (bn ).

ƒ
Glossary 145

15. POPOVICIU’S INEQUALITY

If f is a convex function on a real interval I and a1 , a2 , . . . , an ∈ I, then

a + a + ··· + a 
1 2 n
f (a1 ) + f (a2 ) + · · · + f (an ) + n(n − 2) f ≥
n
≥ (n − 1)[ f (b1 ) + f (b2 ) + · · · + f (bn )],
where
1 X
bi = aj, i = 1, 2, · · · , n.
n − 1 j6=i
ƒ
16. SQUARE PRODUCT INEQUALITY

Let a, b, c be real numbers, and let

p = a + b + c, q = a b + bc + ca, r = a bc,
Æ p
s = p2 − 3q = a2 + b2 + c 2 − a b − bc − ca.
From the identity

27(a − b)2 (b − c)2 (c − a)2 = 4(p2 − 3q)3 − (2p3 − 9pq + 27r)2 ,

it follows that

−2p3 + 9pq − 2(p2 − 3q) p2 − 3q −2p3 + 9pq + 2(p2 − 3q) p2 − 3q

p p
≤r≤ ,
27 27
which is equivalent to

p3 − 3ps2 − 2s3 p3 − 3ps2 + 2s3

≤r≤ .
27 27
Therefore, for constant p and q, the product r is minimal and maximal when two of
a, b, c are equal.
ƒ
17. VASC’S INEQUALITY
If a, b, c are real numbers, then

(a2 + b2 + c 2 )2 ≥ 3(a3 b + b3 c + c 3 a),

with equality for a = b = c, and also for

a b c
= = π
sin2 4π
7 sin2 2π
7
sin2 7
146 Vasile Cîrtoaje

(or any cyclic permutation) - Vasile Cirtoaje, 1991.

A generalization of this inequality is the following (Vasile Cirtoaje, 2007):
X X X X X
a4 + A a2 b2 + Ba bc a≥C a3 b + D a b3 ,

where A, B, C, D are real numbers such that

1 + A + B = C + D,

3(1 + A) ≥ C 2 + C D + D2 .

18. SYMMETRIC INEQUALITIES OF DEGREE THREE, FOUR OR FIVE

Let f n (a, b, c) be a symmetric homogeneous polynomial of degree n = 3, n = 4 or n = 5.
(a) The inequality f4 (a, b, c) ≥ 0 holds for all real numbers a, b, c if and only if
f4 (a, 1, 1) ≥ 0 for all real a;
(b) The inequality f n (a, b, c) ≥ 0 holds for all a, b, c ≥ 0 if and only if f n (a, 1, 1) ≥ 0
and f n (0, b, c) ≥ 0 for all a, b, c ≥ 0 (Vasile Cirtoaje, 2008).

19. SYMMETRIC INEQUALITIES OF DEGREE SIX

Any sixth degree symmetric homogeneous polynomial f6 (a, b, c) can be written in the
form
f6 (a, b, c) = Ar 2 + B(p, q)r + C(p, q),

where A is called the highest coefficient of f6 , and

p = a + b + c, q = a b + bc + ca, r = a bc.

Case 1: A ≤ 0. The following statement holds.

(a) The inequality f6 (a, b, c) ≥ 0 holds for all real numbers a, b, c if and only if
f6 (a, 1, 1) ≥ 0 for all real a;
(b) The inequality f6 (a, b, c) ≥ 0 holds for all a, b, c ≥ 0 if and only if f6 (a, 1, 1) ≥ 0
and f6 (0, b, c) ≥ 0 for all a, b, c ≥ 0 (Vasile Cirtoaje, 2008).
Case 2: A > 0. We can use the highest coefficient cancellation method (Vasile Cirtoaje,
2008). This method consists in finding some suitable real numbers B, C and D such
that the following sharper inequality holds
2
q2

3
f6 (a, b, c) ≥ A r + Bp + C pq + D .
p
Glossary 147

Because the function g6 defined by

2
q2

3
g6 (a, b, c) = f6 (a, b, c) − A r + Bp + C pq + D
p

has the highest coefficient A1 = 0, we can prove the inequality g6 (a, b, c) ≥ 0 as in the
preceding case 1.
Notice that sometimes it is useful to break the problem into two parts, p2 ≤ ξq and
p2 > ξq, where ξ is a suitable real number.

20. EQUAL VARIABLE METHOD

The Equal Variable Theorem (EV-Theorem) for nonnegative real variables has the fol-
lowing statement (Vasile Cirtoaje, 2005).
EV-Theorem (for nonnegative variables). Let a1 , a2 , · · · , an (n ≥ 3) be fixed nonnegative
real numbers, and let x 1 ≤ x 2 ≤ · · · ≤ x n be nonnegative real variables such that

x 1 + x 2 + · · · + x n = a1 + a2 + · · · + an ,

x 1k + x 2k + · · · + x nk = a1k + a2k + · · · + ank ,

where k is a real number (for k = 0, assume that x 1 x 2 · · · x n = a1 a2 · · · an > 0). Let
f : (0, ∞) → R be a differentiable function such that g : (0, ∞) → R defined by
€ 1 Š
g(x) = f 0 x k−1

is strictly convex, and let

Sn = f (x 1 ) + f (x 2 ) + · · · + f (x n ).

(1) If k ≤ 0, then Sn is maximum for

0 < x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is minimum for

0 < x1 ≤ x2 = x3 = · · · = x n;
(2) If k > 0 and either f is continuous at x = 0 or f (0+ ) = −∞, then Sn is maximum
for
0 ≤ x 1 = x 2 = · · · = x n−1 ≤ x n ,
and is minimum for
x 1 = · · · = x j−1 = 0, x j+1 = · · · = x n ,
148 Vasile Cîrtoaje

where j ∈ {1, 2, · · · , n}.

For f (x) = x m , we get the following corollary.
EV-COROLLARY (for nonnegative variables). Let a1 , a2 , · · · , an (n ≥ 3) be fixed nonneg-
ative real numbers, let x 1 ≤ x 2 ≤ · · · ≤ x n be nonnegative real variables such that

x 1 + x 2 + · · · + x n = a1 + a2 + · · · + an ,

x 1k + x 2k + · · · + x nk = a1k + a2k + · · · + ank ,

and let
Sn = x 1m + x 2m + · · · + x nm .
Case 1 : k ≤ 0 (for k = 0, assume that x 1 x 2 · · · x n = a1 a2 · · · an > 0 ).
(a) If m ∈ (k, 0) ∪ (1, ∞), then Sn is maximum for

0 < x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is minimum for

0 < x1 ≤ x2 = x3 = · · · = x n;
(b) If m ∈ (−∞, k) ∪ (0, 1), then Sn is minimum for

0 < x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is maximum for

0 < x1 ≤ x2 = x3 = · · · = x n.
Case 2 : 0 < k < 1.
(a ) If m ∈ (0, k) ∪ (1, ∞), then Sn is maximum for

0 ≤ x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is minimum for

x 1 = · · · = x j−1 = 0, x j+1 = · · · = x n ,
where j ∈ {1, 2, · · · , n};
(b) If m ∈ (−∞, 0) ∪ (k, 1), then Sn is minimum for

0 ≤ x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is maximum for

x 1 = · · · = x j−1 = 0, x j+1 = · · · = x n ,
where j ∈ {1, 2, · · · , n}.
Case 3 : k > 1.
Glossary 149

(a) If m ∈ (0, 1) ∪ (k, ∞), then Sn is maximum for

0 ≤ x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is minimum for

x 1 = · · · = x j−1 = 0, x j+1 = · · · = x n ,
where j ∈ {1, 2, · · · , n};
(b) If m ∈ (−∞, 0) ∪ (1, k), then Sn is minimum for

0 ≤ x 1 = x 2 = · · · = x n−1 ≤ x n ,

and is maximum for

x 1 = · · · = x j−1 = 0, x j+1 = · · · = x n ,
where j ∈ {1, 2, · · · , n}.

The Equal Variable Theorem (EV-Theorem) for real variables has the following
statement (Vasile Cirtoaje, 2012).
EV-Theorem (for real variables). Let a1 , a2 , · · · , an (n ≥ 3) be fixed real numbers, let
x 1 ≤ x 2 ≤ · · · ≤ x n be real variables such that

x 1 + x 2 + · · · + x n = a1 + a2 + · · · + an ,

x 1k + x 2k + · · · + x nk = a1k + a2k + · · · + ank ,

where k is an even positive integer, and let f be a differentiable function on R such that the
associated function g : R → R defined by
p

g(x) = f 0
k−1
x

is strictly convex on R. Then, the sum

Sn = f (x 1 ) + f (x 2 ) + · · · + f (x n )

is minimum for x 2 = x 3 = · · · = x n , and is maximum for x 1 = x 2 = · · · = x n−1 .

21. ARITHMETIC COMPENSATION METHOD

The Arithmetic Compensation Theorem (AC-Theorem) has the following statement (Vasile
Cirtoaje, 2002).
AC-THEOREM. Let s > 0 and let F be a symmetric continuous function on the compact set
in Rn

S = {(x 1 , x 2 , · · · , x n ) : x 1 + x 2 + · · · + x n = s, x i ≥ 0, i = 1, 2, · · · , n}.
150 Vasile Cîrtoaje

If
F (x 1 , x 2 , x 3 , · · · , x n ) ≥
n x + x x + x  o
1 2 1 2
≥ min F , , x 3 , · · · , x n , F (0, x 1 + x 2 , x 3 , · · · , x n )
2 2
for all (x 1 , x 2 , · · · , x n ) ∈ S, then F (x 1 , x 2 , x 3 , · · · , x n ) is minimal when
s
x1 = x2 = · · · = x k = , x k+1 = · · · = x n = 0;
k
that is, s s 
F (x 1 , x 2 , x 3 , · · · , x n ) ≥ min F , · · · , , 0, · · · , 0
1≤k≤n k k
for all (x 1 , x 2 , · · · , x n ) ∈ S.
Notice that if
x + x x + x 
1 2 1 2
F (x 1 , x 2 , x 3 , · · · , x n ) < F , , x3, · · · , x n
2 2
involves
F (x 1 , x 2 , x 3 , · · · , x n ) ≥ F (0, x 1 + x 2 , x 3 , · · · , x n ),
then the hypothesis
F (x 1 , x 2 , x 3 , · · · , x n ) ≥
n x + x x + x  o
1 2 1 2
≥ min F , , x 3 , · · · , x n , F (0, x 1 + x 2 , x 3 , · · · , x n )
2 2
is satisfied.