Vol. 17, No.2, October 2009, pp 639-647 ISSN 1222-5657, ISBN 978-973-88255-5-0, www.hetfalu.ro/octogon
639
Extensions of a category of inequalities
D.M. B˘atinet¸u-Giurgiu and Mih´aly Bencze12
ABSTRACT.In this paper we present extensions of a category of inequalities, which have applications in fundamental theory of inequalities, and evidently in mathematical contests.
MAIN RESULTS
Theorem 1. If a1, ..., ak, b1, ..., bp, xt, yt>0, α, γ ∈R,
β∈(−∞,0]∪[2,+∞) and i1, ..., ik, j1, ..., jp∈ {1,2, ..., n} are different indexes, then
X
cyclic
¡a1xαi1+...+akxαik¢β b1yγj1+...+bpyjγp ≥
n2−β(a1+...+ak)p µ n
P
t=1
xαt
¶β
(b1+...+bp)Pn
t=1
ytγ Proof. Using first the Cauchy-Schwarz‘s and after them the Jensen‘s inequality we obtain:
(b1+...+bp) Xn
t=1
yγt X
cyclic
¡a1xαi1+...+akxαik¢β b1yjγ1+...+bpyγjp =
=
X
cyclic
³
b1yjγ1+...+bpyjγp
´
X
cyclic
¡a1xαi1+...+akxαik¢β b1yjγ1+...+bpyγjp ≥
≥
X
cyclic
¡a1xαi1+...+akxαik¢β
2
2
≥
12Received: 25.03.2006
2000Mathematics Subject Classification. 26D15
Key words and phrases. Cauchy‘s inequality, Jensen‘s inequality
≥
1 nβ2−1
X
cyclic
¡a1xαi1 +...+akxαik¢β
2
2
=n2−β(a1+...+ak)β Ã n
X
t=1
xαt
!β
Corollary 1.1. If a, b, xt>0 (t= 1,2, ..., n) andβ ∈(−∞,0]∪[2,+∞), then
X
cyclic
xβ1 ax2+bx3 ≥
n2−β µPn
t=1
xαt
¶β
a+b
Proof. In Theorem 1 we takeα= 1, a1= 1, a2 =a3 =...=ak= 0, b1=a, b2 =b, y1 =x2, y2 =x3, b3=b4=...=bp = 0, γ = 1.
Ifa=b= 1 then we obtain the Corollary 2.1 from [2].
If Qn
t=1
xt= 1,then Pn
t=1
xt≥nand we get X
cyclic
xβ1
ax2+bx3 ≥ n a+b which is the Remark 2.1.2 from [2].
Ifxt→ x1
t (t= 1,2, ..., n),then we get X
cyclic
x2x3
xβ1(ax3+bx2) ≥ n2−β
µ n P
t=1 x1t
¶β
a+b If Qn
t=1
xt= 1,then from the previous inequality we obtain X
cyclic
x2x3
xβ1 (ax2+bx3) ≥ n a+b Ifn= 3,β = 2 and x1x2x3= 1,then
X 1
x31(ax2+bx3) ≥ 3 a+b
is a problem proposed by Russia in 1995 and presented at IMO.
Corollary 1.2. If a, b, xt>0 (t= 1,2, ..., n),(a≥b) and β ∈(−∞,0]∪[2,+∞), then
X
cyclic
xβ1
a(x1+...+xk−1) + (a−b)xk+a(xk+1+...+xn) ≥ n2−β
µ n P
t=1
xt
¶β−1
an−b Proof. In Theorem 1 we takea1 = 1, a2=...=ak= 0, xt=yt
(t= 1,2, ..., n), b1=...=bk−1 =bk+1=...=bn=a, bk=a−b, α=γ = 1.
Corollary 1.3. If a, b, c, d, xt>0 (t= 1,2, ..., n), β ∈(−∞,0]∪[2,+∞), then
X
cyclic
(ax1+bx2)β xc3+dx4 ≥
n2−β(a+b)β µ n
P
t=1
xt
¶β
c+d from this we obtain
X
cyclic
(x1+x2)β
x3+u ≥ 2βn2−β nu+ 1 which is Corollary 2.4.1 from [2].
Ifβ = 2, then we get
X
cyclic
(x1+x2)β
x3+u ≥ 4
1 +nu
Ifu= 1 and n= 3 then we obtain the problem 24380 from Gazeta
Matematica 10/2000, author Mihai Opincariu, namely ifa+b+c= 1, then X(a+b)2
c+ 1 ≥1
After some modification we get the following: Ifa, b, c >0 then X (a+b)2
a+b+ 2c ≥a+b+c
In same way we obtain the following:
X
cyclic
xβ1
x2+x3 ≥ 1 2n2−β
à n X
t=1
xt
!β−1
which is Corollary 2.6 from [2].
Ifβ = 2,then we get the following: Ifa, b, c, d >0 anda+b+c+d= 1, then X a2
a+b ≥ 1 2
which is a problem presented by Ireland at IMO 1999.
Corollary 1.4. If b1, ..., bp, xt>0 (t= 1,2, ..., n), β ∈(−∞,0]∪[2,+∞), then
X
cyclic
(x1+x2+...+xk)β b1x1+b2x2+...+bpxp ≥
kβ µ n
P
t=1
xt
¶β−1
(b1+...+bp)nβ−2 which is Corollary 2.7 from [2].
Ifk= 2, β= 2, b1 =b2 = 1, b3 =b, b4=...=bp = 0,then we get the following: If x, y, z, b >0, then
X (x+y)2
x+y+bz ≥ 4 (x+y+z) b+ 2
which is problem C.2403 from Gazeta Matematica 5-6/2001, author Titu Zvonaru.
After some substitutions we get:
X 1
x1+x2+...+xk ≥ n2 kPn
t=1
xt
Ifn= 3, k= 2 then we obtain the following: Ifa, b, c >0, then X 1
a+b ≥ 9
2 (a+b+c)
which was a problem in Ireland at a Mathematical Contest in 1999.
After another specification we obtain the following:
Corollary 1.5. If xt> u >0 (t= 1,2, ..., n) andβ ∈(−∞,0]∪[2,+∞), then
X xβ1 x2−u ≥
µ n P
t=1
xt
¶β
nβ−2 µ n
P
t=1
xt−nu
¶
Ifβ = 2, a, b≥u= 1, n= 2, then we obtain the following: If a, b≥1, then a2
b−1+ b2 a−1 ≥8
which was a problem in Russian Mathematical Olympiad 1992. From Corollary 1.5 we get:
a2
b−1 + b2
a−1 ≥ (a+b)2 a+b−2 but (a+b)2 ≥8 (a+b−2)⇔(a+b−4)2≥0.
In same way we obtain the following problem: Ifa, b≥2, then a2
b−2 + b2
a−2 ≥16
which was presented at Mathematical Olympiad in Moldavia. From Corollary 1.5 we get
a2
b−2 + b2
a−2 ≥ (a+b)2 a+b−4 but
(a+b)2≥16 (a+b−4)⇔(a+b−8)2 ≥0 Corollary 1.6. If a, b, xt>0 (t= 1,2, ..., n),then
X
1≤i<j≤n
1 axixj +b ≥
¡n
2
¢2
a P
1≤i<j≤n
xixj+¡n
2
¢b ≥
¡n
2
¢2
a(n−1) 2
Pn t=1
x2t+¡n
2
¢b
which is Corollary 2.10.1 from [2].
If Pn
t=1
x2t =n, then
X
1≤i<j≤n
1
axixj+b ≥ n(n−1) 2 (a+b) Ifa= 1 then we obtain corollary 2.10.2 from [2].
Ifn= 3,a=b= 1 then we obtain the following: Ifa, b, c >0 and a2+b2+c2 = 3,then
X 1
ab+ 1 ≥ 3 2
which is a problem presented at Mathematical Olympiad in Belarus 1999.
The result of corollary 1.6 can be generalized in following way: Ifa, b, xt>0 (t= 1,2, ..., n) then
X
1≤i1<...<ik≤n
1
axi1xi2...xik+b ≥
¡n
k
¢2
a P
1≤i1<...<ik≤n
xi1...xik+¡n
k
¢b
Corollary 1.7. If bt, xt>0 (t= 1,2, ..., n) and β ∈(−∞,0]∪[2,+∞),then xβ1
b1
x1 +xb2
2 +...+xbn
n
+ xβ2
b1
x2 +xb2
3 +...+ bxn
n
+...+ xβn
b1
xn + bx2
1 +...+xbn
n
≥
≥
µ n P
t=1
xt
¶β
nβ−1 µ n
P
t=1 x1t
¶ µ n P
t=1
bt
¶
Proof. In Theorem 1 we takea1 = 1, a2 =a3=...=ak= 0, p=n, yt= x1t (t= 1,2, ..., n).
After some particularization we get the following problem: If a, b, c, d, e >0 and β∈(−∞,0]∪[2,+∞),then
X aβ
b+c ≥ (P a)β−1 2·5β−2 Ifm= 1 then we get
X a b+c ≥ 5
2
which is a problem of selection test in USA, for IMO 2001, author Titu Andreescu.
Corollary 1.8. If a, b, c >0 andβ ∈(−∞,0]∪[2,+∞),then X aβ
a2−bc+ 1 ≥ 32−β(P a)β (P
a)2−3P ab+ 3 IfP
ab= 13,then
X aβ
a2−bc+ 1 ≥31−β³X a
´β−2
Ifβ = 1, then
X a
a2−bc+ 1 ≥ 1 Pa
which is problem O:976 Gazeta Matematica 9-10/2001, author Titu Andreescu.
Corollary 1.9. If a, x, y, z, t >0 and β ∈(−∞,0]∪[2,+∞),then X xβ
x3−3yzt+ax ≥ 42−β(P x)β−1 Px2−P
xy+a Ifβ = 2,then
X x2
x3−3yzt+ax ≥
Px Px2−P
xy+a IfP
xy = a3,then
X xβ
x3−3yzt+a ≥42−β³X x
´β−3
Corollary 1.10. Ifxt, yt>0 (t= 1,2, ..., n) andk∈N,then
ky1k+1+ Xn
t=2
ytk+1 xt−1 ≥
(k+ 1)yk1 Pn
t=2
yt
k+1
s
nk−1 Pn
t=2
xt−1
Proof. Using the Theorem 1 we get
ky1k+1+ Xn
t=2
ytk+1
xt−1 ≥ky1k+1+
µPn
t=2
yt
¶k+1
(n−1)k−1 Pn
t=2
xt−1
=y1k+1+...+y1k+1
| {z }
k−time
+
+
µPn
t=2
yt
¶k+1
(n−1)k−1Pn
t=2
xt−1
≥
(k+ 1)yk1 Pn
t=2
yt
k+1
s
(n−1)k−1Pn
t=2
xt−1 If Pn
t=2
xt−1= 1,then we get
ky1k+1+ Xn
t=2
ytk+1 xt−1 ≥
(k+ 1)yk1 Pn
t=2
yt
k+1
q
(n−1)k−1 which is Corollary 2.11.1 from [2].
Ifk= 1 then we get y12+ y22
x1 + y32
x2 +...+ yn2
xn−1 ≥2y1 Xn
t=2
yt
which is a problem from O.B.M.J, 2000 author D.Acu.
Corollary 1.11. Ifxt>0 (k= 1,2, ..., n),and y0 > y1 > ... > yn, then
ky0+ Xn
t=1
xk+1t
yk−1−yk ≥(k+ 1) Ã n
X
t=1
xt
!
k+1
sµy0−yn n
¶k−1 +kyn Ifxt= 1 (t= 1,2, ..., n) and k= 1 then we obtain:
y0+ Xn
t=1
1
yt−1−yt ≥yn+ 2n
which is a problem presented at Mathematical Olympiad Sankt Petersburg 1999.
REFERENCES
[1] B˘atinet¸u-Giurgiu, D.M.,Asupra unei probleme de la O.I.M., Canada 1995, Revista de Matematica si de Informatica din Constanta, Anul IX, Nr.
2/2000, pp. 3-4.
[2] Bencze, M. and Chang-Jian, Z.,Applications of generalized
Cauchy-Bunjakowsky-Schwarz inequality, Octogon Mathematical Magazine, Vol. 10, No. 2, 2000, pp. 591-598.
[3] Octogon Mathematical Magazine (1993-2009) Calea 13 Septembrie 59-61,
Bl 59-61, Sc. 2, Ap. 28 05071, Bucuresti, Romania Str. H˘armanului 6,
505600 S˘acele-N´egyfalu Jud. Bra¸sov, Romania
E-mail: benczemihaly@yahoo.com