Romanian Mathematical Magazine

Web: http://www.ssmrmh.ro
The Author: This article is published with open access.

Some Algebraic Inequality Lemmas and

Their Application on Problems
Hüseyin Yiğit Emekçi- Izmir, Turkey
September 2023

1 Introduction
Lemma 1.1 a, b, c, k ∈ R+ such that a + b + c = x and k ≥ 1. Then prove that

ak + k − 1 bk + k − 1 ck + k − 1 3xk
+ + ≥
b+k−1 c+k−1 a+k−1 x + 3k − 3

Proof. By effective AM-GM and Bergstrom Inequality

k
z }| { AM −GM
X ak + k − 1 X ak + 1 + 1 + · · · + 1 z}|{ X ka
= ≥
cyc
b + k − 1 cyc
b + k − 1 cyc
b + k−1

 Bergstorm
k(a + b + c)2

a z}|{
=k ≥
b+k−1 ab + ac + bc + (k − 1)(a + b + c)

!
a+b+c 3xk
=k a+b+c
=
3 +k−1 x + 3k − 3

Application on Problem- Macedonia 2010 1.2

a, b, c ∈ R+ such that a + b + c = 3. Then prove that

1
 a3 + 2 b3 + 2 c3 + 2
+ + ≥3
b+2 c+2 a+2

Proof. By Lemma 1.1, placing x = 3 and k = 3, we get the following :

a3 + 2 b3 + 2 c3 + 2 3xk
+ + ≥ =3
b+2 c+2 a+2 x + 3k − 3

Lemma 2.1.
x, y, z, a, b, c ∈ R+ such that x + y + z = k. Then prove that

1 1 1 9
p +p +p ≥ √
x(ay + bz) y(az + bx) z(ax + by) k a+b

Proof. By Bergstorm Inequality and Jensen Inequality

Bergstrom
X 1 z}|{ 9
p ≥ p p p
cyc x(ay + bz) x(ay + bz) + y(az + bx) + z(ax + by)

Jensen
z}|{ 9 9
≥ q = q
3 axy+ayz+axz+bxy+byz+bxz
3 3 (a+b)(xy+yz+zx)
3

s
9 9 9
≥ r =3 = √
(a+b)(
(x+y+z)2
)
k 2 (a + b) k a+b
3 3
3

Lemma 2.2.
x, y, z ∈ R+ such that x + y + z = 3. Then prove that

1 1 1 3
p +p +p ≥ √
x(2y + 3z) y(2z + 3x) z(2x + 3y) k 5

2
Proof.

By Lemma 2.1., placing x + y + z = 3 and a + b = 5, we get the follow-

ing:
1 1 1 3 9 3
p +p +p ≥ √ ≥ √ =√
x(2y + 3z y(2z + 3x z(2x + 3y k 5 k a+b 5

Lemma 3.1. y1 , y2 , ..., yn , x, p, n ∈ R+ positive reels and n > p ≥ 2 inte-

gers , a1 , a2 , ..., an ≥ 1 integers, m ≥ 1. Then prove that

v
4m(n−1)!
 2m(p−1)!−1
i=p
u y1 +y2 +...+yn
(n−p)!
k2 x n−1√ n + 1 2.
 
X n−1u
( p−1t
) xy1 + ( ) p
Q ≥ p−1
2xk.
yi ,i=1 a1 +a2 +...+ap =n (a1 y1 + a2 y2 + ... + ap yp ) p−1 n(n + 1)

Determine when does the equality occurs ?

Proof By effective AM-GM and Bergstrom

Let us show y
xy1t + k 2 x ≥ 2xky12
.

xk
z }| { xk
t 2 y1t y1t y1t z }| { txk t
xy1 + k x = + + ··· + + k + k + · · · + k ≥ 2xky 2xk = 2xky 2
k k k
Then for the denominator
4m(n−1)! 2m(n−1)!

xy1 (n−p)! + k 2 x ≥ 2xky1 (n−p)!

 v

i=p n−1u 4m(n−1)!
X u xy1 (n−p)! + k 2 x
p−1 Q
t
yi ,i=1 a1 +a2 +...+ap =n (a1 y1 + a2 y2 + ... + ap yp )

 v

i=p n−1u 2m(n−1)!
X u 2xky1 (n−p)!
≥ p−1 Q
t
yi ,i=1 a1 +a2 +...+ap =n (a1 y1 + a2 y2 + ... + ap yp )

3
  
n−1 √  
2m(p−1)! 2m(p−1)! 2m(p−1)!
p − 1) 2xk y1 + y2 + · · · + yp
=  
n − 1 qQ
p−1 a1 +a2 +···+ap =n (a1 y1 + a2 y2 + · · · + ap yp )

 
n−1 √  
2m(p−1)! 2m(p−1)! 2m(p−1)!
p − 1) 2xk.2 y1 + y2 + · · · + yp
≥  
 (n−p+1)(n−p+2)(y1 +y2 +···+yp ) 
   
 n−1 
p−1

 
n−1 √
(y1 +y2 +···+yp )2m(p−1)!
 
p − 1) 2xk.2 p2m(p−1)! .p
≥  
 (n−p+1)(n−p+1)(y1 +y2 +···+yp ) 
   
 n−1 
p−1

 
n−1
 
 
n−1√  p−1 (y1 + y2 + · · · + yp )2m(p−1)!−1 
= p − 1 2xk.2  
 (n − p + 1)(n − p + 2) p2m(p−1)!−1 

 
n−1√  2m(p−1)!−1
(n − 1)! y1 + y2 + · · · + yp
= p − 1 2xk. .2
(n − p)!(n − p + 1)(n − p + 2)(p − 1)! p

 
n−1√  2m(p−1)!−1
(n − 1)! y1 + y2 + · · · + yp
= p − 1 2xk. .2
(n − p + 2)!(p − 1)! p

 
n−1√  2m(p−1)!−1
(n + 1)! (n − 1)! y1 + y2 + · · · + yp
= p − 1 2xk. . .2
(n − p + 2)!(p − 1)! (n + 1)! p

4
  
n−1√    2m(p−1)!−1
n+1 1 y1 + y2 + · · · + yp
= p − 1 2xk. . .2
p − 1 n(n + 1) p

   2m(p−1)!−1
n−1√   y1 +y2 +...+yn
n+1 p
= p − 1 2xk. .2
p−1 n(n + 1)

Important Places We know the

 π includes how many terms inside of it by
n−1
binomial coefficients => . In the problem, a1 , a2 , · · · , ap ≥ 1 integers
p−1
which allows us to use ball-pocket binomial formula.) After using GM-AM on
the denominator, mina1 = 1, maxa1 = n − p + 1 because of other p − 1 has at
least one.
4m(n−1)! 4m(n−1)! 4m(n−1)!

Equality occurs if and if y1 (n−p)! = y2 (n−p)! = · · · = yp (n−p)! and a1 =

a2 = · · · = ap = y1 = · · · = yp

Lemma 3.2
a, b, c, x, n ∈ R+ positive reels, i, j, s ≥ 1 integers, n ≥ 4 and k ≥ 2. Then prove
that

 
n−1√  a+b+c 4m−1
 
n−1
c
s

xa4m(n−1)! + 4x

X n+1 3
2 Q ≥ 2 4x. .2
k=a i+j+s=n (ia + jb + sc) 2 n(n + 1)

Proof.
By Lemma 3.1., placing k = 2, p = 3, we get the following:
 2m(p−1)!−1
  y1 +y2 +...+yn
n−1
c
s  2.
xa4m(n−1)! √

+ 4x n−1
) 2xk. n + 1 p
≥ (
X
p−1
2 Q
(ia + jb + sc) p−1 n(n + 1)
k=a i+j+s=n

 
n−1√   a+b+c 4m−1


n+1 3
= 2 4x. .2
2 n(n + 1)

Lemma 3.3
a, b, c, x, n ∈ R+ such that n ≥ 3. Then prove that

5
 c
s
X xa8k(n−1)! + 9x √
(n−1)! ( a+b+c
3 )4k−1
(n−1)!
Q ≥ 6x.(n − 2)!
q=a i+j=n (ia + jb) 6n

Proof.
t
By xat + k 2 x ≥ 2xka 2

s AM −GM s
X xa8m(n−1) + 9x z}|{ X a4m(n−1)
n−1
Q ≥ n−1
6x. Q
cyc i+j=n (ia + jb) cyc i+j=n (ia + jb)

s !
n−1
√ X a4m(n−1)
n−1
= 6x Q
cyc i+j=n (ia + jb)

  GM −AM  
√
n−1
X a 4m z}|{ √
n−1
X a4m
= 6x  qQ  ≥ 6x  n(n−1)(a+b)

i+j=n (ia + jb)
n−1
cyc cyc (n−1)

!
√ a4m √ (a + b + c)4m
X  
n−1 n−1
= 6x ≥ 6x
cyc
n(a + b) 2n(a + b + c).34m−2

a+b+c 4m−1
!
√


n−1 3
= 6x
6n

Lemma 4.1.
a, b, c, x, t, y ∈ R+ , a+b+c = k and x ≥ 2. Then prove that following inequality
holds

6
 √ √ √ r
t−y a t−y b t−y c 3 k
√ +√ +√ ≥√ (t − y)
c + xa a + xb b + xc x + 1 3

X t − √a X t Xr a
√ = √ −
cyc
c + xa c + xa cyc c + xa
.

Bergstorm Jensen
X t z}|{ 9 z}|{ 9
√ ≥ t( √ √ √ ) ≥ t( q )
cyc
c + xa c + xa + a + xb + b + xc 3 (x+1)(a+b+c)
3

3t
=q
(x + 1)( k3 )

√
s
Jensen a b c
X y a z}|{ c+xa + a+xb + b+xc
√ ≤ 3y
cyc
c + xa 3

a b c
Let d satysfie c+xa + a+xb + b+xc ≤ d1 .

d[a(a+xb)(b+xc)+b(b+xc)(c+xa)+c(c+xa)(a+xb)] ≤ (c+xa)(a+xb)(b+xc)

After expanding :

d(a(ab + axc + xb2 + x2 bc) + b(bc + xab + xc2 + x2 ac) + c(ac + xcb + xa2 + x2 ab))

= d[(a2 b + b2 c + c2 a) + 2x(a2 c + b2 a + c2 b) + 3x2 abc]

7
 = d(a2 b + b2 c + c2 a) + 2dx(a2 c + b2 a + c2 b) + 3dx2 (abc)

(c + xa)(a + xb)(b + xc) = (c + xa)(ab + xac + xb2 + x2 bc)

= abc + xac2 + xcb2 + xba2 + x2 bc2 + x2 ca2 + x2 ab2 + x3 abc

= x(a2 b + b2 c + c2 a) + x2 (a2 c + b2 a + c2 b) + (x3 + 1)(abc)

That implies

d(a2 b+b2 c+c2 a)+2dx(a2 c+b2 a+c2 b)+3dx2 (abc) ≤ x(a2 b+b2 c+c2 a)+x2 (a2 c+b2 a+c2 b)+(x3 +1)(abc)

0 ≤ (x − d)(a2 b + b2 c + c2 a) + (x2 − 2dx)(a2 c + b2 a + c2 b) + (x3 − 3dx2 + 1)(abc)

X X
(x − d)( a2 b) + (x2 − 2dx)( a2 c) + (x3 − 3dx2 + 1)(abc)
cyc cyc

AM −GM
z}|{
≥ (x−d)(3abc)+(x2 −2xd)(3abc)+(x3 −3x2 d+1)abc = abc(3x−3d+3x2 −6xd+x3 −3x2 d+1)

= abc(x + 1)2 (x + 1 − 3d) ≥ 0

8
Because of a, b, c, x ∈ R+ , x + 1 − 3d should be greater than 0.

x+1
d≤
3
.

We have found d in a x way. Placing this in inequality holds. If we place

this in inequality:

s s s
a b c 1 3
c+xa + a+xb + b+xc d x+1 3
3y ≥ 3y ≥3 = y√
3 3 3 x+1
.

Unit both inequalities:

X t − y √a
r
3t 3 3 3
√ ≥ q −y √ = √ (t − y)
cyc
c + xa k(x+1) x + 1 x + 1 k
3
.

Lemma 4.2.
a, b, c, x, t ∈ R+ and a + b + c = k. Additionally x ≥ 2.Then prove that

√ √ √ r
t− a t− b t− c 3 3
√ +√ +√ ≥√ (t − 1)
c + xa a + xb b + xc x+1 k

Proof.
If we place y = 1 in Lemma 4.1., we get the following:

√ √ √ r r
t− a t− b t− c 3 3 3 3
√ +√ +√ ≥√ (t − y) = √ (t − 1)
c + xa a + xb b + xc x+1 k x+1 k

Lemma 4.3.
a, b, c ∈ R+ and a + b + c = 3. Then prove that

9
 √ √ √
2− a 2− b 2− c 3
√ +√ +√ ≥
c + 3a a + 3b b + 3c 2

Proof.
Placing y = 1, t = 2, k = 3 and x = 3, we get the following:

√ √ √ r
2− a 2− b 2− c 3 3 3
√ +√ +√ ≥√ (t − 1) =
c + 3a a + 3b b + 3c x+1 k 2

Lemma 5.1.
1
a, b, c, x, p, s, k ∈ R+ , k ≥ 2 and a + b + c = t. Then prove that

2k−1
a2k−1 + p b2k−1 + p c2k−1 + p 9p + 3t 2k−3
+ + ≥
xb + s xc + s xa + s xt + 3s

First Proof (Author).

!
a2k−1 + p b2k−1 + p c2k−1 + p X a2k−1 X 1
+ + = +p
xb + s xc + s xa + s cyc
xb + s cyc
xb + s

!
a2k (a + b + c)2k
X 1  
X 9
= +p ≥ 2k−2 +p
cyc
xab + as cyc
xb + s 3 . (x(ab + bc + ca) + s(a + b + c)) x(a + b + c) + 3s

2k−1 2k−1
(a + b + c)2k 9p + (a+b+c) 9p + 3t 2k−3
 
9 32k−3
≥   +p ≥ =
32k−2 . x( (a+b+c)
2
) + s(a + b + c) x(a + b + c) + 3s x(a + b + c) + 3s xt + 3s
3

(a+b+c)2k−1
(a + b + c)2k 32k−3
 ≥
32k−2 . x( (a+b+c)
2
) + s(a + b + c) x(a + b + c) + 3s
3

10
 a+b+c 1
≥
3(a + b + c)( x(a+b+c)
3 + s) x(a + b + c) + 3s

1 1
≥
3(x( a+b+c
3 ) + s) x(a + b + c) + 3s

1 1
≥
x(a + b + c) + 3s x(a + b + c) + 3s

Second Proof (Davros)

X p 9p
≥
cyc
xa + s xt + 3s

We need to prove:
X a2k−1 t2k−1
≥ 2k−3
cyc
xb + s 3 (xt + 3s)

Rearrangement
X a2k−1 z}|{ X a2k−1
≥
cyc
xb + s cyc
xa + s

a2k−1
Let f (a) = .
xa + s

2a2k−1 (k(2k − 1)x2 a2 + (2k − 1)(2k + 1)sxa + (2k 2 + k)s2 )

f ′′ (a) = ≥0
(xa + s)3

That means function is strictly convex on k ∈ [ 21 , ∞]

11
 X a2k−1 t2k−1
≥ 2k−3
cyc
xa + s 3 (xt + 3s)

Lemma 5.2.
a, b, c, x, p, s ∈ R+ and a + b + c = t. Then prove that

7
t
a7 + 2 b7 + 2 c7 + 2 5 + 18
+ + ≥ 3
xb + s xc + s xa + s xt + 3s

Proof.
Placing k = 4, p = 2 in Lemma 5.1., we get the following:
2k−1 7
a7 + 2 b7 + 2 c7 + 2 9p + 3t 2k−3 t
5 + 18
+ + ≥ = 3
xb + s xc + s xa + s xt + 3s xt + 3s

Lemma 5.3.(Marius Stanean)

a, b, c ∈ R+ and a + b + c = 3. Then prove that

a3 + 5 b3 + 5 c3 + 5
+ + ≥6
b+2 c+2 a+2

Proof.
If we place k = 2, x = 1, t = 3, s = 2 and p = 5, we get the following:

2k−1
a3 + 5 b3 + 5 c3 + 5 a2k−1 + p b2k−1 + p c2k−1 + p 9p + 3t 2k−3
+ + ≥ + + ≥ =6
b+2 c+2 a+2 xb + s xc + s xa + s xt + 3s

12