Journal of Inequalities and Special Functions

ISSN: 2217-4303, URL: www.ilirias.com/jiasf

Volume 13 Issue 3(2022), Pages 10-22.
https://doi.org/10.54379/jiasf-2022-3-2

ON A NOTABLE INEQUALITY

VASILE CIRTOAJE

Abstract. In this paper, we give a proof of the inequality

1 1 1 n
+ 2 + ··· + 2 ≥
a21 + 1 a2 + 1 an + 1 2
for n ≤ 8 and nonnegative real numbers a1 , a2 , . . . , an such that
X n(n − 1)
ai aj = .
1≤i<j≤n
2

In addition, some more general results that might help to prove the inequality
for n ≥ 9 are presented.

1. Introduction
The following inequality was proposed and proved in [2] in 2005: If a, b, c are
nonnegative real numbers such that ab + bc + ca = 3, then
1 1 1 3
2
+ 2 + 2 ≥ .
a +1 b +1 c +1 2
Problem 3 given at the Olympic Revenge Contest from Brazil-2013 [3] has the
following statement: If a, b, c, d are nonnegative real numbers such that ab + ac +
ad + bc + bd + cd = 6, then
1 1 1 1
2
+ 2 + 2 + 2 ≥ 2.
a +1 b +1 c +1 d +1
In the same year, Henrique Vaz posted this inequality on the website Art of Problem
Solving [4], where three known readers have posted distinct proofs. Note that all
methods applied here for four variables fail for more variables. Moreover, as far as
we know, no proof for n ≥ 5 has been published anywhere for the inequality
1 1 1 n
2 + 2 + ··· + 2 ≥ ,
a1 + 1 a2 + 1 an + 1 2
where a1 , a2 , . . . , an are nonnegative real numbers such that
X n(n − 1)
ai aj = .
2
1≤i<j≤n

2000 Mathematics Subject Classification. 26D10, 26D20.

Key words and phrases. Symmetric constraint; Symmetric inequality; Nonnegative variables.
c 2022 Ilirias Research Institute, Prishtinë, Kosovë.
Submitted May 2, 2022. Published September 8, 2022.
Communicated by R. Agarwal.
10
 ON A NOTABLE INEQUALITY 11

In this paper, a proof for n ≤ 8 is given. Sections 2 and 3 provide two useful
lemmas and two propositions, respectively, while Section 4 provides the main result
of the paper, materialized in a theorem easily applicable to our inequality for n ≤ 8.
Section 5 provides the proof of the inequality for n = 3, 4, . . . , 8.

2. Two helpful lemmas

Lemma 2.1. Let x1 and y1 be fixed nonnegative real variables such that x1 ≥ y1 ≥
0, x1 y1 ≤ 1 and x1 y1 + a(x1 + y1 ) = b, where a > 0 and b ≥ 0. If x and y are
nonnegative real variables such that
x ≥ y ≥ 0, xy ≤ 1, xy + a(x + y) = b,
then the expression
1 1
E= + 2
x2
+1 y +1
has the minimum value for y = 0 or x = y.
Proof. If b = 0, then x = y = 0 and E = 2. Assume now that b > 0 and x is a
function of y. From xy + a(x + y) = b, we get x = f (y), where
b − ay p
f (y) = , y ∈ [0, M ], M = a2 + b − a > 0.
y+a
Note that the maximum value of y follows from
b = xy + a(x + y) ≥ y 2 + 2ay,
and occurs when x = y. By deriving the equation xy + a(x + y) = b, we obtain
−(x + a)
x0 y + x + a(x0 + 1) = 0, x0 = ,
y+a
therefore
1 0 −xx0 y x(x + a) y
E (y) = 2 − 2 = − 2
2 (x + 1)2 (y + 1)2 (y + a)(x2 + 1)2 (y + 1)2
a[x(y 2 + 1)2 − y(x2 + 1)2 ] + x2 (y 2 + 1)2 − y 2 (x2 + 1)2
=
(y + a)(x2 + 1)2 (y 2 + 1)2
(x − y)A
= ,
(y + a)(x2 + 1)2 (y 2 + 1)2
where
A = a[(1 − xy)2 − xy(x + y)2 ] + (x + y)(1 − x2 y 2 ).
Having in view that
b − xy
x+y = ,
a
we get  
xyF 2 1
A= , F = (a + b) xy + − 2a2 − b2 − 1.
a xy
Since
a(x − y)
(xy)0 = x0 y + x = ,
y+a
it follows
a(a2 + b)(x − y)
   
0 2 1 0 1
F (y) = (a + b) 1 − 2 2 (xy) = 1 − 2 2 ≤ 0.
x y y+a x y
12 V. CIRTOAJE

Therefore, F (y) is a decreasing function. Since F (0+) = ∞, two cases are possible:
F (y) ≥ 0 for all y ∈ [0, M ], or F (y) ≥ 0 for y ∈ [0, y1 ] and F (y) ≤ 0 for y ∈ [y1 , M ].
Because E 0 (y) has the same sign as F (y), it follows that E(y) is a strictly increasing
function, or is strictly increasing on [0, y1 ] and strictly decreasing on [y1 , M ]. In
both cases, E(y) has the minimum value for an extreme value of y, i.e. for y = 0
or y = x. 
Lemma 2.2. Let x1 and y1 be fixed nonnegative real variables such that x1 ≥ y1 ,
x1 y1 ≥ 1 and a(a − 1)x21 + 2ax1 y1 + 2b(ax1 + y1 ) = 2c, where a ≥ 1 and b, c ≥ 0.
If x and y are nonnegative real variables such that
x ≥ y, xy ≥ 1, a(a − 1)x2 + 2axy + 2b(ax + y) = 2c,
then the expression
a 1
E= + 2
x2 +1 y +1
has the minimum value for x = y.
Proof. First we show that
2c ≥ (a + 1)(a + 2b).
Indeed, we have
2c − (a + 1)(a + 2b) = a(a − 1)x21 + 2ax1 y1 + 2b(ax1 + y1 ) − (a + 1)(a + 2b)
 
1
≥ a(a − 1)x21 + 2a + 2b ax1 + − (a + 1)(a + 2b)
x1
2b(x1 − 1)
= a(a − 1)(x21 − 1) + 2ab(x1 − 1) −
x1
 
2b
= (x1 − 1) a(a − 1)(x1 + 1) + 2ab −
x1
≥ (x1 − 1) [2a(a − 1) + 2ab − 2b] = 2(x1 − 1)(a − 1)(a + b) ≥ 0.
Assume now that y is a function of x. By deriving the given constraint, we get
(a − 1)x + y + b
a(a − 1)x + a(y + xy 0 ) + b(a + y 0 ) = 0, y 0 = −a · ,
ax + b
hence
1 0 −x yy 0 −x y (a − 1)x + y + b
E (x) = 2 2
− = 2 + 2 · .
2a (x + 1) a(y + 1)2
2 (x + 1)2 (y + 1)2 ax + b
Since
(a − 1)x + y + b (a − 1)x + y b(x − y)
− = ≥ 0,
ax + b ax ax(ax + b)
we have
1 0 −x y (a − 1)x + y
E (x) ≥ 2 + 2 ·
2a (x + 1)2 (y + 1)2 ax
(x − y )(x y − 1) + (a − 1)x(x − y)[xy(x + xy + y 2 ) + 2xy − 1]
2 2 2 2 2
= ≥ 0.
ax(x2 + 1)2 (y 2 + 1)2
Therefore, E(x) is strictly increasing and E(x) ≥ E(y). To complete the proof, we
need to show that x = y involves xy ≥ 1, which means x ≥ 1. Indeed, for x = y,
from the given constraint a(a − 1)x2 + 2axy + 2b(ax + y) = 2c, we get
a(a + 1)x2 + 2b(a + 1)x = 2c,
 ON A NOTABLE INEQUALITY 13

a(a + 1)x2 + 2b(a + 1)x ≥ (a + 1)(a + 2b),

(a + 1)(x − 1)(ax + a + 2b) ≥ 0,
hence x ≥ 1.


3. Two helpful propositions

Proposition 3.1. Let a1 , a2 , . . . , an be nonnegative real numbers such that
X n(n − 1)
an−1 ≥ an ≥ 0, an−1 an ≤ 1, ai aj = .
2
1≤i<j≤n

For fixed a1 , a2 , . . . , an−2 , the expression

1 1 1
E= + 2 + ··· + 2
a21 + 1 a2 + 1 an + 1
has the minimum value when an = 0 or an−1 = an .
Proof. For fixed a1 , a2 , . . . , an−2 , denoting
x = an−1 , y = an (x ≥ y ≥ 0),
n(n − 1) X
a = a1 + a2 + · · · + an−2 , b= − ai aj ,
2
1≤i<j≤n−2
1 1
we have a > 0 and a(x+y)+xy = b. By Lemma 2.1, the expression +
x2 + 1 y 2 + 1
has the minimum value when y = 0 or x = y. As a consequence, the expression
 
1 1 1 1
E= 2 + ··· + 2 + +
a1 + 1 an−2 + 1 x2 + 1 y 2 + 1
has the minimum value when y = 0 or x = y, that is when an = 0 or an−1 = an . 
Proposition 3.2. Let a1 , a2 , . . . , an be nonnegative real numbers such that
X n(n − 1)
a1 ≥ a2 ≥ · · · ≥ an , ai aj = .
2
1≤i<j≤n

For fixed ak+2 , . . . , an and

a1 = a2 = · · · = ak , ak ak+1 ≥ 1, k ∈ {1, 2, . . . , n − 2},
the expression
1 1 1
E= + + ··· + 2
a21 + 1 a22 + 1 an + 1
has the minimum value when a1 = a2 = · · · = ak+1 .
Proof. Denoting
x = ak , y = ak+1 (x ≥ y, xy ≥ 1) ,
n(n − 1) X
a = k, b = ak+2 + · · · + an , c= − ai aj ,
2
k+2≤i<j≤n
we have
a(a − 1)x2 + 2axy + 2b(ax + y) = 2c.
14 V. CIRTOAJE

a 1
By Lemma 2.2, the expression + 2 has the minimum value when x = y.
x2 +1 y +1
As a consequence, the expression
 
a 1 1 1
E= 2
+ 2
+ 2 + ··· + 2
x +1 y +1 ak+1 + 1 an + 1
has the minimum value when x = y, that means a1 = a2 = · · · = ak+1 . 

4. The main result

Based on Propositions 3.1 and 3.2, we can state and prove the following theorem:
Theorem 4.1. Let a1 , a2 , . . . , an be nonnegative real numbers such that
X n(n − 1)
a1 ≥ a2 ≥ · · · ≥ an , ai aj = .
2
1≤i<j≤n
jnk
Let k = . If the inequality
2
1 1 1 n
+ + ··· + 2 ≥
a21 + 1 a22 + 1 an + 1 2
holds for both cases
(a) a1 = a2 = · · · = ak+1 and an = 0,
(b) a1 = a2 = · · · = ak+1 and an−1 = an ,
then it holds for all a1 , a2 , . . . , an .
Proof. Because the domain
 
 X n(n − 1) 
D = (a1 , . . . , an ) ∈ Rn+ : ai aj =
 2 
1≤i<j≤n

is a non-empty compact set in Rn+ , the expression

1 1 1
E= + + ··· + 2
a21 + 1 a22 + 1 an + 1
achieves its minimum. Since an−1 an ≤ 1, by Proposition 3.1 it follows that E has
the minimum value for an = 0 or an−1 = an . Next, we will show by induction
n
that it suffices to prove the desired inequality E ≥ for a1 = a2 = · · · = ak+1 ,
jnk 2
where k ≤ . For k = 1, we have ak ak+1 = a1 a2 ≥ 1. Thus, from Proposition
2
3.2, it follows that E has the minimum value when a1 = a2 . Assume now that the
n
following statement is true: ”If the inequality E ≥ holds for a1 = a2 = · · · = ak ,
2
n
then it holds for all ai ” and show that ”If the inequality E ≥ holds for a1 = a2 =
2
· · · = ak+1 , then it holds for all ai ”. There are two cases to consider: ak ak+1 ≥ 1
and ak ak+1 ≤ 1.
Case 1: ak ak+1 ≥ 1. According to Proposition 3.2, the expression E has the
n
minimum value when a1 = a2 = · · · = ak+1 . Therefore, the inequality E ≥ holds
2
for all ai if it holds for a1 = a2 = · · · = ak = ak+1 .
 ON A NOTABLE INEQUALITY 15

n
Case 2: ak ak+1 ≤ 1. For a1 = a2 = · · · = ak , the inequality E ≥ has the form
2
k 1 1 1 n
+ + + ··· + 2 ≥ .
a2k + 1 a2k+1 + 1 a2k+2 + 1 an + 1 2
Since ak+1 ≥ ak+2 ≥ · · · ≥ an , it suffices to show that
k n−k n
+ ≥ ,
a2k + 1 a2k+1 + 1 2
which is equivalent to the obvious inequality
(n − 2k)(a2k − a2k+1 ) + n(1 − a2k a2k+1 ) ≥ 0.


5. Proving the inequality for n = 3, 4, . . . , 8

Application 1: n = 3. If a, b, c are nonnegative real numbers such that
ab + bc + ca = 3,
then
1 1 1 3
+ + ≥ .
a2 + 1 b2 + 1 c2 + 1 2
Proof. Assume that a ≥ b ≥ c. By Theorem 1, it suffices to consider the cases a = b,
b = c (hence a = b =√c) and a = b, c = 0. The equality occurs for a = b = c = 1,
and also for a = b = 3 and c = 0 (or any cyclic permutation). 
Application 2: n = 4. If a, b, c, d are nonnegative real numbers such that
ab + ac + ad + bc + bd + cd = 6,
then
1 1 1 1
+ + + ≥ 2.
a2 + 1 b2 + 1 c2 + 1 d2 + 1
Proof. Assume that a ≥ b ≥ c ≥ d. By Theorem 1, it suffices to consider the cases
a = b = c, c = d (hence a = b = c = d) and a = b = √
c, d = 0. The equality occurs
for a = b = c = d = 1, and also for a = b = c = 2 and d = 0 (or any cyclic
permutation). 
Application 3: n = 5. If a, b, c, d, e are nonnegative real numbers such that
a(b + c + d + e) + b(c + d + e) + c(d + e) + de = 10,
then
1 1 1 1 1 5
+ 2 + 2 + 2 + 2 ≥ .
a2 +1 b +1 c +1 d +1 e +1 2
Proof. Assume that a ≥ b ≥ c ≥ d ≥ e. By Theorem 1, it suffices to consider two
cases: a = b = c, d = e and a = b = c, e = 0.
Case 1: a = b = c, d = e. We need to show that 3a2 + 6ad + d2 = 10 involves
3 2 5
+ ≥ ,
a2 + 1 d2 + 1 2
which can be written as follows:
3 2 5
2 2
+ 2 2
≥ ,
13a + 6ad + d 3a + 6ad + 11d 2(3a + 6ad + d2 )
2

a4 + 8a3 d − 18a2 d2 + 8ad3 + d4 ≥ 0, (a − d)2 (a2 + 10ad + d2 ) ≥ 0.

16 V. CIRTOAJE

Case 2: a = b = c, e = 0. We need to show that 3a2 + 3ad = 10 involves

3 1 3
2
+ 2 ≥ ,
a +1 d +1 2
which can be written as follows:
3 1 1
+ ≥ ,
a(13a + 3d) 3a2 + 3ad + 10d2 2a(a + d)
1 7a − 3d
2 2
≥ ,
3a + 3ad + 10d 2a(a + d)(13a + 3d)
a3 + 4a2 d − 11ad2 + 6d3 ≥ 0, (a − d)2 (a + 6d) ≥ 0.
r
5
The equality occurs for a = b = c = d = e = 1, and also for a = b = c = d =
3
and e = 0 (or any cyclic permutation). 
Application 4: n = 6. If a, b, c, d, e, f are nonnegative real numbers such that
a(b + c + d + e + f ) + b(c + d + e + f ) + c(d + e + f ) + d(e + f ) + ef = 15,
then
1 1 1 1 1 1
+ 2 + 2 + 2 + 2 + 2 ≥ 3.
a2 +1 b +1 c +1 d +1 e +1 f +1
Proof. Assume that a ≥ b ≥ c ≥ d ≥ e ≥ f . By Theorem 1, it suffices to consider
two cases: a = b = c = d, e = f and a = b = c = d, f = 0.
Case 1: a = b = c = d, e = f . We need to show that
6a2 + 8ae + e2 = 15
involves
4 2
+ 2 ≥ 3,
a2 +1 e +1
which is equivalent to
4 1 3
+ 2 ≥ 2 ,
21a2 + 8ae + e2 3a + 4ae + 8e2 6a + 8ae + e2
3a4 + 28a3 d − 62a2 d2 + 28ad3 + 3d4 ≥ 0,
(a − d)2 (3a2 + 34ad + 3d2 ) ≥ 0.
Case 2: a = b = c = d, f = 0. We need to show that
6a2 + 4ae = 15
involves
4 1
+ ≥ 2,
a 2 + 1 e2 + 1
that is equivalent to
4 1 1
+ ≥ ,
a(21a + 4e) 6a2 + 4ae + 15e2 a(3a + 2e)
1 9a − 4e
≥ ,
6a2 + 4ae + 15e2 a(3a + 2e)(21a + 4e)
3a3 + 14a2 e − 37ae2 + 20e3 ≥ 0, (a − e)2 (3a + 20e) ≥ 0.
The r
equality occurs for a = b = c = d = e = f = 1, and also for a = b = c = d =
3
e= and e = 0 (or any cyclic permutation). 
2
 ON A NOTABLE INEQUALITY 17

Application 5: n = 7. If a1 , a2 , . . . , a7 are nonnegative real numbers such that

X
ai aj = 21,
1≤i<j≤7

then
1 1 1 7
+ + ··· + 2 ≥ .
a21 + 1 a22 + 1 a7 + 1 2
Proof. Assume that a1 ≥ a2 ≥ . . . ≥ a7 . By Theorem 1, it suffices to consider two
cases: a1 = a2 = a3 = a4 , a6 = a7 and a1 = a2 = a3 = a4 , a7 = 0.
Case 1: a1 = a2 = a3 = a4 := a, a6 = a7 := c. Denoting a5 = b, we need to
show that
4 1 2 7
+ + ≥
a2 + 1 b2 + 1 c2 + 1 2
for
6a2 + 4a(b + 2c) + 2bc + c2 = 21, a ≥ b ≥ c.
From
21 = 6a2 + 4a(b + 2c) + 2bc + c2 ≤ 21a2 ,
we get a ≥ 1. On the other hand, since
1 b2 b
=1− 2 ≥1−
b2 +1 b +1 2
and
1 c
≥1− ,
c2 +1 2
it suffices to show that
8
+ 1 ≥ b + 2c.
a2 +1
From
0 = 4[6a2 + 4a(b + 2c) + 2bc + c2 − 21] ≤ 3(a − b)(a − c) + (a − b)(b − c),
we get
4[6a2 + 4a(b + 2c) + 2bc + c2 − 21] ≤ 3a2 − 2a(b + 2c) + 4bc − b2 ,
(b + 2c)2 + 18a(b + 2c) + 21a2 − 84 ≤ 0,
p
b + 2c ≤ −9a + 60a2 + 84.
Thus, we only need to show that
8 p
2
+ 1 ≥ −9a + 60a2 + 84,
a +1
which is equivalent to
 3 2
9a − a2 + 9a + 7
≥ 60a2 + 84,
a2 + 1
21a6 − 18a5 − 41a4 + 108a3 − 161a2 + 126a − 35 ≥ 0,
(a − 1)2 (21a4 + 24a3 − 14a2 + 56a − 35) ≥ 0.
Since a ≥ 1, the last inequality is clearly true.
Case 2: a1 = a2 = a3 = a4 := a, a7 = 0. Denoting a5 = b and a6 = c, we need
to show that
4 1 1 5
2
+ 2 + 2 ≥
a +1 b +1 c +1 2
18 V. CIRTOAJE

for
6a2 + 4a(b + c) + bc = 21, a ≥ b ≥ c.
Sub-case 2-a: bc ≥ 1. Since
1 1 2 (bc − 1)(b − c)2
+ 2 − = 2 ≥ 0,
b2 + 1 c + 1 bc + 1 (b + 1)(c2 + 1)(bc + 1)
it is enough to show that
4 2 5
+ ≥ .
a2 + 1 bc + 1 2
We have √
6a2 + 8a bc + bc ≤ 21.
Putting √
a = x bc, x ≥ 1,
we need to show that
21
bc ≤
6x2 + 8x + 1
involves
4 2 5
+ ≥ .
x2 bc +1 bc + 1 2
21
Clearly, it suffices to prove this inequality for bc = . So, we need to
6x2 + 8x + 1
show that
4 1 5
+ ≥ ,
27x2 + 8x + 1 3x2 + 4x + 11 2(6x2 + 8x + 1)
that is equivalent to
9x4 + 36x3 − 94x2 + 44x + 5 ≥ 0,
(x − 1)2 (9x2 + 54x + 5) ≥ 0.
Sub-case 2-b: bc ≤ 1. Since
1 b2 b
=1− 2 ≥1−
b2 +1 b +1 2
and
1 c
≥1− ,
c2 + 1 2
it suffices to show that
8
≥ b + c + 1.
a2 + 1
From
21 = 6a2 + 4a(b + c) + bc ≤ 6a2 + 4a(b + c) + 1,
we get
10 − 3a2
b+c≥ .
2a
In addition, from (a − b)(a − c) ≥ 0, which implies bc ≥ a(b + c) − a2 , we get
21 = 6a2 + 4a(b + c) + bc ≥ 6a2 + 4a(b + c) + a(b + c) − a2 ,
hence
10 − 3a2 21 − 5a2 21
≤b+c≤ , a2 ≤ .
2a 5a 5
 ON A NOTABLE INEQUALITY 19

Also, from
10 − 3a2 21 − 5a2
≤ ,
2a 5a
8
we get a2 ≥ . Thus, it suffices to show that
5
8 21
≤ a2 ≤
5 5
involves
8 21 − 5a2
≥ + 1,
a2 +1 5a
which is equivalent to
5a4 − 5a3 − 16a2 + 35a − 21 ≥ 0,
(5a2 − 8)(3a2 − 3a − 1) + (3 − a)(19a − 24) + 1 ≥ 0.
This is true since
5a2 − 8 ≥ 0, 3 − a > 0, 19a − 24 > 0, 3a2 − 3a − 1 > 0.

r equality occurs for a1 = a2 = · · · = a7 = 1, and also for a1 = a2 = · · · = a6 =

The
7
and a7 = 0 (or any cyclic permutation). 
5
Application 6: n = 8. If a1 , a2 , . . . , a8 are nonnegative real numbers such that
X
ai aj = 28,
1≤i<j≤8

then
1 1 1
+ 2 + ··· + 2 ≥ 4.
a21 + 1 a2 + 1 a8 + 1
Proof. Assume that a1 ≥ a2 ≥ . . . ≥ a8 . By Theorem 1, it suffices to consider two
cases: a1 = a2 = a3 = a4 = a5 , a7 = a8 and a1 = a2 = a3 = a4 = a5 , a8 = 0.
Case 1: a1 = a2 = a3 = a4 = a5 := a, a7 = a8 := c. Denoting a6 = b, we need
to show that
5 1 2
+ + ≥4
a2 + 1 b2 + 1 c2 + 1
for
10a2 + 5a(b + 2c) + 2bc + c2 = 28, a ≥ b ≥ c.
From
28 = 10a2 + 5a(b + 2c) + 2bc + c2 ≤ 28a2 ,
we get a ≥ 1. On the other hand, since
1 b2 b
2
= 1 − 2
≥1−
b +1 b +1 2
and
1 c
≥1− ,
c2 + 1 2
it suffices to show that
10
≥ 2 + b + 2c.
a2 + 1
From
0 = 4[10a2 + 5a(b + 2c) + 2bc + c2 − 28] ≤ 3(a − b)(a − c) + (a − b)(b − c),
20 V. CIRTOAJE

we get
4[10a2 + 5a(b + 2c) + 2bc + c2 − 28] ≤ 3a2 − 2a(b + 2c) + 4bc − b2 ,
(b + 2c)2 + 22a(b + 2c) + 37a2 − 112 ≤ 0,
p
b + 2c ≤ −11a + 84a2 + 112.
Thus, we only need to show that
10 p
≥ 2 − 11a + 84a2 + 112,
a2 + 1
which is equivalent to
2
11a3 − 2a2 + 11a + 8

≥ 84a2 + 112,
a2 + 1
37a6 − 44a5 − 34a4 + 132a3 − 219a2 + 176a − 48 ≥ 0,
(a − 1)2 (37a4 + 30a3 − 11a2 + 80a − 48) ≥ 0.
Since a ≥ 1, the last inequality is clearly true.
Case 2: a1 = a2 = a3 = a4 = a5 := a, a8 = 0. Denoting a6 = b and a7 = c, we
need to show that
5 1 1
+ + ≥3
a2 + 1 b2 + 1 c2 + 1
for
10a2 + 5a(b + c) + bc = 28, a ≥ b ≥ c.
Sub-case 2-a: bc ≥ 1. Since
1 1 2
2
+ 2 ≥ ,
b +1 c +1 bc + 1
it is enough to show that
5 2
+ ≥ 3.
a2 + 1 bc + 1
We have √
10a2 + 10a bc + bc ≤ 28.
Putting √
a = x bc, x ≥ 1,
we need to show that
28
bc ≤
10x2 + 10x + 1
involves
5 2
+ ≥ 3.
x2 bc + 1 bc + 1
28
Clearly, it suffices to prove this inequality for bc = . So, we need to
10x2 + 10x + 1
show that
5 2 3
+ ≥ ,
38x2 + 10x + 1 10x2 + 10x + 29 10x2 + 10x + 1
which is equivalent to
6x4 + 26x3 − 67x2 + 32x + 3 ≥ 0,
(x − 1)2 (6x2 + 38x + 3) ≥ 0.
 ON A NOTABLE INEQUALITY 21

Sub-case 2-b: bc ≤ 1. Since

1 b2 b
= 1 − ≥1−
b2 + 1 b2 + 1 2
and
1 c
≥1− ,
c2 + 1 2
it suffices to show that
10
≥ 2 + b + c.
a2 +1
From
28 = 10a2 + 5a(b + c) + bc ≤ 10a2 + 5a(b + c) + 1,
we get
27 − 10a2
b+c≥ .
5a
In addition, from (a − b)(a − c) ≥ 0, that implies bc ≥ a(b + c) − a2 , we get
28 = 10a2 + 5a(b + c) + bc ≥ 10a2 + 5a(b + c) + bc + a(b + c) − a2 ,
hence
27 − 10a2 28 − 9a2 28
≤b+c≤ , a2 ≤ .
5a 6a 9
From
27 − 10a2 28 − 9a2
≤ ,
5a 6a
22
we get a2 ≥ . Thus, it suffices to show that
15
22 28
≤ a2 ≤
15 9
involves
10 28 − 9a2
≥ 2 + ,
a2 + 1 6a
which is equivalent to
9a4 − 12a3 − 19a2 + 48a − 28 ≥ 0,
(3a2 − 4)(3a2 − 4a + 1) + 2(2 − a)(5a − 6) ≥ 0.
It is true since
3a2 − 4 > 0, 3a2 − 4a + 1 > 0, 2 − a > 0, 5a − 6 > 0.
The equality occurs for a1 = a2 = · · · = a8 = 1, and also for a1 = a2 = · · · = a7 =
2
√ and a8 = 0 (or any cyclic permutation). 
3
Remark. In our opinion, the following generalization holds:
If a1 , a2 , . . . , an are nonnegative real numbers such that
X n(n − 1)
ai aj = ,
2
1≤i<j≤n

then
1 1 1 n
+ + ··· + 2 ≥ ,
a21 + 1 a22 + 1 an + 1 2
22 V. CIRTOAJE

r equality for a1 = a2 = · · · = an = 1, and also for a1 = a2 = · · · = an−1 =

with
n
and an = 0 (or any cyclic permutation).
n−2
References
[1] J. M. Aldaz, A refinement of the inequality between arithmetic and geometric means, J.
Math. Inequal. 2(2008), 473477.
[2] V. Cirtoaje, A special symmetric inequality, Art of problem solving [Online forum: COMMU-
NITY - High School Olympiads - Inequalities proposed], January 6, 2005, Problem posted to
https://artofproblemsolving.com/community/c6h22848p146302.
[3] H. Vaz, Olympic Revenge-Brazil, Art of problem solving [Online forum: COMMUNITY -
CONTEST COLLECTIONS - BRAZIL CONTESTS - Olympic Revenge - 2013 Olympic
Revenge], 2013, Problems posted to https://artofproblemsolving.com/community/c4268.
[4] H. Vaz, Problem 3, Olympic Revenge 2013-Brazil, Art of problem solving [Online forum:
COMMUNITY - High School Olympiads - Inequalities proposed], January 27, 2013, Problem
posted to https://artofproblemsolving.com/community/c6h518184p2916452.

Vasile Cirtoaje
University of Ploiesti, Department Automation and Computers, Bdul Bucuresti, No.
39, Ploiesti, Romania
E-mail address: [email protected]