Diamonds in mathematical inequalities 1

Proposal for a book

Tran Phuong
Director of Center for Research and Support Development of Intellectual Products.
No 19/89, Thai Ha Street, Dong Da District, Hanoi, Viet nam.
Email: [email protected]; [email protected]
Phone No:
(844) 5-376-340; (84)913-220-457
Assistants’ mobile phone numbers:
0061402201501
Email:[email protected]
Fax:
(84)(04) 943-5816
(84)(04)719-9641
2 Diamonds in mathematical inequalities

.
I.1 Title
Diamonds in mathematical inequalities.

I.2. Purpose of the book

The book aims, first, to provide students with a comprehensive and minute system of
typical inequality demonstration methods and techniques, ranging from classical to modern
ones, which, due to the fact that their importance remains unchanged throughout the flow of
time, can be considered as “diamonds in mathematical inequalities”. This main purpose is
accomplished by a number of valuable mathematic samples with interesting “lead-ins” and,
most importantly, a dialectic viewpoint on each solving method.
The major goal of the authors is, therefore, to helping students to acquire multitude of
mathematical tools and methods in solving inequalities, then, be able to achieve excellence in
this field. Besides, on utilizing a new approach in presenting familiar mathematical facts, the
authors also hope to highlight in readers’ mind the importance of a good mathematical
inequality-based thinking in developing their creativeness as well as their ability to critically
evaluate changes in life.
The success of this book will also mean the publication of the authors’ other books on
other fields of secondary mathematics.

I.3. Why is this book different from others?

•

“ Money ?
Eventually spent
Beauty ?
Eventually faded...
Only
Intellect rooted in mind
And feelings rooted in heart
Will last
forever with time

(Tran Phuong, 1990)

Diamonds in mathematical inequalities 3

Comparisons in life
The material and spiritual world in the universe is always on the move, ever changing to
create different things and phenomena. This diversity can be seen through opposite images:
big − small ; wide − narrow ; long − short ; high − low ; plentiful − scarce ; rich − poor ;
beautiful − ugly and so on. Extensively, it is that the divergence between Buddhism,
Mohammedanism and Catholicism; the differences between the Oriental − Occidental
cultures and between the major philosophic thoughts all over the world.

Everybody ′s life is an ongoing search to set his/her own values. Every thing gets its
standing in the ever changing world by its own values; however, one does not often realize
that everything can only obtain its value in comparison with some other thing. It is this
relationship that creates inequalities.

In fact, though "all comparisons are odious" as the saying goes, men cannot help
resorting to comparison to evaluate things. A kilogram of Korean ginseng is 1000 times
smaller than a ton of rice in term of mass, but costs 10 times more. Take the example of a
president or a car driver, who is more important? You may say that the head of state is
certainly more important than a racer, but only in state affairs. In respect of annual income,
former President Clinton' s US $200,000 annual salary in office is derisory in comparison
with world famous formula 1 car racer Michael Schumacher' s US $60,000,000 annual
income. Thus, factors in a comparison should be identified, quantified and converted to a
same kind of unit - whether you want to or not.

In order to develop comparison thinking and evaluation in life, notions of mathematical

inequalities are given us as early as school age. Children at kindergarten learn to compare 1
with 2 to have a 1 < 2 inequality. Fourth formers begin to achieve more difficult comparisons,
135
for instance with , etc. Some of them proceed by reduction to a common
143
denominator, which is rather complicated, i.e.

= × = = × = but < <

× ×

Others intelligently operate by fractions complementation as follows:

+ = = + ; now > hence <

Comparison problems grow more and more difficult with more extensive operations. All
mathematicians share the common concept "Basic results of mathematics often are
expressed by inequalities in stead of equalities". The same is true in real life, where one
always encounters differences between things and phenomena, and even changes in a single
phenomenon by the minute. Indeed, if we are subject to no change after every second, then,
according to the induction principle, 50 years later, we would not get any older. On the other
4 Diamonds in mathematical inequalities

hand, in social life, inequality-based thinking is always needed to assess business activities,
export-import industry, stock exchange market, finances, banking... Therefore, in order to
develop thinking and properly assess the changes in life, a good mathematical inequality-
based thinking is most necessary. With these introductory words, the author wishes that the
readers consider the subject treated in this book as a close and intimate one.”

With such profound philosophical understandings, the writer has always been aware of
the necessity to ensure an inspiration and intellectual delight in each technique and method
presented. The book, there fore, will encourage students to acquire a multitudes of inequality
demonstration methods as effective tools not only in solving mathematics problems but also
in critically evaluate changes in life.
•

1. The classical “diamonds” were introduced in new angles of view with typical
techniques and methods followed by a variety of interesting examples ranging from simple to
complex.
To be more specific, the authors insufflate in each inequality demonstration technique a
new notion imbued with a forceful philosophic connotation, the notion of “point of
incidence”. The utility of such creative penmanship is rooted from the ideas relating to the
point of incidence in the film “Teheran 43”. The film, which was produced by the cooperation
of Russia, France and Italia, has the setting of the summer 1943, when the World War II was
growing fiercer and fiercer. In the context, the U.S., Great Britain and the Soviet Union
envisaged opening a Front of Alliance and the Germans plotted to assassinate the three leaders
of the Alliances, Roosevelt, Churchill and Stalin. The German spy Schiller trusted professional
hit-man Max with the assassination, but bade him to work out the venue and the time of the
meeting. From the military developments, Max estimated that the meeting would take place at
the end of 1943. Added with diplomatic pretext for the meeting, Max came to the final
conclusion that it must take place no sooner or later than Churchill’s birthday, which was 30th,
November and the venue must be in a British colony far away from the front in Europe. The
venue, accordingly, must be no other than the British Embassy in Teheran, the Iranian
Capital. From such estimation Max flew to Teheran three months before the meeting and
hired locals to dig a tunnel ending up in the British Embassy.
Thus, the idea of choosing points of incidence in life springs from considering the
evolution and development of things to estimate where they would lead to, with a view to
orienting the direction of approach from the outset. As to the techniques of choosing the point
of incident in equalities, it is based on the state of variables when the two terms of the
inequalities happen to equal. Typical examples illustrating this technique are found precisely
presented in the very first introduction on AM-GM, Cauchy-Schwarz, Bernoulli inequalities
and throughout this book.
Diamonds in mathematical inequalities 5

2. The modern “diamonds”, of which the typical ones are ABC, GTA, GLA, DAC
methods, are discussed in details so that readers can easily grasp the spirit of each technique
and method and apply them.
After all, this is a profound book on the methods and techniques of mathematical
inequality demonstration. The problems given are arranged didactically upwards, i.e.
gradually from lower to higher levels. A variety of typical examples are given to illustrate
each problem; exercises for readers also range from simple to complex ones with large
amplitude. All of them are presented in an interesting way but easy to understand and apply.
Hopefully, readers would feel easy to understand and to perceive this book, and to
evaluate the authors’ “mathematical creations”. It convey new perspectives and view points
to many familiar problems and challenges its audience with a number of new ones. In one
word, with this book, readers may have chances to develop and to make themselves
recognized.
3. Mathematics is a language itself and also Inequality should be a public language that
can connect everybody throughout the world easily. Therefore the authors used many
Mathematics notations to reduce the English language so that even those who don’t know
English well can also enjoy this book.

I.4. Table of contents

The book consists of 5 chapters, for a total of about 480 pages. The major content of the book
can be summarized as follows:
Chapter I: Diamonds in classical mathematical inequalities
§1. AM-GM inequalities
§2. Cauchy-Schwarz inequalities
§3. Holder inequalities
§4. Minkowski inequalities
§5. Chebyshev inequalities
Chapter II: Diamonds in modern mathematical inequalities
§6. Schur inequalities
§7. Muirhead inequalities
§8. Permutation inequalities
Chapter III: Diamonds of analytic method
§9. Fermat theorem (Derivative method)
§10. Lagrange theorem
§11. Bernoulli inequalities
6 Diamonds in mathematical inequalities

§12. Jensen inequalities

§13. Karamata inequalities
§14. Vasile Cirtoaje inequalities (RCF, LCF and LCRCF theorem)
§15. Popoviciu inequalities
§16. Riman theorem (Integral method)
Chapter IV: Diamonds in contemporary inequalities
§17. UCT method
§18. SOS method
§19. GMV method
§20. ABC method
§21. Equal variable method
§22. Geometricalize Algebra method
§23. Divide and conquer method
Chapter V: Some creations on mathematical inequalities
§24. Selective papers on inequalities
§25. Nice solutions to selective inequalities
§26. Challenging problems

I.5. Who is the audience?

The book is intended for a wide range of audience. It is first and particularly meant for
capable basic secondary students, candidates to national and international mathematics
contests, mathematics teachers at all levels and researchers. On completing this book, the
authors, however, did not target the public from only one country. Believing that
mathematics language does not change across national boundaries, they hope that the book
will be able to reach an international readership and prove to be helpful for everyone who is
seeking ways to broaden their mathematical horizons.

I.6. Final comment

This book is the authors’ soul-felt work achieved through years of hard work, based on
their vast experience in mathematics and mathematical education. It is a comprehensive work
in a field favorable to observation, intuition and creativeness, all of which are outstanding
talents of the Vietnamese people. Having devoted themselves entirely to completing this book,
the authors are convinced that it will last as long as a close friend of the world’s
mathematics lovers.
Diamonds in mathematical inequalities 7

II.
The initial section of Sample Work is a part of chapter one of the book, which was
written with a brand new style for a well – known method: “Point of incidence” In this
chapter, we will introduce the technique of choosing the “point of incidence” in AM – GM,
Cauchy-Schwarz and Bernoulli inequalities. However, it is noted that selecting “point of
incidence” is only the typical technique among a total of 30 techniques of using AM – GM
inequalities presented in the manuscript of the book “Collections of Topics, Methods and
Techniques in Algebraic Inequality Demonstration”, which is 2222-pages thick and was
completed by Tran Phuong due to the impetus raised in his mind on the occasion of President
W.J. Clinton visited Vietnam on November, 16th, 2000. In this part, the ideas relating to the
point of incidence in the film “Teheran 43” will be mentioned again.

In the remaining section, we will consider the best estimation of Nesbit − Shapiro
Inequality in primary mathematics.

In respect of format, we would like to note here that in the hope of presenting the content
of the book in the most convenient way, we choose the paper size of 17×24cm and the page
layout of 14×21cm, which is very common in Vietnam.

INTRODUCTION: FROM THE STORY ABOUT “POINTS OF INCIDENCE”

TO POINT OF INCIDENCE IN MATHEMATICAL INEQUALITY

IDEAS RELATING TO “POINTS OF INCIDENCE” IN TEHERAN 43

The film, which was produced by the cooperation of Russia, France and Italia, has the setting
of the summer 1943, when the World War II was growing fiercer and fiercer. In the context, the
U.S., Great Britain and the Soviet Union envisaged opening a Front of Alliance and the Germans
plotted to assassinate the three leaders of the Alliances, Roosevelt, Churchill and Stalin. The
German spy Schiller trusted professional hit-man Max with the assassination, but bade him to
work out the venue and the time of the meeting. From the military developments, Max
estimated that the meeting would take place at the end of 1943. Added with diplomatic
pretext for the meeting, Max came to the final conclusion that it must take place no sooner or
later than Churchill’s birthday, which was 30th, November and the venue must be in a British
colony far away from the front in Europe. The venue, accordingly, must be no other than the
British Embassy in Teheran, the Iranian Capital. From such estimation Max flew to Teheran
three months before the meeting and hired locals to dig a tunnel ending up in the British Embassy.
8 Diamonds in mathematical inequalities

Thus, the idea of choosing points of incidence in life springs from considering the
evolution and development of things to estimate where they would lead to, with a view to
orienting the direction of approach from the outset. As to the techniques of choosing the point
of incident in equalities, it is based on the state of variables when the two terms of the
inequalities happen to equal. Typical examples illustrating this technique will be precisely
presented in the very first introduction on AM-GM, Cauchy-Schwarz, Bernoulli inequalities
and throughout this book.

POINT OF INCIDENCE IN EQUALITIES

Setting the manner:

In proving the inequality A ≥ B we often follow either the two following patterns:
Pattern 1: Create a sequence of intermediary inequalities

A ≥ A1 ≥ A 2 ≥ ... ≥ An − 1 ≥ An ≥ B
Pattern 2: Create a sequence of component inequalities

A1 ≥ B1 A1 ≥ B1 ≥ 0

A2 ≥ B 2 A2 ≥ B 2 ≥ 0
+ ×
........ or ............
An ≥ B n An ≥ B n ≥ 0

A≥ B A≥ B

To create intermediary or component inequalities we need to note that if the 'Central

inequality A ≥ B' becomes 'A = B' at a standard P , all the intermediary inequalities in
Pattern 1 or all the component inequalities (local inequality) in Pattern 2 also become
equalities. To find standard P we need to pay attention to the symmetry of variables and the
conditions for equality to occur in AM − GM Inequality where all joining variables are
equal. For estimating at what standard 'A = B' occurs is to guide algebraic transformations and
estimations of intermediary or component inequalities, the work can be called 'Inspecting the
condition of equality occurring and point of incidence in the inequality'.

We will be more familiar with this idea in a variety of examples ranging from single to
complex in the detailed discussion of sample exercises later.
Diamonds in mathematical inequalities 9

III.
III.1. Tran Phuong, the chief author of the book, is the Director of Center for Research and
Development Support of Intellectual Products in Vietnam.

Like most authors of mathematics books, Tran Phuong received systematic and
professional education and training specializing in this field. Before entering university, he
studied in Mathematics Specialized School at the University of Natural Sciences, Hanoi, the
cradle in which up to 60% of Vietnamese IMO medalists were trained and nourished so far.
After his school years, he continued pursuing his interest in mathematics in Teacher Training
University, Hanoi, the leading center for training mathematics professors in Vietnam.

After graduation, the author, however, pursued his career in his own way which is
teaching on the invitations of high schools, universities and mathematics centers in Vietnam.
During the years from 1990 to 2000, up to approximately 10 thousands of students attended
his classes on mathematics. The majority of them were excellent pupils, including many
candidates to both national and international Mathematics contests. Vietnamese IMO 43 gold
medalist Pham Gia Vinh Anh is among his best pupils. Since his ultimate goal in teaching
mathematics is student’s full development in mathematics-based thinking, not merely the
mathematics knowledge itself, many of his students, on their outcome of what they acquired
in his classes, contribute actively in various fields of the Vietnamese society.

On realizing his dream of devoting entirely to mathematics science teaching and learning,
Tran Phuong has had a great passion for writing books on mathematics, especially on
inequalities. His first book, which was published in 1993, was a comprehensive work on
mathematical inequalities. From then on, he has completed a total of 10 books, all of which
were introduced by five first-ranked publishers in Vietnam (Education Publisher, Youth
Publisher, Knowledge Publisher, Ho Chi Minh Publisher and Da Nang Publisher) and soon
became the best-sellers among referenced books for secondary pupils in Vietnam. He is also
the author of an intellectual game show “Vietnamese Infant Prodigy” on television.

For his great contribution to mathematics teaching and learning in Vietnam, he was
awarded the noble “Vietnam’s Genius 2006” by Vietnamese government.
10 Diamonds in mathematical inequalities

III.2. Contributors:
1. Tran Tuan Anh
PhD Candidate, Shool of Mathemmatics Georgia Institute of Technology,
Atlanta,GA 30332, USA
2. Pham Gia Vinh Anh
Bachelor of Information Technology, University of Sydney, Australia,
Gold Medal in IMO 43
3. Nguyen Anh Cuong
Student of School of Computing, Singapore National University, course 2006-2010
4. Bui Viet Anh
Student of Department of Electronics and Telecommunications , University of
Technoly, Ha Noi,course 2005-2009, Vietnam
5. Le Trung Kien
Mathematics majored students, school period of 2004 - 2007, the Gifted High
School of Bac Giang, Vietnam
6. Phan Thanh Viet
Mathematics majored students, school period of 2004 - 2007, the Gifted High
Shool of Luong Van Chanh, Phu yen, Vietnam
7. Vo Quoc Ba Can
Mathematics majored students, school period of 2003 - 2006, the Gifted High
School of Ly Tu Trong, Can Tho, Vietnam
8. Hoang Trong Hien
Mathematics majored students, school period of 2005 - 2008, the Gifted High
School of Le Hong Phong, Nam Dinh, Vietnam
9. Nguyen Thuc Vu Hoang
Mathematics majored students, school period of 2005 - 2008, the Gifted High
School of Le Quy on, Quang Tri,Vietnam
10. Nguyen Quoc Hung
Academic Period of 2005 -2009, Faculty of Mathematics & Informatics,
University of Natural Sciences, Ho Chi Minh City, Vietnam
 Diamonds in mathematical inequalities 11

CHAPTER ONE: DIAMONDS IN

CLASSICAL MATHEMATICAL INEQUALITIES

§1.1. DIFFERENT COLORS IN CATCHING POINT OF INCIDENT

TECHNIQUE IN AM – GM INEQUALITY
Main points:
I. AM − GM inequality
1. General form
2. Special cases
3. Proof
II. Different colors in catching point of incident technique in AM – GM inequality
1. Point of incidence in evaluating from AM to GM
2. Point of incidence in evaluating from GM to AM
3. Point of free incidence or homogeneous principle in AM – GM inequality
4. Specialization in inequality of same degree 4. Specialize in homogeneous inequality
5. Non-symmetric point of incidence in AM – GM inequality
6. Balancing Coefficient Technique (Method of equalizing coefficient )
7. Using AM – GM in homogeneous inequality Applying AM – GM to inequality of different degree

8. Specialize in un-homogeneous inequality Specialization in inequality of different degree

9. The most beautiful solutions for four trigonometry inequalities
10. Selective problems in using point of incidence for AM – GM

I. AM − GM INEQUALITY
Suppose a1 , a2 ,...an are n non-negative real numbers, then:
a1 + a2 + ... + an
1.1. Form 1: ≥ n a1 a2 ...an
n
1.2. Form 2: a1 + a2 + ... + an ≥ n. n a1 a2 ...an
n
a1 + a2 + ... + an
1.3. Form 3: ≥ a1 a2 ....an
n
1.4. Equality occurs ⇔ a1 = a2 = ... = an ≥ 0
1.5. Corollary
• If a1 , a 2 ,..., a n ≥ 0 and a1 + a2 + ... + an = S is constant, then
n
S S
Max ( a1 a2 ...an ) = occurs ⇔ a1 = a2 = ... = an =
n n
• If a1 , a 2 ,..., a n ≥ 0 and a1 a2 ...an = P is constant, then

Min ( a1 + a2 + ...an ) = n. n P occurs ⇔ a1 = a2 = ... = an = n P

12 Point of incident technique in AM-GM inequality

n
n=2 n=3 n=4
Form
Condition ∀ a, b ≥ 0 ∀ a, b, c ≥ 0 ∀ a, b, c, d ≥ 0
a+b a+b+c 3 a+b+c+d 4
Form 1 ≥ ab ≥ abc ≥ abcd
2 3 4

Form 2 a + b ≥ 2. ab a + b + c ≥ 3. 3 abc a + b + c + d ≥ 4. 4 abcd

2 3 4
a+b a+b+c a+b+c+d
Form 3 ≥ ab ≥ abc ≥ abcd
2 3 4
Equality a=b a=b=c a=b=c=d
a1 + a2 + ... + an
≥ n a1 a2 ...an , ∀a1 , a 2 ,...a n ≥ 0 (1)
n

There are 36 solutions for this inequality; following is the proof by mathematic induction
2
a + a2
• For n = 2: 1 − a1a2 =
( a1 − a2 ) ≥0
a1 + a2
≥ a1a2
2 2 2

Equality occurs ⇔ a1 = a2. Suppose the inequality is true for n ≥ 2.

• We will prove the inequality is true for (n + 1) numbers a1 , a2 ,...an , an +1 ≥ 0

Using the inductive hypothesis for n numbers a1 , a2 ,...an ≥ 0 we have

( a1 + a2 + ... + an ) + an +1 n. n a1 a2 ...an + an +1 a1 a2 ...an = p n ( n +1)

S n +1 = ≥ . Let
n +1 n +1 an +1 = q n +1 for p, q ≥ 0

np n +1 + q n +1 np n+1 + q n+1
S n +1 ≥ (1). We will prove ≥ p n q = n+1 a1a2 ...an an+1 (2)
n +1 n +1

np n +1 + q n +1 1
We have:
n +1
− pn q =
n +1
np n ( p − q ) − q p n − q n ( )
( p − q)2
=
n +1
( ) (
p n −1 + p n − 2 ( p + q ) + ... + p p n − 2 + p n −3 .q + ... + q n − 2 + p n −1 + p n − 2 q + ...q n −1 ) ≥0

a1 + a 2 + ... + a n + a n +1 n +1
From (1) and (2) ≥ a1 a 2 ...a n a n +1
n +1

a1 = a 2 = ... = a n
Equality occurs ⇔ ⇔ a1 = a 2 = ... = a n = a n +1
p=q

According to the induction principle, the inequality is true for ∀n ≥ 2, n ∈

 Diamonds in mathematical inequalities 13

II. CATCH POINT OF INCIDENCE TECHNIQUE IN AM – GM INEQUALITY

1. POINT OF INCIDENCE IN EVALUATING FROM AM TO GM

Leading in:
a b
From a simple problem: Find the minimum value of S = + for a, b > 0
b a
a b a b
We can find out the solution: S = + ≥2 ⋅ = 2 . When a = b > 0, Min S = 2 but when we
b a b a
consider the problem in a different domain we will have an interesting problem connecting
with fix point of incidence in AM – GM inequality.

Problem 1. Given a ≥ 3. Find the minimum value of S = a + 1

a
Solution

• Common mistake: S = a + 1 ≥ 2 a ⋅ 1 = 2 Min S = 2

a a
1
• Cause: Min S = 2 ⇔ a = = 1 contradicts the assumption a ≥ 3
a
• Analyzing and finding the solution:
Consider the variation table of a, 1 and S to estimate Min S
a
a 3 4 5 6 7 8 9 10 11 12 30
1 1 1 1 1 1 1 1 1 1 1 1
a 3 4 5 6 7 8 9 10 11 12 30
1
S 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 30 1
3 4 5 6 7 8 9 10 11 12 30
As we can see from the Variation Table, if a increases, S increases and then it can be
estimated that S receives the least value at a = 3. We say Min = occurs at the point of

incidence a = 3.

Since in AM − GM Inequality the equality occurs on the condition that all joining numbers
are equal, at the point of incidence a = 3 we cannot use AM − GM Inequality directly for two
numbers a and 1 because 3 ≠ 1 . We assume that AM − GM Inequality is used for the
a 3

couple ( αa , 1a ) such that at the point of incidence a = 3 occur αa = 1a that means the following
‘Point of incidence’ Pattern holds:

a = 3
α α 1 3
Pattern: a = 3 = α = 9 : point of incidence coefficient
1 =1 3 α
a 3

We transform S according to the 'Point of incidence' Pattern as above.

14 Point of incident technique in AM-GM inequality

a 9 a (
• Right solution: S = a + 1 = a + 1 +
8a
9 )
≥ 2. a ⋅ 1 +
9 a
8.3 10
9
= . For a = 3 then Min S = 10
3 3

a,b > 0
Problem 2. Given Find the minimum value of the expression S = ab + 1
a + b ≤1 ab

Solution

• Common mistake : S = ab + 1 ≥ 2. ab ⋅ 1 = 2 Min S = 2

ab ab

• Cause: Min S = 2 ⇔ ab = 1 = 1 1 = ab ≤ a + b ≤ 1 1 ≤ 1 : illogical

ab 2 2 2

• Analyzing and finding the solution:

The expression S contains two variables a, b but if we take t = ab or t = 1 , the expression

ab
S = t + 1 will contain only one variable. When changing the variables we must find the
t
defined area of the new variables as follows:

1 1 1 1 1
t= ab = and t = ≥ 2
≥ 2
=4
ab t ab
(a+b
2 ) () 1
2

Problem will be: Given t ≥ 4. Find the minimum value of the expression S = t + 1
t
'Point of incidence' Pattern:
t 4
=
α α 1 4
t=4 = α = 16 : Point of incidence coefficient
1 1 4 α
=
t 4
General solution:

1 t 1 15t t 1 15t 2 15t 2 15.4 17

S =t + = + + ≥ 2. ⋅ + = + ≥ + =
t 16 t 16 16 t 16 4 16 4 16 4

1 17
For t = 4 or a = b = then Min S =
2 4
1
Reduced solution: Since t = 4 ⇔ a = b = we transform S directly as follows
2

1 1 15 1 15 17
S = ab + = ab + + ≥ 2. ab ⋅ + 2
≥
ab 16ab 16ab 16ab
(
16 a + b
2 ) 4

For a = b = 1 then Min S = 17

2 4
 Diamonds in mathematical inequalities 15

a,b,c > 0
1 1 1
Problem 3. Given 3 Find the minimum value of =a+b+c+ + +
a+b+c≤ a b c
2

Solution
1 1 1
• Common mistake: S = a + b + c + + + ≥ 6. 6 abc ⋅ 1 ⋅ 1 ⋅ 1 = 6 Min S = 6
a b c a b c
• Cause:

Min S = 6 ⇔ a = b = c = 1 = 1 = 1 = 1 a + b + c = 3 > 3 contradicts the assumption.

a b c 2
• Analyzing and finding the solution:

Since S is the symmetrical expression of a, b, c we estimate Min S occurs at a = b = c = 1

2
'Point of incidence':
1
a=b=c=
1 2 1 2
a=b=c= = α = 4 : Point of incidence coefficient
2 1 1 1 2 2 α
= = =
αa αb αc α
1 1 1 1 1 1 3 1 1 1
Method 1: S = a + b + c + + + = a+b+c+ + + + + +
a b c 4a 4b 4c 4 a b c

1 1 1 3 1 1 1 9 1
≥ 6. 6 abc ⋅ ⋅ ⋅ + 3. 3 ⋅ ⋅ =3+ ⋅
4 a 4b 4 c 4 a b c 4 3
abc

9 1 27 1 27 1 15 1 15
≥3+ ⋅ =3+ ⋅ ≥3+ ⋅ = . For a = b = c = then Min S =
4 a+b+c 4 a+b+c 4 3 2 2 2
3 2

a,b,c > 0
1 1 1
Problem 4. Given Find Min of = a2 + + b2 + 2 + c 2 + 2
a+b+c≤ 3 b 2
c a
2
Solution

1 1 1 1 1 1
• Common mistake: S ≥ 3.3 a2 + 2
⋅ b 2 + 2 ⋅ c 2 + 2 = 3.6 a 2 + 2 b2 + c2 +
b c a b c2 a2

1 1 1 6
≥ 3. 6 2 ⋅ a 2 ⋅ 2 ⋅ b2 ⋅ 2 ⋅ c2 ⋅ = 3. 8 = 3 2 Min S = 3 2
b2 c2 a2

• Cause: Min S = 3 2 ⇔ a = b = c = 1 = 1 = 1 = 1 a + b + c = 3 > 3 contradicts the assumption

a b c 2
• Analyzing and finding the solution:

Since S is the symmetrical expression of a, b, c we estimate Min S occurs at a = b = c = 1

2
16 Point of incident technique in AM-GM inequality

'Point of incidence' Pattern:

1
a2 = b2 = c2 =
1 4 1 4
a =b =c = = α = 16 : Point of incidence coefficient
2 1 1 1 4 4 α
2
= 2= 2=
αa αb αc α

1 1 1 1 1 1
S = a2 + 2
+ ⋅⋅⋅ + 2
+ b2 + 2
+ ⋅⋅⋅ + 2
+ c2 + 2
+ ⋅⋅⋅ +
16b 16b 16c 16c 16a 16a 2
16 terms 16 terms 16 terms

a2 b2 c2 a b c
≥ 17.17 + 17. 17
+ 17. 17
= 17 17 + 17 + 17
1616 b32 1616 c 32 1616 a 32 8 16
16 b 8 16
16 c 16 a16
8

a b c 1
≥ 17 3 ⋅ 3 17
8 16
⋅ 17 8 16
⋅ 17 = 3 17 ⋅ 17
16 b 16 c 16 a 16
8
16 a 5b 5c 5
8

3 17 3 17 3 17 1 3 17
= ≥ ≥ . For a = b = c = then Min S =
17 5 15 2 2 2
2⋅ (2a.2b.2c)
(
2 ⋅17 2a + 2b + 2c
3 )
a , b, c ≥ 0
Problem 6. Let . Find the minimum value of T = a + b + c + 1
2
a + b + c =1 2 2 abc

(Macedonia 1999)

Solution

• Common mistake: a + b + c + 1 ≥ 4⋅ 4 a ⋅b⋅c⋅ 1 = 4 Min T = 4

abc abc

• Cause: Min T = 4 ⇔ a = b = c = 1 ⇔ a = b = c = 1 contradicts the assumption.

abc

• Analyzing and finding the solution:

Estimate that the point of incidence of Min T is a = b = c = 1 , then 1 = 3 3

3 abc

'Point of incidence' Pattern:

a=b=c= 1
1 3 3 3 1
a=b=c= = α = 9 : Point of incidence coefficient
3 1 3 3 α 3
=
αabc α

• Right solution: a + b + c + 1 + 8 ≥ 4 ⋅ 4 a ⋅ b ⋅ c ⋅ 1 + 8
3
= 4 + 8 =4 3
9abc 9abc 9abc 3 3
9 a2 + b2 + c2
3
 Diamonds in mathematical inequalities 17

2. POINT OF INCIDENCE IN EVALUATING FROM GM TO AM

a1 + a 2 + ... + a n
Remark: Consider AM – GM inequality: ≥ n a1 a 2 ...a n , ∀a1 , a 2 ,...a n ≥ 0
n
n terms

Notices that in RHS expression GM we can see that the root index and the numbers of factors
inside the root are equal (both equal to n). Therefore, if these two quantities are different from
each other, they need adjusting towards being equal. In general, we usually deal with the problems
that we need to multiply the expressions with suitable constant so that the numbers of factors
inside the root are equal to the root index and suitable with the speculated point of incidence.

a,b,c ≥ 0
3
Problem 1. Given Find the minimum value of S = a+b + 3b+c + 3 c+a
a + b + c =1

Solution
• Common mistake: 3
a + b = 3 ( a + b ) .1.1 ≤ a + b + 1 + 1
3
+ 3 b + c = 3 ( b + c ) .1.1 ≤ b + c + 1 + 1
3
3
c + a = c + a ) .1.1 ≤
3 ( c + a +1+1
3
2(a + b + c) + 6 8 8
S = 3 a+b + 3b+c + 3 c+a ≤ = Max S =
3 3 3
• Causes of the mistake:
a + b =1
8
Max S = ⇔ + b + c = 1 2(a + b + c) = 3 ⇔ 2 = 3 illogical
3
c + a =1
• Estimation of the Point of incidence of Max S:
Since S is the symmetrical expression for a, b, c Max S often occurs when
a=b=c 1
⇔ a=b=c= ⇔a+b=b+c=c+a= 2
a + b + c =1 3 3

• Right solution: 2 2
( a + b) + +
3 9 2 2 9 3 3
a + b = 3 ⋅ 3 ( a + b) ⋅ ⋅ ≤ 3 ⋅
4 3 3 4 3
2 2
(b + c) + +
+ 3 9 2 2 9 3 3
b + c = 3 ⋅ 3 (b + c) ⋅ ⋅ ≤ 3 ⋅
4 3 3 4 3
2 2
(c + a ) + +
3 9 2 2 9 3 3
c + a = 3 ⋅ 3 (c + a ) ⋅ ⋅ ≤ 3 ⋅
4 3 3 4 3

9 2(a + b + c) + 4 3 9 6 3
S = 3 a+b + 3b+c + 3 c+a ≤ 3 ⋅ = ⋅ = 18
4 3 4 3
For a + b = b + c = c + a = 2 ⇔ a = b = c = 1 , Max S = 3 18
3 3
18 Point of incident technique in AM-GM inequality

a, b, c>0
Problem 2. Given Find the greatest value of the expression:
a+b+c=3

= 3 a ( b + 2c ) + 3 b ( c + 2a ) + 3 c ( a + 2b )
Solution
• Estimation of the Point of incidence of Max S:
Since S is the symmetrical expression for a, b, c Max S often occurs when
a=b=c 3a = 3b = 3c = 3
⇔ a = b = c =1
a+b+c=3 b + 2c = c + 2a = a + 2b = 3
• Right solution:
3a + ( b + 2c ) + 3
a ( b + 2c ) = 1 ⋅ 3 3a ( b + 2c ) .3 ≤ 1 ⋅
3
3 3 3
9 9
3b + ( c + 2a ) + 3
+ 3 b ( c + 2a ) = 31 ⋅ 3 3b ( c + 2a ) .3 ≤ 31 ⋅
9 9 3
3c + ( a + 2b ) + 3
3
c ( a + 2b ) = 1 ⋅ 3 3c ( a + 2b ) .3 ≤ 1 ⋅
3 3 3
9 9
6(a + b + c) + 9
S = 3 a ( b + 2c ) + 3 b ( c + 2a ) + 3 c ( a + 2b ) ≤ 1 ⋅ = 1 ⋅9 = 3⋅ 3 3
3 3 3
9 9
For a = b = c = 1 , Max S = 3. 3 3
a, b, c>0
Problem 3. Given Find the greatest value of the expression:
a 2 + b 2 + c 2 = 12

= a ⋅ 3 b2 + c 2 + b ⋅ 3 c2 + a2 + c ⋅ 3 a 2 + b2
Solution
• Estimation of the Point of incidence of Max S:
Since S is the symmetrical expression for a, b, c Max S often occurs when
a=b=c>0 2a 2 = 2b 2 = 2c 2 = 8
⇔a=b=c=2
a 2 + b 2 + c 2 = 12 b2 + c2 = c2 + a2 = a2 + b2 = 8
• Right solution:
2 ( 2 2)
a ⋅ 3 b2 + c2 = a6 ( b2 + c2 ) = 1 ⋅
6 2 6
( 2a 2 )3 ( b 2 + c 2 )2 .8 ≤ 1 ⋅ 6a + 2 b + c + 8
2 2 6
2 3 2 ( 2 2)
2
+ b ⋅ 3 c 2 + a 2 = 6 b6 ( c 2 + a 2 ) = 1 ⋅ 6 ( 2b 2 ) ( c 2 + a 2 ) .8 ≤ 1 ⋅ 6b + 2 c + a + 8
2 2 6
2 3 2 6c + 2 ( a 2 + b 2 ) + 8
2
c ⋅ 3 a 2 + b 2 = c 6 ( a 2 + b 2 ) = 1 ⋅ ( 2c 2 ) ( a 2 + b 2 ) .8 ≤ 1 ⋅
6 6
2 2 6

10 ( a 2 + b 2 + c 2 ) + 24
S = a ⋅ 3 b2 + c2 + b ⋅ 3 c2 + a 2 + c ⋅ 3 a 2 + b2 ≤ 1 ⋅ = 12
2 6
For a = b = c = 2 , Max S = 12
 Diamonds in mathematical inequalities 19

Problem 4. Let be given a ≥ 2; b ≥ 6; c ≥ 12. Find the greatest value of

bc a − 2 + ca ⋅ 3 b − 6 + ab ⋅ 4 c − 12
S=
abc
Solution
bc bc (a − 2) + 2 abc
bc a − 2 = (a − 2).2 ≤ ⋅ =
2 2 2 2 2
ca ca (b − 6) + 3 + 3 abc
+ ca ⋅ 3 b − 6 = ⋅ 3 (b − 6).3.3 ≤ ⋅ =
3 3
9 9 2 2. 3 9

ab ab (c − 12) + 4 + 4 + 4 abc
ab ⋅ 4 c − 12 = ⋅ 4 (c − 12).4.4.4 ≤ ⋅ =
4 4 4
64 64 8. 2

1 abc abc abc 5 1

S≤ ⋅ + + = +
3
abc 2 2 8 2 3. 9 8 2 2. 3 9
a−2=2 a=4
5 1
For b − 6 = 3 ⇔ b = 9 , Max S = +
8 2 3. 3 9
c − 12 = 4 c = 16

Problem 5. Prove that: S = 1 + 2 + 1 + 3 3 + 1 + ... + n n +1 < n +1

2 3 n
Solution
k + 1 + (k − 1)
k +1 1
We have k = k k + 1 ⋅ 1...1 < k = 1 + 2 . It follows
k k k k
k −1factors

1 1 1 1 1 1 1 1 1
S <1+ 1+ 2
+ 1 + 2 + ... + 1 + 2 =n+ 2
+ 2 + ... + 2 < n + + + ... +
2 3 n 2 3 n 1× 2 2 × 3 (n − 1) × n

( ) ( ) (
= n + 1 − 1 + 1 − 1 + ... + 1 − 1 = n + 1 − 1 < n + 1
1 2 2 3 n −1 n n ) ( )
n n
n 1+ n n n
Problem 6. Prove that: + 1− <2
n n
Solution
n
n
1+ + ( n − 1)
n
n n n n n
n
n 1+ = n 1+ . 1...1 < =1+
n n n −1factors n n2
+
n
n
1− + (n − 1)
n
n n n n n
n
n 1− = n 1− . 1...1 < =1−
n n n−1factors 2
n n

n n n n
n 1+ n n n n n
+ 1− < 1+ 2 + 1− 2 = 2
n n n n
20 Point of incident technique in AM-GM inequality

3. POINT OF FREE INCIDENCE OR HOMOGENEOUS PRINCIPLE IN AM – GM INEQUALITY

Inequalities mentioned in this section are illustrated by polynomial functions for three
variables a, b, c > 0, which does not lose either the essence or the generality of the issue. We
will approach this technique from the simplest problems.

Degree of the monomial: The monomial aαbβcγ has its degree as (α+β+γ)

a 4 b 4 c 4 a 5 b5 c 5
For example: 3-degree monomials: a3 , b3 , c3 , a 2 b, b2 c, c 2 a, , , , , , ,
b c a b2 c2 a 2
a 5 b5 c 5 a 6 a 6 a 7 a 7 a 7 a8 a8 a8 a9
, , , 3, 2 , 4 , , , , , , ⋅⋅⋅⋅⋅⋅⋅⋅⋅
bc ca ab b b c b bc 3 b 2 c 2 b5 b3 c 2 bc 4 b 4 c 2
Thus there are countless 3-degree monomials written by variables a, b, c and generally we
have countless given k-degree monomials written by three variables a, b, c.
Setting the matter: First of all, we will compare F(a, b, c) with G(a, b, c) as polynomials
of different degrees, in the following representative problem:

Problem: Prove that: ∀a, b, c > 0 we have a 2000 + b 2000 + c 2000 ≥ a + b + c (*)
Analysis: Suppose (*) is true, then let a = b = c > 0 we have
(*) ⇔ 3a2000 ≥ 3a ⇔ a2000 ≥ a
Since a2000 ≥ a is true for a ≥ 1 and a2000 ≥ a is false for a ∈ (0, 1), it follows

If a, b, c > 0, a 2000 + b 2000 + c 2000 ≥ a + b + c is false

If reducing the definite area a, b, c ≥ 1 then a2000 ≥ a, b2000 ≥ b, c2000 ≥ c and we will have a
mediocre inequality a 2000 + b 2000 + c 2000 ≥ a + b + c , ∀a, b, c ≥ 1

If reducing the definite area a, b, c ∈(0,1) then a2000 < a, b2000 < b, c2000 < c and we will
also have a mediocre inequality a 2000 + b 2000 + c 2000 < a + b + c ∀a, b, c ∈ (0, 1)
Conclusion: We should not compare polynomials of different degrees on the definite area
+
. Since there are infinite ways of writing given k-degree monomials, the following
problems set the matter that compares polynomial functions of same degree with degrees of
monomials written in different forms.
General principle: When applying this technique we need to note that the monomials added
to use AM − GM Inequality must have the same degrees with the monomials taken from the
polynomials in the inequality to be proved. This technique will be illustrated more clearly in
the following problems.
All inequalities following are generally in the form of fraction. Therefore, the most common
technique to solve them is eliminating denominators to turn them into the form of
polynomials. If we choose to eliminate denominators by equivalent transformation, i.e. equalizing
denominators, the solution will be very lengthy. Here, we will eliminate denominators by
adding reasonable expressions to use AM – GM inequality. All inequalities in the following
sections can be generated by the same ideas. However the generating idea is not so special so
it will be remained for the readers.
 Diamonds in mathematical inequalities 21

a 2 b2 c2
Problem 1. Prove that + + ≥ a + b + c ∀a, b, c > 0
b c a

Proof
Remark: Both sides are polynomials containing 1-degree monomials

Using AM − GM Inequality we have

a2 a2
+b≥2 ⋅ b = 2 a 2 = 2a
b b

b2 b2
+ +c≥2 ⋅ c = 2 b 2 = 2b
c c

c2 c2
+a≥2 ⋅ a = 2 c 2 = 2c
a a

a2 b2 c2
+ + + (a + b + c) ≥ 2 (a + b + c) (q.e.d.)
b c a

Equality occurs ⇔ a = b = c > 0

a3 b3 c3
Problem 2. Prove that + + ≥ a + b + c , ∀a , b, c > 0
b2 c2 a2

Proof
Remark: Both sides are polynomials containing 1-degree monomials

Using AM − GM Inequality we have

a3 3 a
3
+ b + b ≥ 3. ⋅ b ⋅ b = 3a
b2 b2

b3 3 b
3
+ + c + c ≥ 3. ⋅ c ⋅ c = 3b
c2 c2

c3 3 c
3
+ a + a ≥ 3. ⋅ a ⋅ a = 3c
a2 a2

a 3 b3 c3
+ + + 2( a + b + c ) ≥ 3( a + b + c ) (q.e.d.)
b2 c2 a2

Equality occurs ⇔ a = b = c > 0

22 Point of incident technique in AM-GM inequality

a 3 b3 c 3 a 2 b 2 c 2
Problem 3. Prove that + + ≥ + + ∀a, b, c > 0
b2 c2 a2 b c a

Proof
2 2 2
1st solution: Lemma: a + b + c ≥ a + b + c ∀a, b, c > 0
b c a

a3 a3 a2
+ a ≥ 2 ⋅ a = 2
b2 b2 b
b3 b3 b2
Application: + + b ≥ 2 ⋅ b = 2
c2 c2 c
c3 c3 c2
+ c ≥ 2 ⋅ c = 2
a2 a2 a

2 2 2
a 3 + b3 + c 3 + ( a + b + c ) ≥ 2 a 2 + b 2 + c 2 ≥ a + b + c + (a + b + c)
b2 c 2 a 2 b c a b c a

a 3 + b 3 + c 3 ≥ a 2 + b 2 + c 2 . Equality occurs ⇔ a = b = c > 0

b2 c2 a2 b c a

2nd solution: Lemma: x 3 + y 3 ≥ xy ( x + y ) ∀x, y > 0

x 3 + x 3 + y 3 ≥ 3. 3 x 3 x 3 y 3 = 3 x 2 y
Proof: +
y 3 + y 3 + x3 ≥ 3. 3 y 3 y 3 x3 = 3 y 2 x

3( x3 + y 3 ) ≥ 3 xy ( x + y ) x 3 + y 3 ≥ xy ( x + y )

Or proof : x 3 + y 3 = ( x + y )( x 2 + y 2 − xy ) ≥ ( x + y )(2 xy − xy ) = xy ( x + y )

Application: a3 a 3 + b3 ab(a + b) a 2
+ b = ≥ = +a
b2 b2 b2 b
b3 b3 + c 3 bc(b + c) b 2
+ + c = ≥ = +b
c2 c2 c2 c
c3 c3 + a 3 ca(c + a ) c 2
+ a = ≥ = +c
a2 a2 a2 a

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

a3 + b3 + c3 ≥ a 2 + b 2 + c 2
b2 c2 a2 b c a

Equality occurs ⇔ a = b = c > 0

 Diamonds in mathematical inequalities 23

a3 b3 c3
Problem 4. Prove that + + ≥ a + b + c, ∀a, b, c > 0 (Canada MO 2002)
bc ca ab

Proof
Remark: Both sides are polynomials containing 1-degree monomials

Using AM − GM Inequality we have

a3 a3
+ b + c ≥ 3⋅3 ⋅ b ⋅ c = 3a
bc bc

b3 b3
+ + c + a ≥ 3⋅3 ⋅ c ⋅ a = 3b
ca c

c3 c3
+ a + b ≥ 3⋅3 ⋅ a ⋅ b = 3c
a a

a3 b3 c3
+ + + 2 (a + b + c) ≥ 3(a + b + c) (q.e.d)
bc ca ab

Equality occurs ⇔ a = b = c > 0

a3 b3 c3
Problem 5. Prove that + + ≥ ab + bc + ca , ∀a, b, c > 0
b c a

Proof
Remark: Both sides are polynomials containing 2-degree monomials

Using AM − GM Inequality we have

a3 b3 a3 b3
+ + bc ≥ 3.3 ⋅ ⋅ bc = 3 ab
b c b c

b3 c3 b3 c3
+ + + ca ≥ 3.3 ⋅ ⋅ ca = 3bc
c a c a

c3 a3 c3 a3
+ + ab ≥ 3.3 ⋅ ⋅ ab = 3ca
a b a b

a3 b3 c3
2 + + + ( ab + bc + ca ) ≥ 3( ab + bc + ca )
b c a

a3 b3 c3
+ + ≥ ab + bc + ca .
b c a
Equality occurs ⇔ a = b = c > 0
24 Point of incident technique in AM-GM inequality

a 5 b5 c 5
Problem 6. Prove that 3
+ 3 + 3 ≥ a 2 + b2 + c2 ∀a, b, c > 0
b c a

Proof
Remark: Both sides are polynomials containing 2-degree monomials

Using AM − GM Inequality we have

a5 a5 2 2 2 5 a
5
a5 2 2 2
+ + b + b + b ≥ 5. ⋅ ⋅ b ⋅ b ⋅ b = 5a 2
b3 b3 b3 b 3

b5 b5 2 2 2 5 b
5
b5 2 2 2
+ + + c + c + c ≥ 5. ⋅ ⋅ c ⋅ c ⋅ c = 5b 2
c3 c3 c3 c3

c5 c5 2 2 2 5 c
5
c5 2 2 2
+ + a + a + a ≥ 5. ⋅ ⋅ a ⋅ a ⋅ a = 5c 2
a3 a3 a3 a3

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

a 5 b5 c 5
+ + ≥ a 2 + b2 + c 2 . Equality occurs ⇔ a = b = c > 0
b3 c 3 a 3

a 5 b5 c5 a 4 b 4 c 4
Problem 7. Prove that + + ≥ + + , ∀a , b , c > 0
b3 c3 a 3 b 2 c 2 a 2

Proof
Remark: Both sides are polynomials containing 2-degree monomials

Using AM − GM Inequality we have

4
a5 a5 a5 a5 2 a5 a4
+ + + + b ≥ 5. 5 ⋅ b2 = 5
b3 b3 b3 b3 b3 b2

4
b5 b5 b5 b5 b5 b4
+ 3 + 3 + 3 + 3 + c 2 ≥ 5. 5 3 ⋅ c2 = 5
c c c c c c2

4
c5 c5 c5 c5 2 c5 c4
+ + + + a ≥ 5. 5 ⋅ a2 = 5
a3 a3 a3 a3 a3 a2

a 5 b5 c 5 2 2 2 a 4 b4 c 4
4 + + + ( a + b + c ) ≥ 5 + + (1)
b3 c3 a3 b2 c2 a 2
 Diamonds in mathematical inequalities 25

On the other hand

a4 a4 2
2
+ b2 ≥ 2 2
⋅ b = 2 a 4 = 2a 2
b b

b4 2 b4 2
+ + c ≥ 2 ⋅ c = 2 b 4 = 2b 2
c2 c2

c4 2 c4
+ a ≥ 2 ⋅ a 2 = 2 c 4 = 2c 2
a2 a2

a4 b4 c4
+ + + (a 2 + b 2 + c 2 ) ≥ 2(a 2 + b 2 + c 2 )
b2 c2 a2

a 4 b4 c4
+ + ≥ a 2 + b 2 + c 2 (2). From (1) and (2) follows
b2 c2 a2
a 5 b5 c 5 2 2 2 a4 b4 c4
4 + + + ( a + b + c ) ≥ 4 + + + (a 2 + b 2 + c 2 )
b3 c 3 a 3 b2 c2 a2

a5 b5 c5 a 4 b 4 c 4
⇔ + + ≥ + + (q.e.d.).
b3 c3 a3 b2 c2 a 2
Equality occurs ⇔ a = b = c > 0

a 3 b3 c 3 a 2 b 2 c 2
Problem 8. Prove that + + ≥ + + ∀a, b, c > 0
b3 c 3 a 3 b 2 c 2 a 2
Proof
Remark: Both sides are polynomials containing 0-degree monomials
Using AM − GM Inequality we have

a3 a3 3 a
3
a3 a2
+ + 1 ≥ 3 . ⋅ ⋅ 1 = 3 ⋅
b3 b3 b3 b3 b2

b3 b3 3 b
3
b3 b2
+ + + 1 ≥ 3 . ⋅ ⋅ 1 = 3 ⋅
c3 c3 c3 c3 c2

c3 c3 3 c
3
c3 c2
+ + 1 ≥ 3 . ⋅ ⋅ 1 = 3 ⋅
a3 a3 a3 a3 a2

a 3 b3 c 3 a 2 b2 c2 a2 b2 c2
2 + + + 3 ≥ 2 + + + + +
b3 c 3 a 3 b2 c 2 a 2 b2 c2 a2

a2 b2 c2 3 a
2
b2 c2 a2 b2 c2
≥2 + + + 3. ⋅ ⋅ = 2 + + +3
b2 c2 a 2 b2 c2 a 2 b2 c 2 a2

a 3 b3 c 3 a 2 b 2 c 2
+ + ≥ + + Equality occurs ⇔ a = b = c > 0
b3 c 3 a 3 b 2 c 2 a 2
26 Point of incident technique in AM-GM inequality

a 2 b2 c2 1 1 1
Problem 9. Prove that 5
+ 5 + 5 ≥ 3 + 3 + 3 ∀a , b, c > 0
b c a b c a
Proof
Remark: Both sides are polynomials containing (–3)-degree monomials

a2 a2 a2 1 1 5 a
2
a2 a2 1 1 1
5
+ 5
+ 5
+ 3
+ 3
≥ 5. 5
⋅ 5
⋅ 5 ⋅ 3 ⋅ 3 =5⋅ 3
b b b a a b b b a a b

b2 b2 b2 1 1 5 b
2
b2 b2 1 1 1
+ 5
+ 5
+ 5
+ 3
+ 3
≥ 5. 5
⋅ 5
⋅ 5 ⋅ 3 ⋅ 3 = 5⋅ 3
c c c b b c c c b b c

c2 c2 c2 1 1 3 c
2
c2 c2 1 1 1
5
+ 5
+ 5
+ 3
+ 3
≥ 5. 5
⋅ 5
⋅ 5 ⋅ 3 ⋅ 3 = 5⋅ 3
a a a c c a a a c c a

a2 b2 c2 1 1 1 1 1 1
3 + + +2 + + ≥5 3 + 3 + 3
b5 c5 a 5 a3 b3 c3 a b c

a2 b2 c2 1 1 1
+ + ≥ 3 + 3 + 3 . Equality occurs ⇔ a = b = c > 0
b5 c5 a5 a b c

Problem 10. Prove that 1 + 1 + 1 ≤ 1 , ∀a, b, c > 0

a 3 + b 3 + abc b 3 + c 3 + abc c 3 + a 3 + abc abc
(USAMO 1998)
Proof
Remark: x 3 + y 3 = ( x + y ) ( x 2 + y 2 − xy ) ≥ ( x + y )( 2 xy − xy ) = ( x + y ) xy , ∀x, y ≥ 0

1 ≤ 1 = 1 = c
3 3
a + b + abc ( ) (
a + b ab + abc ab a + b + c ) abc a + b + c )
(
1 ≤ 1 = 1 = a
+
b 3 + c 3 + abc ( b + c ) bc + abc bc ( a + b + c ) abc ( a + b + c )
1 ≤ 1 = 1 = b
c 3 + a 3 + abc ( c + a ) ca + abc ca ( a + b + c ) abc ( a + b + c )

1 + 1 + 1 ≤ a+b+c = 1
a 3 + b 3 + abc b 3 + c 3 + abc c 3 + a 3 + abc abc ( a + b + c ) abc

Problem 11. Prove that a + b + c ≥ a + b + c , ∀a , b, c > 0

b+c c+a a+b a+b b+c c+a
Proof
Remark: Both sides are polynomials containing 0-degree monomials

( b +a c + c +b a + a +c b ) + ( a b+ b + b +c c + c +a a )
= b + c + c + a + a + b ≥ 3 ⋅ 3 b + c ⋅ c + a ⋅ a + b = 3 (1)
a+b b+c c+a a+b b+c c+a
 Diamonds in mathematical inequalities 27

( a +a b + b +b c + c +c a ) + ( a b+ b + b +c c + c +a a ) = aa ++ bb + bb ++ cc + cc ++ aa = 3 (2)
From (1) and (2) it follows: a + b + c ≥ a + b + c (q.e.d.)
b+c c+a a+b a+b b+c c+a

Equality occurs ⇔ a = b = c > 0

Problem 12. Prove that a + b + c ≥ 3 , ∀a , b, c > 0

b+c c+a a+b 2

Proof

S = a + b + c ;A = b + c + a ;B = c + a + b
b+c c+a a+b b+c c+a a+b b+c c+a a+b

A + S = a + b + b + c + c + a ≥ 3⋅3 a + b ⋅ b + c ⋅ c + a = 3
b+c c+a a+b b+c c+a a+b

B + S = c + a + a + b + b + c ≥ 3⋅ 3 c + a ⋅ a + b ⋅ b + c = 3
b+c c+a a+b b+c c+a a+b

A+ B= b+c + c+a + a+b =3

b+c c+a a+b

6 ≤ ( A + S ) + ( B + S ) = ( A + B ) + 2S = 3 + 2S 3 ≤ 2S S≥3
2

2 (a + b + c)
b ( )( )( )
Problem 13. Prove that 1 + a 1 + b 1 + c ≥ 2 +
c a 3
abc
(1) (APMO 1998)

Proof

(1) ⇔ 2 + a + b + c + b + c + a ≥ 2 +
b c a a b c
2 (a + b + c)
3
abc
⇔ a+b+c + b+c+a ≥
b c a a b c
2 (a + b + c)
( 3
abc
) (
(2) )
Using AM − GM Inequality we have:

a + a + b ≥ 3 ⋅ 3 a ⋅ a ⋅ b = 3a b + b + c ≥ 3 ⋅ 3 b ⋅ b ⋅ c = 3b
b b c b b c 3 abc a a b a a b 3 abc

+ b + b + c ≥ 3 ⋅ 3 b ⋅ b ⋅ c = 3b + c + c + a ≥ 3 ⋅ 3 c ⋅ c ⋅ a = 3c
c c a c c a 3 abc b b c b b c 3 abc

c + c + a ≥ 3 ⋅ 3 c ⋅ c ⋅ a = 3c a + a + b ≥ 3 ⋅ 3 a ⋅ a ⋅ b = 3a
a a b a a b 3 abc c c a c c a 3 abc

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

From (3) and (4) it follows q.e.d.

28 Point of incident technique in AM-GM inequality

Problem 14. Prove that a 7 + b 7 + c 7 ≥ a 5 b 2 + b 5 c 2 + c 5 a 2 , ∀a, b, c > 0

Proof
Using AM − GM Inequality we have:
7
a 7 + a 7 + a 7 + a 7 + a 7 + b 7 + b 7 ≥ 7 ⋅ a 7 ⋅ a 7 ⋅ a 7 ⋅ a 7 ⋅ a 7 ⋅ b 7 ⋅ b 7 = 7a 5 b 2
7
+ b 7 + b 7 + b 7 + b 7 + b 7 + c 7 + c 7 ≥ 7 ⋅ b 7 ⋅ b 7 ⋅ b 7 ⋅ b 7 ⋅ b 7 ⋅ c 7 ⋅ c 7 = 7b 5 c 2
7
c 7 + c 7 + c 7 + c 7 + c 7 + a 7 + a 7 ≥ 7 ⋅ c 7 ⋅ c 7 ⋅ c 7 ⋅ c 7 ⋅ c 7 ⋅ a 7 ⋅ a 7 = 7c 5 a 2

7 ( a 7 + b 7 + c 7 ) ≥ 7 ( a 5b 2 + b 5 c 2 + c 5 a 2 ) (q.e.d)
n

( ) , ∀a, b, c > 0; n ∈
n n n
Problem 15. Prove that a + b + c ≥ a + b + c
3 3

Proof
Using AM − GM Inequality we have:
n n ( n −1) n −1

(
a n + ( n − 1) a + b + c
3 ) (
≥ n ⋅ n an a + b + c
3 ) (
=n a+b+c
3 ) a

n n ( n −1) n −1

(
+ b n + ( n − 1) a + b + c
3 ) (
≥ n ⋅ n bn a + b + c
3 ) (
=n a+b+c
3 ) b

n n ( n −1) n −1

(
c n + ( n − 1) a + b + c
3 ) (
≥ n ⋅ n cn a + b + c
3 ) (
=n a+b+c
3 ) c

n −1 n n

(
(a n + bn + cn ) ≥ n a + b + c
3 ) ( a + b + c ) − 3 ( n − 1) a + b + c
3 ) = 3 ( a + 3b + c ) (q.e.d)
(
n n n
Problem 16. Prove that a n + b n + c n ≥ ( a + 2b ) + ( b + 2c ) + ( c + 2a ) , ∀a, b, c > 0; n ∈
3 3 3

Proof
n
xn + yn + zn x+ y+z
Lemma: ≥ , ∀x, y, z > 0; n ∈
3 3
Application: Using lemma we have:
n n

(
an + bn + bn ≥ a + b + b
3 3 ) = ( a +32b )
n n
≥ ( b + c + c ) = ( b + 2c )
n n n
+ b +c +c
3 3 3
n n
cn + an + an ≥ ( c + a + a ) = ( c + 2a )
3 3 3
n n n

3 (
a n + b n + c n ≥ a + 2b ) ( + b + 2c
3 ) ( + c + 2a
3 ) (q.e.d)
 Diamonds in mathematical inequalities 29

Problem 17. Let be given a, b, c, d > 0. Find the minimum value of the expression:

a b c d
S= + + + +
b+c+d c+d +a a+b+b a+b+c
b+c+d c+a+d d +a+b a+b+c
+ + + +
a b c d

Solution

• Common mistake:

Using AM − GM Inequality directly for eight factors

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

S ≥ 8⋅ 8 . . . . . . . =8 Min S = 8
b+c+d c+d +a d +a+b a+b+c a b c d

• Causes of the mistakes:

a = b+c+d

b = c+d +a
Min S = 8 ⇔ a + b + c + d = 3(a + b + c + d ) 1 = 3 : illogical
c = d +a+b

d = a+b+c

• Analysis and solutions:

To find Min S we need to note that S is a symmetric expression for a, b, c, d; thus, Min S
(or Max S) will occur at the "free point of incidence": a = b = c = d > 0 .

4 1
Thus let be given a = b = c = d > 0 and estimate Min S = + 12 = 13
3 3
It follows that the estimated condition for equality to occur in all the component inequalities
is the sub-set of the estimated condition a = b = c = d > 0
• Point of incidence Pattern: Let be given a = b = c = d > 0 we have
a b c d 1
= = = =
b+c+d c+d +a d +a+b a+b+c 3 1 3
= α=9
b+c+d c+d +a d +a+b a+b+c 3 3 α
= = = =
αa αb αc αd α
Right solution: Transforming and using AM − GM Inequality we have
a b+c+d 8 b+c+d
S= + + . ≥
cyc b+c+d 9a cyc 9 9a

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

≥ 8⋅ 8 . . . . . . .
b+c+d c+d +a d +a+b a+b+c 9a 9b 9c 9d

8 b c d c d a d a b a b c
+ + + + + + + + + + + +
9 a a a b b b c c c d d d
30 Point of incident technique in AM-GM inequality

8 8 b c d c d a d a b a b c 8 8 8 32 40 1
≥ + ⋅12 ⋅ 12 ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ = + .12 = + = = 13
3 9 a a a b b b c c c d d d 3 9 3 3 3 3

1
For a = b = c = d > 0, Min S = 13
3

Problem 18. Let be given a, b, c, d > 0. Find the minimum value of the expression:

2a 2b 2c 2d
S = 1+ 1+ 1+ 1+
3b 3c 3d 3a

Solution
• Common mistake:

2a 2b 2c 2d 2a 2b 2c 2d 64 64
S = 1+ 1+ 1+ 1+ ≥ 2 ⋅2 ⋅2 ⋅2 = Min S =
3b 3c 3d 3a 3b 3c 3d 3a 9 9

• Causes of the mistake:

64 2a 2b 2c 2d 2(a + b + c + d ) 2
Min S = ⇔ 1= = = = = = illogical
9 3b 3c 3d 3a 3( a + b + c + d ) 3

• Analysis and solutions:

Since S is a symmetric expression for a, b, c, d we estimate Min S occurs at Free point of

4
2 625
incidence: a = b = c = d > 0, then S = 1 + =
3 81

Right solution: Using AM − GM Inequality we have

2
3 2
1+
2a 1 1 1 a
= + + + +
a
3b 3 3 3 3b 3b
≥5⋅ 5 1
3() ( ) () ⋅ a
3b
5
= a
3 b
5

2
3 2
≥ 5⋅ (1) ⋅( b ) = (b)
2b 1 1 1 b b 5 5
1+ = + + + + 5
3c 3 3 3 3c 3c 3 3c 3 c
+ 2
3 2
≥ 5⋅ (1) ⋅( c ) = ( c )
2c 1 1 1 c c 5 5
1+ = + + + + 5
3d 3 3 3 3d 3d 3 3d 3 d
2
3 2
≥ 5⋅ (1) ⋅( d ) = ( d )
2d 1 1 1 d d 5 5
1+ = + + + + 5
3a 3 3 3 3a 3a 3 3a 3 a

2
2a 2b 2c 2d 625 a b c d 5 625
S = 1+ 1+ 1+ 1+ ≥ ⋅ ⋅ ⋅ ⋅ =
3b 3c 3d 3a 81 b c d a 81

625
For a = b = c = d > 0, Min S =
81
 Diamonds in mathematical inequalities 31

4. METHOD OF SPECIALIZING INEQUALITY OF THE SAME DEGREE:

a , b, c > 0
Problem 1. Given . Prove that a3 + b3 + c3 ≥3
a+b+c=3 ( a + b) ( a + c ) (b + c ) (b + a ) ( c + a ) (c + b) 4

Solution
We can transform the above inequality to the 1-degree homogeneous inequality as follows:
a3 + b3 + c3 ≥ a+b+c
( a + b) ( a + c ) (b + c ) (b + a ) ( c + a ) ( c + b) 4

Using AM – GM inequality, we have:

a3 + a + b + a + c ≥ 3⋅ 3 a3 ⋅ a + b ⋅ a + c = 3a
(a + b) (a + c) 8 8 (a + b) (a + c) 8 8 4

+ b3 + b + c + b + a ≥ 3⋅ 3 b3 ⋅ b + c ⋅ b + a = 3b
(b + c ) (b + a ) 8 8 (b + c ) (b + a ) 8 8 4

c3 + c + a + c + b ≥ 3⋅ 3 c3 ⋅ c + a ⋅ c + b = 3c
(c + a) (c + b) 8 8 (c + a) (c + b) 8 8 4

a3 + b3 + c3 ≥ a + b + c = 3 (q.e.d)
( a + b) ( a + c ) (b + c ) (b + a ) ( c + a ) ( c + b) 4 4

a , b, c > 0
Problem 2. Given . Prove that a3 + b3 + c3 ≥1
a+b+c=3 b ( 2c + a ) c ( 2a + b ) a ( 2b + c )

Solution
We can transform the above inequality to the 1-degree homogeneous inequality as follows:
a3 + b3 + c3 ≥ a + b + c . Using AM – GM Inequality we have:
b ( 2c + a ) c ( 2a + b ) a ( 2b + c ) 3

9a 3 + 3b + ( 2c + a ) ≥ 3 ⋅ 3 9a 3 ⋅ 3b ( 2c + a ) = 9a
b ( 2c + a ) b ( 2c + a )

+ 9b 3 + 3c + ( 2a + b ) ≥ 3 ⋅ 3 b3 ⋅ 3c ( 2a + b ) = 9b
c ( 2a + b ) c ( 2a + b )

9c 3 + 3a + ( 2b + c ) ≥ 3 ⋅ 3 c3 ⋅ 3a ( 2b + c ) = 9c
a ( 2b + c ) a ( 2b + c )

9 a3 + b3 + c3 + 6 (a + b + c) ≥ 9 (a + b + c)
b ( 2c + a ) c ( 2a + b ) a ( 2b + c )

a3 + b3 + c3 ≥ a + b + c = 1 (q.e.d)
b ( 2c + a ) c ( 2a + b ) a ( 2b + c ) 3
32 Point of incident technique in AM-GM inequality

a , b, c > 0
Problem 3. Given . Prove that a3 + b3 + c3 ≥ 1
a2 + b2 + c2 =1 b + 2c c + 2a a + 2b 3

Solution
We can transform the above inequality to the 2-degree homogeneous inequality as follows:
a3 + b3 + c3 ≥ a 2 + b2 + c2
b + 2c c + 2a a + 2b 3
Using AM – GM Inequality we have:

9 a 3 + a ( b + 2c ) ≥ 2 9 a 3 ⋅ a ( b + 2c ) = 6 a 2
b + 2c b + 2c

+ 9b 3 + b ( c + 2a ) ≥ 2 9b 3 ⋅ b ( c + 2a ) = 6b 2
c + 2a c + 2a

9c 3 + c ( a + 2b ) ≥ 2 9c 3 ⋅ c ( a + 2b ) = 6c 2
a + 2b a + 2b

9 a3 + b3 + c3 + 3 ( ab + bc + ca ) ≥ 6 ( a 2 + b 2 + c 2 )
b + 2c c + 2a a + 2b

9 a3 + b3 + c3 ≥ 3(a 2 + b 2 + c 2 )
b + 2c c + 2a a + 2b

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

a , b, c > 0
Problem 4. Given . Prove that 1 + 1 + 1 ≥9
ab + bc + ca = 1 a (a + b) b (b + c ) c (c + a) 2

Solution

We can transform the above inequality to the 0-degree homogeneous inequality as follows:
c ( a + b ) + ab a ( b + c ) + bc b ( c + a ) + ca 9
+ + ≥
a (a + b) b (b + c ) c (c + a) 2

( ) (
⇔ a+b+c + b + c + a ≥9
b c a a+b b+c c+a 2 )
b( c a ) (
⇔ a + b + b + c + c + a + b + c + a ≥ 15 (1)
a+b b+c c+a 2 )
We have: LHS (1) = a + b + b + c + c + a + b + c + a + 3 a + b + b + c + c + a
4b 4c 4a a+b b+c c+a 4 b c a ( )
≥ 6 ⋅ 6 a + b ⋅ b + c ⋅ c + a ⋅ b ⋅ c ⋅ a + 3 3 ⋅ 3 a ⋅ b ⋅ c + 3 = 15
4b 4c 4a a + b b + c c + a 4 b c a 2
 Diamonds in mathematical inequalities 33

a , b, c > 0
Problem 5. Given . Prove that a
2
+ b
2
+ c
2
≥9
a + b + c =1 (b + c ) (c + a) (a + b) 4

Solution

Lemma: a + b + c ≥ 3 , ∀a , b, c > 0
b+c c+a a+b 2

x 2 + y 2 + z 2 ≥ 1 ( x + y + z ) , ∀x, y , z ∈
2

Application:
We can transform the above inequality to the 0-degree homogeneous inequality as follows:
a (a + b + c) b (a + b + c) c (a + b + c)
2
+ 2
+ 2
≥9
(b + c) (c + a) (a + b) 4

2 2 2
⇔ ( b +a c ) + ( c +b a ) + ( a +c b ) + a + b + c ≥ 9 (1)
b+c c+a a+b 4

2 2
We have: LHS (1) ≥ 1 a + b + c
3 b+c c+a a+b ( ) + a + b + c ≥1 3
b+c c+a a+b 3 2 () +3=9
2 4
(q.e.d)

a , b, c > 0
Problem 6. Given . Prove that ab + bc + ca ≥ 3 (1)
2
a +b +c =3 2 2 c a b

(France Pre-MO 2005)

Solution

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

2 2 2 2 2 2
⇔ a b2 + b c2 + c a2 ≥ a 2 + b 2 + c 2 . Using AM – GM Inequality we have:
c a b

a 2 b 2 + b 2 c 2 ≥ 2 a 2 b 2 ⋅ b 2 c 2 = 2b 2
c2 a2 c2 a2
2 2 2 2 2 2 2 2
+ b c2 + c a2 ≥ 2 b c2 ⋅ c a2 = 2c 2
a b a b

c 2 a 2 + a 2 b 2 ≥ 2 c 2 a 2 ⋅ a 2 b 2 = 2a 2
b2 c2 b2 c2

a 2b 2 + b 2c 2 + c 2 a 2 ≥ a 2 + b 2 + c 2 (q.e.d)
c2 a2 b2
34 Point of incident technique in AM-GM inequality

a , b, c > 0
Problem 7. Given . Prove that a3 + b3 + c3 ≥3
abc = 1 (1 + b ) (1 + c ) (1 + c ) (1 + a ) (1 + a ) (1 + b ) 4

(IMO Shortlist 1998)

Solution
Using AM – GM Inequality we have:

a3 + 1+ b + 1+ c ≥ 3⋅ 3 a3 ⋅ 1 + b ⋅ 1 + c = 3a
(1 + b ) (1 + c ) 8 8 (1 + b ) (1 + c ) 8 8 4

+ b3 + 1+ c + 1+ a ≥ 3⋅ 3 b3 ⋅ 1 + c ⋅ 1 + a = 3b
(1 + c ) (1 + a ) 8 8 (1 + c ) (1 + a ) 8 8 4

c3 + 1+ a + 1+ b ≥ 3⋅ 3 c3 ⋅ 1 + a ⋅ 1 + b = 3c
(1 + a ) (1 + b ) 8 8 (1 + a ) (1 + b ) 8 8 4

a3 b3 c3 3 ⋅ 3 abc 3 3
+ + ≥ a+b+c − 3 ≥ − =
( a + b) ( a + c ) (b + c ) (b + a ) ( c + a ) (c + b) 2 4 2 4 4

a , b, c > 0
Problem 8. Given . Prove that 1 + 1 + 1 ≥ 3 (1)
abc = 1 a 3 (b + c ) b 3 ( c + a ) c 3 ( a + b) 2

(IMO 1995)

Solution
We can transform the above inequality to a stronger homogeneous one as follows:
1 1 1

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

Letting x = 1 , y = 1 , z = 1 for x, y , z > 0 , xyz = 1 .

a b c
2
(2) ⇔ x 2 + y + z 2 ≥ 1 ( x + y + z ) . Using AM – GM Inequality we have:
y+z z+x x+ y 2

x2 + y + z ≥ 2 ⋅ x2 ⋅ y + z = x
y+z 4 y+z 4

y2 y2 z + x
+ + z + x ≥ 2⋅ ⋅ =y
z+x 4 z+x 4

z2 + x + y ≥ 2⋅ z2 ⋅ x + y = z
x+ y 4 x+ y 4

2
x 2 + y + z 2 ≥ 1 ( x + y + z ) ≥ 1 ⋅ 3 ⋅ 3 xyz = 3 (q.e.d)
y+z z+x x+ y 2 2 2
 Diamonds in mathematical inequalities 35

a , b, c > 0
Problem 9. Let . Prove that ab + 5 bc5 + 5 ca5 ≤1
5 5
abc = 1 a + b + ab b + c + bc c + a + ca

(IMO Shortlist 1996)

Solution

Lemma: x 5 + y 5 ≥ x 3 y 2 + x 2 y 3 = x 2 y 2 ( x + y ) , ∀x, y > 0

Application: Using Lemma we have

ab ≤ 2 2 ab = 1 = abc = c
5 5
( )
a + b + ab a b a + b + ab ab ( a + b ) + 1 ab ( a + b ) + abc a + b+c

+ bc ≤ bc = 1 = abc = a
b 5 + c 5 + bc b 2 c 2 ( b + c ) + bc bc ( b + c ) + 1 bc ( b + c ) + abc a + b + c
ca ≤ ca = 1 = abc = b
c 5 + a 5 + ca c 2 a 2 ( c + a ) + ca ca ( c + a ) + 1 ca ( c + a ) + abc a + b + c

ab + bc + ca ≤ a + b + c =1
a 5 + b 5 + ab b 5 + c 5 + bc c 5 + a 5 + ca a + b + c

a , b, c > 0 a 2 (b + c) b 2 (c + a) c 2 (a + b)
Problem 10. Given . Prove that + + ≥ 2 (1)
abc = 1 b b + 2c c c c + 2 a a a a + b b

Solution

a 2 (b + c ) a 2 .2 bc 2a a
≥ = = 2x x=a a >0
b b + 2c c b b + 2c c b b + 2c c y + 2 z

b 2 (c + a) b 2 .2 ca 2b b 2y y =b b >0
+ ≥ = = in which
c c + 2a a c c + 2a a c c + 2a a z + 2 x z=c c >0
c (a + b)
2
c .2 ab 2
2c c
≥ = = 2z xyz = 1
a a + b b a a + b b a a + b b x + 2y

a 2 (b + c ) b 2 (c + a) c 2 (a + b) 2y
S= + + ≥ 2x + + 2z = T
b b + 2c c c c + 2 a a a a + b b y + 2 z z + 2 x x + 2 y

4n + p − 2m
y + 2z = m x=
9
4 p + m − 2n 2 4n + p − 2 m 4 p + m − 2n 4 m + n − 2 p
Letting z + 2x = n y= T= + +
9 9 m n p
x + 2y = p 4m + n − 2 p
z=
9

2 p p m n 2 p p 2
= 4 n +m+ + + + − 6 ≥ 4 ⋅ 3 ⋅ 3 n ⋅ m ⋅ + 3 ⋅ 3 ⋅ m ⋅ n − 6 = (12 + 3 − 6) = 2
9 m p n m n p 9 m p n m n p 9

Equality occurs ⇔ m = n = p ⇔ x = y = z = 1 ⇔ a = b = c = 1
36 Point of incident technique in AM-GM inequality

5. NON – SYMMETRIC POINT OF INCIDENCE IN AM – GM INEQUALITY

The following problems express essence of the term “point of incidence” correctly; means
that we can find any “point of incidence” and build up an inequality that reaches it extremum
at this point. Since these point are not symmetric so the readers must speculate the point of
incidence base on the condition and expression structure given.

a , b, c > 0 3 9 4
Problem 1. Given . Prove that S = a + b + c + + + ≥ 13
a + 2b + 3c ≥ 20 a 2b c

Proof
Predict S = 1 at the point: a = 2, b = 3, c = 4
Applying AM – GM inequality, we have:

a+ 4 ≥2 a⋅ 4 =4
a a
3
4 ( ) a
3
a + 4 ≥ ⋅4=3
4

b+ 9 ≥2 b⋅ 9 =6
b b (2 b + b9 ) ≥ 12 ⋅ 6 = 3
1

c + 16 ≥ 2 c ⋅ 16 = 8
c c (4 c + 16c ) ≥ 14 ⋅ 8 = 2
1

3 1 1 3 9 4
a+ b+ c+ + + ≥8 (1)
4 2 4 a 2b c
1 b 3
We have a + 2b + 3c ≥ 20 a+ + c≥5 (2)
4 2 4
3 9 4
Add (1) and (2) S = a+b+c+ + + ≥ 13
a 2b c
Problem 2. Given a, b, c > 0. Prove that
2c 3
S = 30 a + 3b 2 +
9 (
+ 36 1 + 1 + 1 ≥ 84
ab bc ca )
Proof
Predict S = 84 at the point: a = 1, b = 2, c = 3
Using AM – GM inequality, we have:

b2 2

( )
2 2
2.a + 1 ⋅ + 2⋅ ≥ 5⋅ 5 a2 ⋅ b 2 =5 b2 4
4 ab 4 ab 9 2a + + ≥ 45
4 ab
3 2
b2 c3 6
3b 2 2c 3 36
( )
2
3⋅ + 2⋅
6
+ 6 ⋅ ≥ 11 ⋅ 11 b c3 6 = 11 + + ≥ 11
4 27 bc 4 27 bc 4 27 bc

c3 3 c3 9
3
( )
3
+ 3.a + 3 ⋅ ≥ 7 ⋅ 7 c ⋅ a3 3 =7 4 + 3a + ≥ 28
27 ca 27 ca 27 ca

2c 3 1 1 1
30a + 3b 2 + + 36 + + ≥ 45 + 11 + 28 ≥ 84
9 ab bc ca
 Diamonds in mathematical inequalities 37

a , b, c > 0 1 1 1 8 121
Problem 3. Given . Prove that S = ( a + b + c ) + 2 + + + ≥
ac ≥ 12 ; bc ≥ 8 ab bc ca abc 2

Proof

121
Predict S = at the point: a = 3, b = 2, c = 4
2

Using AM – GM inequality, we have:

a b 6 a b 6 a b 6
+ + ≥ 3⋅ 3 ⋅ ⋅ =3 1⋅ + + ≥3
3 2 ab 3 2 ab 3 2 ab

b c 8 b c 8 b c 8
+ + ≥ 3⋅ 3 ⋅ ⋅ =3 4⋅ + + ≥ 12
2 4 bc 2 4 bc 2 4 bc

c a 12 c a 12 c a 12
+ + ≥ 3⋅ 3 ⋅ ⋅ =3 7⋅ + + ≥ 21
4 3 ca 4 3 ca 4 3 ca

a b c 24 a b c 24 a b c 24
+ + + ≥ 4⋅4 ⋅ ⋅ ⋅ =4 1⋅ + + + ≥4
3 2 4 abc 3 2 4 abc 3 2 4 abc

6 32 84 24 ac ≥ 12 1 1
3(a + b + c) + + + + ≥ 40 . Also therefore ≤ 12; ≤ 8
ab bc ca abc bc ≥ 8 ac bc

1 1
Hence 40 ≤ 3S + 26 ⋅ 1 + 78 ⋅ 1 ≤ 3S + 26 ⋅ + 78 ⋅
bc ca 8 12

363 121
≤ 3S ⇔ ≤ S (q.e.d)
2 2

Problem 4. Let be given a, b, c > 0 satisfying a + b + c = 1 . Prove that

256
S = a4 b + b4 c + c4 a ≤
3125

Proof

WLOG, supposing a = Max {a, b, c} b 4 c ≤ a 3 bc and c 4 a ≤ c 2 a 3 ≤ ca 4 .

3c c
Since ≥ then transform the expression S we have
4 2

c4 a c4 a ca 4 c 2 a 3 a3 c
S = a 4 b + b4 c +
2
+
2
≤ a 4 b + a 3 bc +
2
+
2
= a3b ( a + c ) +
2 (
( a + c ) = a3 ( a + c ) b + c
2 )
( 2) (
S = a 4 b + b 4 c + c 4 a ≤ a 3 ( a + c ) b + c ≤ a 3 ( a + c ) b + 3c
2 )
38 Point of incident technique in AM-GM inequality

5
a a a a+c
+ + + + b + 3c ( )
S = 44
a a a a+c
⋅ ⋅ ⋅
4 4 4 4
b + 3c ≤ 44
2 ( ) 4 4 4
5
4 2

5
a+b+c 44 256 256
= 44. = 5
= S = a 4 b + b4 c + c4 a ≤
5 5 3125 3125

a + b + c = 1; c = 0
4 1
Equality occurs (corresponding to a = Max (a, b, c)) ⇔ a a+c 3c ⇔ a = 5 ; b = 5 ; c = 0
= =b+
4 4 4

In the general case the inequality becomes equality ⇔ (a, b, c) is the permutation 4 , 1 , 0
5 5 ( )
108
Problem 5. Given 0 ≤ a ≤ b ≤ c ≤ 1 . Prove that: a 2 (b − c) + b 2 (c − b) + c 2 (1 − c) ≤
529

Proof

Transforming and using AM – GM Inequality we have

1
a 2 (b − c) + b 2 (c − b) + c 2 (1 − c) ≤ 0 + b.b ( 2c − 2b ) + c 2 (1 − c)
2
3
1 b + b + 2c − 2b 4 23
≤ ⋅ + c 2 (1 − c ) = c 2 ⋅ c + 1 − c = c2 1 − ⋅c
2 3 27 27
2 2 3
54 23 23 23 54 1 108
= ⋅c ⋅c 1− ⋅c ≤ ⋅ =
23 54 54 27 23 3 529

12 18
Equality occurs ⇔ a = 0, b = ,c=
23 23

Problem 6. Let x, y, z, t ∈[0, 1]. Find the minimum value of

S = x 2 y + y 2 z + z 2 t + t 2 x − xy 2 − yz 2 − zt 2 − tx 2

Solution

WLOG suppose x = Max { x, y, z , t} . Then we have

S = y ( x 2 − z 2 + yz − xy ) + t ( z 2 − x 2 + xt − zt ) = y ( x − z ) ( x + z − y ) + t ( z − x ) ( x + z − t )

3
y + ( x − z) + ( x + z − y) 8 8 3 8
≤ y ( x − z)( x + z − y) + 0 ≤ = ⋅ x3 ≤ ⋅1 =
3 27 27 27

8
For x = 1; y = 2 ; z = 1 ; t = 0 , Max S =
3 3 27
 Diamonds in mathematical inequalities 39

Problem 7. Let be given a, b, c ≥ 0 satisfying a + b + c = 3 . Prove that

( a 2 − ab + b2 )( b 2 − bc + c 2 )( c 2 − ca + a 2 ) ≤ 12 (1)
Proof

0 ≤ b 2 − bc + c 2 ≤ b 2
WLOG supposing a ≥ b ≥ c ≥ 0 ( b 2 − bc + c 2 )( c 2 − ca + a 2 ) ≤ a 2 b 2
2 2 2
0 ≤ c − ca + a ≤ a

3
LHS (1) ≤ a 2 b 2 ( a 2 − ab + b 2 ) = 4 ⋅ 3ab ⋅ 3ab ( a 2 − ab + b 2 ) ≤ 4 1 3ab + 3ab + ( a 2 − ab + b 2 )
9 2 2 9 3 2 2 ( )
3 3
( a + b )2 ( a + b + c )2 (a + b + c) 6 6
=4 ≤4 =4⋅ 3
= 4 ⋅ 33 = 4 ⋅ 33 = 12
9 3 9 3 9 3 9 3 9

Equality occurs ⇔ 3ab = a 2 − ab + b 2 , c = 0 ⇔ a = 2, b = 1, c = 0

2

a ≥ 7 ; 5a + 7b ≥ 70
Problem 8. Given . Find the minimum value of S = a 3 + b3 + c3
10a + 14b + 35c ≥ 210

Solution
3
x3 + y 3 + z 3 x+ y+z
Lemma: ≥ ∀x, y , z > 0
3 3

3 3 2
x+ y+z x+ y+z x+ y+z
x3 + + ≥ 3x
3 3 3
3 3 2
Proof: + y 3 + x + y + z +
x+ y+z
≥ 3y
x+ y+z
3 3 3
3 3 2
x+ y+z x+ y+z x+ y+z
z3 + + ≥ 3z
3 3 3

3 2 3
x+ y+z x+ y+z x+ y+z
x3 + y3 + z3 + 6 ≥ 3( x + y + z) ⇔ x3 + y3 + z3 ≥ 3
3 3 3

Application:
3 3 3 3 3 3
3 3 3 a b c a b a
S =a +b +c =8 + + + 117 + + 218
7 5 2 7 5 7
3 3
a b c a b
+ + + 3
7 5 2 7 5 a
≥8 3 + 117 2 + 218 ≥ 8 × 3 + 117 × 2 + 218 = 476
3 2 7

With a = 7, b = 5, c = 2 we have Min S = 476

40 Point of incident technique in AM-GM inequality

6. METHOD OF EQUALIZING COEFFICIENTS:

In five sections above, we can predict the point of incidence of inequalities based on the
conditions given in the assumption and mathematical features in the expressions. However, if
the point of incidence is not that easy to be predicted, it is necessary to find out a method that
can help define the exact point. This is also the content of balancing coefficient technique.

Problem 1. Let x ∈ [0, 1]. Find the maximum value of = 13 x 2 − x 4 + 9 x 2 + x 4

Solution
For α, β > 0 , using AM – GM inequality we have:

α 2 x 2 + (1 − x 2 ) 13 ( α 2 − 1) x 2 + 13
13 x 2 − x 4 = 13 ⋅ α 2 x 2 (1 − x 2 ) ≤ 13 ⋅ =
α α 2 2α
+
β 2 x 2 + (1 + x 2 ) 9 ( β + 1) x + 9
2 2
9 x 2 + x 4 = 9 ⋅ β 2 x 2 (1 + x 2 ) ≤ 9 ⋅ =
β β 2 2β

13 ( α 2 − 1) 9 ( β + 1) 2 13
2
S = 13 x 2 − x 4 + 9 x 2 + x 4 ≤ + x + + 9
2α 2β 2α 2β

α2x2 =1− x2
Equality occurs ⇔ ⇔ ( α 2 + 1) x 2 = ( β 2 − 1) x 2 = 1
2 2 2
β x =1+ x

α 2 + 1 = β2 −1
Choose α, β > 0 such that ⇔ α = 1 ; β = 3 . Then S ≤ 13 + 9 = 16
13 ( α 2 − 1) 9 ( β + 1)
2
2 2 2α 2β
+ =0
2α 2β

2 5
Equality occurs ⇔ ( α 2 + 1) x 2 = 1 ⇔ 5 x 2 = 1 ⇔ x = . Thus Max S = 16
4 5

Problem 2. Let be given a > 0 and x 2 + y 2 + z 2 + 9 xy = a 2 .

16
Find the maximum value of S = xy + yz + zx

Solution
For α ∈ ( 0;1) , using AM – GM inequality we have:

α ( x 2 + y 2 ) ≥ 2α.xy

z2 2 z
2
+ (1 − α ) x + 2 ≥ 2 (1 − α ) x ⋅ 2 ≥ 2 (1 − α ) .xz
2

2 2
(1 − α ) y 2 + z ≥ 2 (1 − α ) y 2 ⋅ z ≥ 2 (1 − α ) . yz
2 2

x 2 + y 2 + z 2 ≥ 2α.xy + 2 (1 − α ) ( xz + yz ) ( )
a 2 ≥ 2α + 9 xy + 2 (1 − α ) ( xz + yz )
16
 Diamonds in mathematical inequalities 41

12 5 − 17
Choose α ∈ ( 0;1) such that 2α + 9 = 2 (1 − α) ⇔ α = .
16 32

Then we have a 2 ≥
3 5−2
( xy + yz + zx ) S = xy + yz + zx ≤ 4a 2 = 4 ( 3 5 + 2 ) a 2
4 3 5−2 41

4 (3 5 + 2) 2
Max S = a
41

4a 49 − 12 5
49 − 12 5 49 − 12 5 2 x= y= ;z = a
x= y= z 90 − 12 5 90 − 12 5
32 32 2
Equality occurs ⇔ ⇔
x 2 + y 2 + z 2 + 9 xy = a 2 x= y= −4a ;z =−
49 − 12 5
a
16 90 − 12 5
90 − 12 5

a,b,c ≥ 0
Problem 3. Given Find the minimum value of S = 2a 3 + 3b 3 + 4c 3
2 2 2
a + 2b + 3c = 1

Solution
Supposing α, β, γ ≥ 0 and using AM – GM inequality, we have:

a 3 + a 3 + α 3 ≥ 3αa 2

+ 3 ( b 3 + b 3 + β 3 ) ≥ 9 βb 2
2 2

2 ( c 3 + c 3 + γ 3 ) ≥ 6γc 2

2a 3 + 3b 3 + 4c 3 + α 3 + 3 β 3 + 2γ 3 ≥ 3α.a 2 + 9 β ⋅ 2b 2 + 2γ ⋅ 3c 2
2 4
a = α, b = β, c = γ
Equality occurs ⇔
a 2 + 2b 2 + 3c 2 = 1

3α = 9 β = 2γ = k ≥ 0 3α = 9 β = 2γ = k > 0
4
Choose α, β, γ such that 4 ⇔ ⇔ 3α = 9 β = 2γ = k = 18
4
α 2 + 2β2 + 3γ 2 = 1 (
1 + 32 + 3 k 2 = 1
9 81 4 ) 407

3 3 3
Then we have: 2a 3 + 3b 3 + 4c 3 + 6 +3 8 +2 9 ≥ 18 ( a 2 + 2b 2 + 3c 2 )
407 2 407 407 407

⇔ 2a 3 + 3b 3 + 4c 3 + 6 ≥ 18 ⇔ 2a 3 + 3b 3 + 4c 3 ≥ 12
407 407 407

For a = 6 , b = 8 , c = 9 , we have Min S = 12

407 407 407 407
42 Point of incident technique in AM-GM inequality

a,b,c ≥ 0
Problem 4. Given . Find the maximum value of S = 4ab + 8bc + 6ca
a+b+c=3

Solution

Assume that S = ma ( b + c ) + nb ( c + a ) + pc ( a + b ) = ( m + n ) ab + ( n + p ) bc + ( p + m) ca

m+n=4 m =1
n+ p =8 ⇔ n=3 S = 4ab + 8bc + 6ca = a ( b + c ) + 3b ( c + a ) + 5c ( a + b )
p+m=6 p=5
= a ( 3 − a ) + 3b ( 3 − b ) + 5c ( 3 − c )
2 2 2
S = 81 −
4 ( a − 23 ) + 3 (b − 23 ) + 5 ( c − 23 )
Take x = a − 3 ; y = b − 3 ; z = c − 3 x+ y+ z≥ a+b+c− 9 = 3
2 2 2 2 2

Then: S = 81 − ( x 2 + 3 y 2 + 5x 2 ) ⇔ x 2 + 3 y 2 + 5x 2 = 81 − S . With α, β, γ > 0 we have

4 4

x 2 + α 2 ≥ 2 x 2 α 2 = 2αx

+ 3 y 2 + 3β 2 ≥ 6 y 2β 2 = 6βy ( 814 − S ) + (α + 3β + 5γ ) ≥ 2 (αx + 3βy + 5γz )

2 2 2

5z 2 + 5γ 2 ≥ 10 z 2 γ 2 = 10γy

Choose α = 3β = 5γ

S ≤ 81 + ( α 2 + 3β 2 + 5γ 2 ) − 2α ( x + y + z ) ≤ 81 + ( α 2 + 3β 2 + 5γ 2 ) − 3α
4 4

Max S = 81 + ( α 2 + 3β 2 + 5γ 2 ) − 3α ⇔ x = α; y = β; z = γ và x + y + z = 3
4 2

x+ y + z =α+β+ γ=α+ α + α = 3 α = 45 ; β = 15 ; γ = 9 . Hence:

3 5 2 46 46 46
2
Max S = 81 + ( α 2 + 3β 2 + 5γ 2 ) − 3α = 81 + 23α − 3α = 432
4 4 15 23

The equality occurs ⇔ a − 3 = α = 45 ; b − 3 = β = 15 ; c − 3 = γ = 9

2 46 2 46 2 46

⇔ a − 3 = − 45 ; b − 3 = − 15 ; c − 3 = − 9 ⇔ a = 12 ; b = 27 ; c = 30
2 46 2 46 2 46 23 23 23

Problem 5. Let a, b, c, m > 0 be satisfying ab + bc + ca = 1 .

Find the minimum value of S = m ( a 2 + b 2 ) + c 2 according to m

 Diamonds in mathematical inequalities 43

Solution

With α ∈ ( 0; m ) , using inequality AM – GM applied to two positive numbers, we have:

2
α a 2 + c ≥ 2 α ac
2 2
2
+
α b 2 + c ≥ 2 α bc
2 2
( m − α ) ( a + b ) ≥ 2 ( m − α ) ab
2 2

m ( a 2 + b 2 ) + c 2 ≥ 2 α ( ac + bc ) + 2 ( m − α ) ab
2

Choose α ∈ ( 0; m ) such that α =m−α ⇔ α = −1 + 1 + 8m . Then we have:

2 2 4
−1 + 1 + 8m ( −1 + 1 + 8m
S = m ( a 2 + b2 ) + c2 ≥ ab + bc + ca ) =
2 2
1 −1 + 1 + 8m −1 + 1 + 8m
Equality occurs ⇔ a = b = , c= . Thus Min S =
4
1 + 8m 4
2 ⋅ 1 + 8m 2

Problem 6. Let a, b, c, m, n > 0 be satisfying ab + bc + ca = 1 .

Find the minimum value of S = ma 2 + nb 2 + c 2 according to m, n

Solution
Supposing x, y , z > 0 such that m − x, n − y ,1 − z > 0 . Using AM – GM inequality we have:

x.a 2 + y.b 2 ≥ 2 xyab

+ ( m − x ) a 2 + z.c 2 ≥ 2 ( m − x ) z ac
( n − y ) b 2 + (1 − z ) c 2 ≥ 2 ( n − y ) (1 − z ) bc

S = ma 2 + nb 2 + c 2 ≥ 2 xy ab + 2 ( m − x ) z ac + 2 ( n − y ) (1 − z ) bc

b2 = x a 2
xa 2 = yb 2 y
Equality occurs ⇔ ( m − x ) a = zc
2 2
⇔ c2 = m − x a2
z
( n − y ) b = (1 − z ) c
2 2
( n − y ) xz = (1 − z ) ( m − x ) y
Choose x, y, z such that xy = ( m − x ) z = ( n − y ) (1 − z ) = k > 0 ( n − y ) xz = (1 − z ) ( m − x ) y = k 3
We have: mn = [ x + ( m − x )] y + ( n − y ) [ z + (1 − z )] = k 2 ( m + n + 1) + 2k 3

Letting ƒ(k) = 2k 3 + k 2 ( m + n + 1) − mn ƒ′(k) = f ′ ( k ) = 6k 2 + 2 ( m + n + 1) k > 0 , ∀k > 0

ƒ(k) is increasing on ( 0; +∞ ) The equation ƒ(k) = 0 has unique positive root k 0 > 0

S = ma 2 + nb 2 + c 2 ≥ 2k ( ab + bc + ca ) = 2k0 Min S = 2k 0
44 Point of incident technique in AM-GM inequality

Problem 7. Let be given a, b, c satisfy a 2 + b 2 + c 2 = 1 . Find the maximum value of

P = ( a − b) ( a − c ) (b − c ) ( a + b + c ) (IMO 2006)

Solution
2 2
We have: 3 ( a 2 + b 2 + c 2 )
2 2
= 2 ( a − b) + 2 ( a − c ) (b − c ) + ( a + b + c )
2 2
≥ 8 ( a − c ) (b − c ) 2 ( a − b) + ( a + b + c ) ≥ 16 2 ( a − c ) ( b − c ) ( a − b ) ( a + b + c ) ≥ 16 2 P

P≤ 9 . Equality occurs ⇔ a = 3 3 + 6 ; b = 6 ; c = 6 − 3 3 . Thus Max P = 9 .

16 2 6 2 6 2 6 2 16 2

Problem 8. (Phan Thanh Viet) Let a1 , a2 , , an ≥ 0 be satisfying a1 + a2 + + an = 1 .

Prove that S = ( a1 + a2 ) ( a1 + a2 + a3 ) ..... ( a1 + a2 + ... + an −1 ) ≥ 4n −1 a1 a2 an

Proof

With x1 , x2 , , xn ≥ 0 and S k = x1 + x 2 + ... + x k , ∀k = 1, n , using AM – GM inequality we have:

x1 x2 xk
a a a a1 Sk a2 Sk ak Sk
a1 + a 2 + + a k = x1 ⋅ 1 + x 2 ⋅ 2 + ... + x k ⋅ k ≥ ( x1 + + xk )
x1 x2 xk x1 x2 xk
2
It follows: S = ( a1 + a 2 ) ( a1 + a 2 + a 3 ) ( a1 + ... + a n −1 ) ( a1 + ... + a n ) ≥ C.a1C1 a 2C 2 a nC n

x1 x 2x x x 2x 2x S S ...S S 2
C1 = + ... + 1 + 1 ; Ck = k + ... + k + k , ∀k = 2, n − 1 ; C n = n ; C = C2 3 C n −1 Cn
S2 S n −1 S n Sk S n−1 S n Sn x1 1 x 2 2 xn n

Choose x1 = n1−1 ; xk = n +11− k ∀k = 2, n so S k = 1n −1 + 1n −1 + n1− 2 + + 1

n +1− k
= n1− k
2 2 2 2 2 2 2

C1 = 1n −1 ( 2 n − 2 + 2 n −3 + ... + 2 + 1) = 1; C k = n +11− k ( 2 n − k + 2 n − k +1 + .... + 2 + 1) = 1, ∀k = 2, n − 1

2 2
( ) (
1+ 2 +....+ n − 2 + 2 n −1 )
C n = 2 ⋅ 1 ⋅ 1 = 1 ; C = 2 1+ 2 +...+( n − 2 ) = 4 n −1 . Thus S ≥ 4n −1 a1 a2 an (q.e.d)
2 2

Equality occurs ⇔ a1 = n1−1 ; ak = n +11− k , ∀k = 2, n

2 2

Problem 9. Letting that x1 , x2 , , xn are n real numbers satisfying x1 + x2 + + xn = 0 and

x1 + x2 + + xn = 1 . Find the maximum value of P = ∏ xi − x j
1≤i ≤ j ≤ n

Solution
Case 1: For n = 2 , the condition becomes x1 + x2 = 0; x1 + x2 = 1

x1 = 1 ; x 2 = − 1 or x1 = − 1 ; x 2 = 1 P = x1 − x 2 = 1
2 2 2 2
 Diamonds in mathematical inequalities 45

x − x1
Case 2: For n = 3 , WLOG supposing x1 ≤ x2 ≤ x3 . We have P = ( x 2 − x1 ) 3 ( x3 − x 2 ) .
2 2
3
x − x1
( x 2 − x1 ) + 3
2
+ ( x3 − x 2 ) x − x1
3

Using AM – GM we have: P ≤ = 3 ≤1⇔P≤ 1

2 3 2 8 4
x1 + x 2 + x 3 = 0
x1 = − 1
2
x1 + x 2 + x 3 = 1
Equality occurs ⇔ ⇔ x2 = 0 . Thus max P = 1
4
x 2 − x1 =
x 3 − x1
= x3 − x 2 x3 = 1
2 2

Case 3: For n = 4 , WLOG supposing x1 ≤ x2 ≤ x3 ≤ x4 , then we can predict Max P can be

obtained when x1 = − x4 ; x2 = − x3 x2 − x1 = x4 − x3 . Letting x3 − x2 = a ( x4 − x3 ) , P reaches
Max when the variables are satisfied with the conditions:
x − x2 x3 − x1 x4 − x2 x4 − x1
x2 − x1 = x4 − x3 = 3 = = = .
a a +1 a +1 a+2

From these, we come to this solution: WLOG supposing x1 ≤ x2 ≤ x3 ≤ x4

P = ( x2 − x1 ) ( x3 − x2 ) ( x4 − x1 ) ( x3 − x2 ) ( x4 − x2 ) ( x4 − x3 )

P ( x3 − x 2 ) ( x 4 − x1 ) ( x3 − x 2 ) ( x 4 − x 2 )
Hence = ( x 2 − x1 ) ( x 4 − x3 )
a ( a + 2 ) ( a + 1)
2 a +1 a+2 a a +1
6
( x3 − x 2 ) ( x 4 − x1 ) ( x3 − x 2 ) ( x 4 − x 2 )
≤ 1 ( x 2 − x1 ) + + + + ( x 4 − x3 )
6 a +1 a+2 a a +1
6
It follows: P ≤ 18
2
( x2 − x1 ) (1+ 1 + 1
a +1 a + 2 ) (
+ 1 + 1 + −1 ( x3 − x2 )
a a +1 )
) (
(
Choose a such that 1 + 1 + 1 = 1 + 1 + −1 ⇔ a = 2 − 1 .
a +1 a + 2 a a +1 )
Now (1 + 1 + 1 ) = ( 1 + 1 + −1) =
3 2
a +1 a + 2 a a +1 2
2 6
( 2 3 2
2 + 1)( 2 − 1) P ≤ 18 P ≤ 16
6

2 2
( − x1 − x2 + x3 + x4 )
2 2
Equality occurs
x1 + x 2 + x 3 + x 4 = 0
2− 2
− x1 − x 2 + x 3 + x 4 = x1 + x 2 + x 3 + x 4 = 1 x4 = − x1 =
4
⇔ ⇔ (1)
x4 − x3 x 3 − x1 x4 − x2 x 4 − x1 2
x3 = − x2 =
( x1 − x 2 ) = ( x 4 − x 3 ) = = = = 4
2 −1 2 2 2 +1

Conclusion: Max P = 18 (occurs when variables are satisfying the condition (1))
2
46 Point of incident technique in AM-GM inequality

Case 4: n = 5 : With such assumption x1 ≤ x2 ≤ x3 ≤ x4 ≤ x5 , referring to the solutions to case 1

and 2, we can predict P reaches Max when x5 = − x1 , x4 = − x2 , x3 = 0

x2 − x1 = x5 − x4 , x3 − x2 = x4 − x3 .

Letting x3 − x2 = a ( x2 − x1 ) , then P reaches Max when variables are satisfying the condition:

x2 − x1 x4 − x3 x3 − x2 x3 − x1 x5 − x3 x4 − x2 x5 − x2 x4 − x1 x5 − x1 x5 − x4
= = = = = = = = =
1 a a a +1 a +1 2a 2a + 1 2a + 1 2a + 2 1
From such analysis, the solution to the problem in which n = 5 will be as follows:

WLOG supposing x1 ≤ x2 ≤ x3 ≤ x4 ≤ x5 . Now we have:

P = ( x2 − x1 ) ( x3 − x1 ) ( x4 − x1 ) ( x5 − x1 )( x3 − x2 ) ( x4 − x2 ) ( x5 − x2 )( x5 − x2 )( x5 − x4 )

Consider the expression: Q = P . Transform Q in the form:

3 2
4a a + 1) ( 2a + 1)
(
2

x 2 − x1 x 3 − x1 x 4 − x1 x 5 − x1 x 3 − x 2 x 4 − x 2 x 5 − x 2 x 4 − x 3 x 5 − x 3 x 5 − x 4
Q= ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅
1 a + 1 2a + 1 2 a + 2 a 2a 2a + 1 a a +1 1
Using AM – GM applied to 10 non-negative numbers, we have:
x − x1 x 3 − x1 x 4 − x1 x 5 − x1 x 3 − x 2
Q ≤ 110 2 + + + + +
10 1 a +1 2a + 1 2a + 2 a
10
x − x 2 x5 − x 2 x 4 − x3 x5 − x3 x5 − x 4
+ 4 + + + +
2a 2a + 1 a a +1 1
10
It follows: Q ≤ 110
10
3 + 1 +1
2 ( a + 1) 2 a + 1
( − x1 + x5 ) + ( −1 + 3 + 1
2a 2a + 1 ) ( − x2 + x4 ) (2)

Choose a > 0 such that 3

2 ( a + 1) 2a + 1 (
+ 1 + 1 = −1 + 3 + 1 = q ⇔ a = 1 , q = 5
2a 2a + 1 2 2 )
10
It follows Q = P . Now: Q ≤ 110 5 ( − x1 − x 2 + x 4 + x 5 ) = 110 ⇔ P ≤ 120 27 = 27
27 4 10 2 2 2 4 222
Equality occurs ⇔
x3 = 0
x1 + x2 + x3 + x4 + x5 = 0
− x1 − x2 + x3 + x4 + x5 = x1 + x2 + x3 + x4 + x5 = 1
x3 − x1 x4 − x1 x5 − x1 x3 − x2 x4 − x2 x5 − x2 x4 − x3 x5 − x3 x5 − x4
( x2 − x1 ) = 32
=
2
=
3
=
12
=
1
=
2
=
12
=
32
=
1

⇔ x1 = − x5 = − 3 ; x2 = − x4 = − 1 ; x3 = 0 (3)
8 8
Conclusion: Max P = 27 (occurs when variables are satisfying the condition (3))
222
Remarks. In general cases ( n ≥ 6 ) the solution of the problem is still an open question
 Diamonds in mathematical inequalities 47

7. APPLYING AM – GM TO INEQUALITY OF DIFFERENT DEGREE

The un-homogeneous inequalities considering in positive real set:

Problem 1. (Tran Phuong) Let be given a, b, c > 0. Prove that
bc ca ab a7 b7 c7 1
2
+ 2
+ 2
+ abc ≤ 2 2
+ 2 2
+ 2 2
+ 2 2 2
a b c b c c a a b a b c
Proof
Transfer and using AM – GM Inequality we have

bc 3 b 7 c7 1 1 b7 c7 1
2
= 2 2
⋅ 2 2
⋅ 2 2 2
≤ 2 2
+ 2 2
+ 2 2 2
a a c a b a b c 3 a c a b a b c
ca 3 c 7 a7 1 1 c7 a7 1
2
= 2 2
⋅ 2 2
⋅ 2 2 2
≤ 2 2
+ 2 2
+ 2 2 2
b b a b c a b c 3 b a b c a b c
+
ab 3 a 7 b7 1 1 a7 b7 1
2
= 2 2
⋅ 2 2
⋅ 2 2 2
≤ 2 2
+ 2 2
+ 2 2 2
c c b c a a b c 3 c b c a a b c
a7 b7 c7 1 a7 b7 c7
abc = 3 ⋅ ⋅ ≤ + +
c 2b 2 c 2 a 2 a 2b 2 3 c 2b 2 c 2 a 2 a 2b 2

bc ca ab a7 b7 c7 1
2
+ 2
+ 2
+ abc ≤ 2 2
+ 2 2
+ 2 2
+ 2 2 2
a b c b c c a a b a b c
Problem 2. (Tran Phuong) Let be given a, b, c > 0. Prove that
a 9 + b 9 + c 9 + 2 ≥ a 5 + b 5 + c 5 + 2 (1)
bc ca ab abc
Proof
9 9 9
Using AM – GM Inequality we have: a + abc ≥ 2a 5 ; b + abc ≥ 2b 5 ; c + abc ≥ 2c 5
bc ca ab
a 9 + b 9 + c 9 ≥ 2 ( a 5 + b 5 + c 5 ) − 3abc ≥ a 5 + b 5 + c 5 + 3 ⋅ 3 a 5 b 5 c 5 − 3abc
bc ca ab
Therefore, to prove inequality (1), we have to prove:

3 ⋅ 3 a 5 b 5 c 5 − 3 abc + 2 ≥ 2 ⇔ 3t 5 − 3t 3 + 23 ≥ 2 (for t = 3 abc > 0 )

abc t
( t − 1) 2 ( 3t 6 + 6t 5 + 6t 4 + 6t 3 + 6t 2 + 4t + 2 )
⇔ 3
≥ 0 (is always true) (q.e.d.)
t
Equality occurs ⇔ a = b = c = 1
Problem 3. (Tran Phuong) Let be given a, b, c > 0. Prove that

a 9 + b 9 + c 9 + 3 ≥ a 4 + b 4 + c 4 + 3 (1)
bc ca ab abc

Proof
48 Point of incident technique in AM-GM inequality

Using AM – GM Inequality we have:

a 9 + abc + a 2 ≥ 3a 4 , b 9 + abc + b 2 ≥ 3b 4 , c 9 + abc + c 2 ≥ 3c 4

bc ca ab

a 9 + b 9 + c 9 ≥ 3 ( a 4 + b 4 + c 4 ) − ( a 2 + b 2 + c 2 ) − 3abc (2)
bc ca ab

Using again AM – GM inequality, we have:

1 (1 + a 4 ) ≥ a 2 ; 1 (1 + b 4 ) ≥ b 2 ; 1 (1 + c 4 ) ≥ c 2 1 (a 4 + b4 + c 4 ) + 3 ≥ a 2 + b2 + c2
2 2 2 2 2

From (2) a 9 + b 9 + c 9 ≥ 5 ( a 4 + b 4 + c 4 ) − 3abc − 3 ≥ a 4 + b 4 + c 4 + 9 ⋅ 3 a 4 b 4 c 4 − 3abc − 3

bc ca ab 2 2 2 2

Therefore, to prove inequality (1), we only have to prove:

9 ⋅ 3 a 4 b 4 c 4 − 3abc − 3 + 3 ≥ 3 ⇔ 9 ⋅ t 4 − 3t 3 + 3 ≥ 9 (for t = 3 abc > 0 )

2 2 abc 2 t3 2

⇔ 3 ( t − 1) ( t + 1) ( 3t 4 + t 3 + 4t 2 + 2t + 2 ) ≥ 0 (is always true)

2
(q.e.d.)
2

Equality occurs ⇔ a = b = c = 1

Problem 4. (Tran Nam Dung) Let be given a, b, c ≥ 0. Prove that

2 ( a 2 + b 2 + c 2 ) + abc + 8 ≥ 5 ( a + b + c ) (1)

Solution

Lemma: (Schur inequality)

x 3 + y 3 + z 3 + 3 xyz ≥ xy ( x + y ) + xy ( y + z ) + zx ( z + x ) , ∀x, y, z ≥ 0 (*)

Proof: WLOG supposing x ≥ y ≥ z ≥ 0 . We have:

2 2
LHS (*) – RHS (*) = x ( x − y ) + z ( y − z ) + ( z + x − y )( x − y )( y − z ) ≥ 0

Application: Using AM – GM inequality and Schur inequality we have:

6.[LHS (1) – RHS (1)] = 12 ( a 2 + b 2 + c 2 ) + 6abc + 48 − 30 ( a + b + c )

= 12 ( a 2 + b 2 + c 2 ) + 3 ( 2abc + 1) + 45 − 5 ⋅ 2 ⋅ 3 ( a + b + c )

≥ 12 ( a 2 + b 2 + c 2 ) + 9 ⋅ 3 ( abc ) + 45 − 5 ( a + b + c ) + 9
2 2

= 9abc + 3 ( a 2 + b 2 + c 2 ) − 6 ( ab + bc + ca ) + 2 ( a − b ) + ( b − c ) + ( c − a )
2 2 2
3
abc

≥ 9abc + 3 ( a 2 + b 2 + c 2 ) − 6 ( ab + bc + ca ) ≥ 27 abc + 3 ( a + b + c ) − 12 ( ab + bc + ca )
2
3
abc a + b + c
 Diamonds in mathematical inequalities 49

= 3 3
9abc + ( a + b + c ) − 4 ( ab + bc + ca ) ( a + b + c )
a+b+c

= 3 [ a 3 + b 3 + c 3 + 3abc − ab ( a + b ) − bc ( b + c ) − ca ( c + a )] ≥ 0 (q.e.d.)
a+b+c

Equality occurs ⇔ a = b = c = 1

Problem 5. (Darij Grinberg) Let be given a, b, c > 0. Prove that

a 2 + b 2 + c 2 + 2abc + 1 ≥ 2 ( ab + bc + ca )

Proof
Using AM – GM Inequality and Schur inequality we have:
2 2 2
a 2 + b 2 + c 2 + 2abc + 1 − 2 ( ab + bc + ca ) ≥ a 2 + b 2 + c 2 + 3a 3 b 3 c 3 − 2 ( ab + bc + ca )
2 2
( 2 2
) 2 2
( 2 2
)
≥ a 3 b 3 a 3 + b 3 + b 3 c 3 b 3 + c 3 + c 3 a 3 c 3 + a 3 − 2 ( ab + bc + ca )
2 2
( 2 2
)
2 2 2

=a
2 2
3b 3 (a 1
3 −
1
b3 ) +b
2 2
3c 3 (b 1
3 −
1
c3 ) +c
2 2
3a3 (c 1
3 −a
1
3 ) ≥0

Equality occurs ⇔ a = b = c = 1

Problem 6. (APMO 2004) Let be given a, b, c > 0. Prove that

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

Proof
Using AM – GM Inequality we have:

LHS (1) – RHS (1) = ( a 2 + 2 )( b 2 + 2 )( c 2 + 2 ) − 9 ( ab + bc + ca )

= 4 ( a 2 + b 2 + c 2 ) + 2 ( a 2 b 2 + 1) + ( b 2 c 2 + 1) + ( c 2 a 2 + 1) + ( a 2 b 2 c 2 + 1) + 1 − 9 ( ab + bc + ca )

≥ 4 ( a 2 + b 2 + c 2 ) + 4 ( ab + bc + ca ) + 2abc + 1 − 9 ( ab + bc + ca )

≥ a 2 + b 2 + c 2 + 2abc + 1 − 2 ( ab + bc + ca )

Using the results of problem 5 we have (q.e.d.). Equality occurs ⇔ a = b = c = 1

Problem 7. Let be given a, b, c, d > 0. Prove that

( 1a + b1 + 1c + d1 )( a 1+ b + b +1 c + c +1 d + d 1+ a ) ≥ 16 Max {1 + abcd
1 ;
ac + bd }
1 (1)

Solution

Using AM – GM Inequality we have:

(
LHS (1) = 1 + 1 +
ab cd
a+b + c+d
)
ab ( c + d ) cd ( a + b )
+ a+b + a+b + c+d + c+d
ab ( d + a ) ab ( b + c ) cd ( b + c ) cd ( d + a )
50 Point of incident technique in AM-GM inequality

≥ 4 + a + b + a + b + c + d + c + d . Similarly we have:
abcd ab ( d + a ) ab ( b + c ) cd ( b + c ) cd ( d + a )

LHS (1) ≥ 4 + b + c + b + c + a + d + a + d . It follows:

abcd bc ( a + b ) bc ( c + d ) ad ( a + b ) ad ( c + d )

2 ⋅ LHS (1) ≥ 8 + a+b + a+d + a+b + b+c +

abcd ab ( d + a ) ad ( a + b ) ab ( b + c ) bc ( a + b )

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

cd ( b + c ) bc ( c + d ) cd ( d + a ) ad ( c + d )

≥ 8 + 2 + 2 + 2 + 2 = 8 + 2 1+1 + 2 1+1
abcd a bd b ac c bd d ac abcd bd a c ac b d
( ) ( )
≥ 8 + 4 + 4 = 16 LHS (1) ≥ 8
abcd abcd abcd abcd abcd
On the other hand, using AM – GM Inequality we have:

1 + abcd ≥ abcd ; ac + bd ≥ abcd Min {1 + abcd ; ac + bd }

abcd ≤
2 2 2

LHS (1) ≥ 16
Min {1 + abcd ; ac + bd }
= 16 Max 1 ; {
1
1 + abcd ac + bd } (q.e.d.)
Problem 8. (Le Trung Kien)

Prove that a 3 + b 3 + c 3 + 4 ( a + b + c ) + 9abc ≥ 8 ( ab + bc + ca ) , ∀a, b, c ≥ 0 (1)

Solution

Lemma: a 4 + b 4 + c 4 + abc ( a + b + c ) ≥ ab ( a 2 + b 2 ) + bc ( b 2 + c 2 ) + ca ( c 2 + a 2 ) (1)

Proof: WLOG supposing a ≥ b ≥ c . We have:

(1) ⇔ ( b 2 + c 2 − a 2 ) ( b − c ) + ( c 2 + a 2 − b 2 ) ( c − a ) + ( a 2 + b 2 − c 2 ) ( a − b ) ≥ 0
2 2 2

⇔ c 2 ( b − c ) + a 2 ( a − b ) + ( c 2 + a 2 − b 2 ) ( a − b ) ( b − c ) ≥ 0 (is always true)

2 2

Application: Using AM – GM inequality we have:

2
4 ( ab + bc + ca )
4 (a + b + c) + ≥ 8 ( ab + bc + ca )
a+b+c
2
4 ( ab + bc + ca )
So it suffices to prove that: a 3 + b 3 + c 3 + 9abc ≥
a+b+c

⇔ a 4 + b 4 + c 4 + abc ( a + b + c ) + ab ( a 2 + b 2 ) + bc ( b 2 + c 2 ) + ca ( c 2 + a 2 ) ≥ 4 ( a 2 b 2 + b 2 c 2 + c 2 a 2 ) (*)
Using lemma we have:

LHS (*) ≥ 2 ab ( a 2 + b 2 ) + bc ( b 2 + c 2 ) + ca ( c 2 + a 2 ) ≥ 4 ( a 2 b 2 + b 2 c 2 + c 2 a 2 ) (q.e.d)

Equality occurs ⇔ a = b = c = 1 or ( a, b, c ) ~ ( 2; 2; 0 )
 Diamonds in mathematical inequalities 51

8. SPECIALIZATION IN INEQUALITY OF DIFFERENT DEGREE

a , b, c > 0
Problem 1. Given . Prove that 13 + 13 + 13 ≥ 3 (1)
a + b + c = 3abc a b c

Proof

a + b + c = 3abc 1 + 1 + 1 = 3 . Using AM – GM Inequality we have:

ab bc ca

2 13 + 13 + 13 + 3 = 13 + 13 + 1 + 13 + 13 + 1 + 13 + 13 + 1 ≥ 3 1 + 1 + 1 = 9
a b c a b b c c a ab bc ca ( ) (q.e.d)

a , b, c > 0
6 6 6
Problem 2. Given . Prove that a 3 + b 3 + c 3 ≥ 3 (1)
a b +b c +c a =3 b c a
c a b

Proof
Using AM – GM Inequality we have:
a6 + b6 + 4 + b6 + c6 + 4 + c6 + a6 + 4 ≥ 6 a b + b c + c a
b3 c3 c3 a3 a3 b3 c a b
6 6 6 6 6 6
⇔ 2 a 3 + b 3 + c 3 + 12 ≥ 18 ⇔ a 3 + b 3 + c 3 ≥ 3 (q.e.d)
b c a b c a

a, b, c, d > 0
Problem 3. Given . Prove that a 3 + b3 + c
3
+ d
3
≥ 1 (1)
ab + bc + cd + da = 1 b+c+d c+d +a d +a+b a+b+c 3

(IMO Shortlist 1990)

Proof
Using AM – GM inequality we have:

36a 3 + 2 ( b + c + d ) + 6a + 3 ≥ 4 ⋅ 4 36a 3 ⋅ 2 ( b + c + d ) ⋅ 6a ⋅ 3 = 24a

b+c+d b+c+d

36b 3 + 2 ( c + d + a ) + 6b + 3 ≥ 4 ⋅ 4 36b 3 ⋅ 2 ( c + d + a ) ⋅ 6b ⋅ 3 = 24b

c+d +a c+d +a
+
36c 3 + 2 ( d + a + b ) + 6c + 3 ≥ 4 ⋅ 4 36c 3 ⋅ 2 ( d + a + b ) ⋅ 6c ⋅ 3 = 24c
d +a+b d +a+b

36d 3 + 2 ( a + b + c ) + 6d + 3 ≥ 4 ⋅ 4 36d 3 ⋅ 2 ( a + b + c ) ⋅ 6d ⋅ 3 = 24d

a+b+c a+b+c

a3 + b3 + c3 + d3 ≥ a+b+c+d −1
b+c+d c+d +a d +a+b a+b+c 3 3
2
On the other hand, ( a + b + c + d ) ≥ 4 ( ab + bc + cd + da ) = 4 a+b+c+d ≥2

LHS (1) ≥ a + b + c + d − 1 ≥ 2 − 1 = 1 (q.e.d)

3 3 3 3 3
52 Point of incident technique in AM-GM inequality

9. BEST SOLUTIONS TO FOUR TRIGONOMETRIC INEQUALITIES

Let ABC be a triangle. Prove that

A B C 3
T1 = sin + sin + sin ≤ ; T2 = cos A + cos B + cos C ≤ 3
2 2 2 2 2
3 3
T3 = sin A + sin B + sin C ≤ ; T4 = + + ≤
2
Proof
A B C A B A B A B
T1 = sin + sin + sin = sin + sin .1 + cos cos − sin sin
2 2 2 2 2 2 2 2 2
2
1 A B 1 A B A B 3
≤ sin + sin + 12 + cos 2 + cos 2 − sin sin =
2 2 2 2 2 2 2 2 2
T2 = cos A + cos B + cos C = ( cos A + cos B ) .1 + sin A sin B − cos A cos B
1 1 3
≤ (cos A + cos B ) 2 + 12 + ( sin 2 A + sin 2 B ) − cos A cos B ≤
2 2 2
2 3 3 sin A sin B
T3 = sin A ⋅ + sin B ⋅ + 3 ⋅ cos B + ⋅ cos A
3 2 2 3 3

≤
1
3
(sin 2
4)(
A + 3 + sin 2 B + 3
4 ) + 23 sin 2 A + cos 2 B + sin 2 B + cos 2 A
3 3
=
3 3
2

2 A 3 B 3 cos A B
B cos 2 A
T4 = cos ⋅ + cos ⋅ + 3 2 ⋅ sin + ⋅ sin
3 2 2 2 2 3 2 3 2

1 A 3 B 3 3 cos 2 A cos 2 B 3 3
≤ cos 2
+ + cos 2 + + 2 + sin 2 B + 2 + sin 2 A =
3 2 4 2 4 2 3 2 3 2 2
Comment: In my colleagues’ opinions, the common solutions to the four above problems are
the most unprecedented and the shortest among what have ever demonstrated in the world. In
all other publications, these inequalities are proved based on graphs of Jensen Inequality but
the above solutions originally apply a simple inequality 2xy ≤ x 2 + y 2 and the concept "point
of incidence", which will be referred to in detail in the book. These solutions were published
in the other books in Viet Nam, also written by the author in 2000.
Trivial classical method:
x+ y x− y x+ y
sin x + sin y = 2 sin cos ≤ 2 sin , ∀x, y ∈ ( 0, π )
2 2 2
x+ y x− y z+t z −t x+ y z+t
sin x + sin y + sin z + sin t = 2 sin cos + 2 sin cos ≤ 2 sin + 2 sin
2 2 2 2 2 2
x+ y+ z+t x+ y− z −t x+ y+ z+t
= 4 sin cos ≤ 4 sin , ∀x, y, z , t ∈ ( 0; π )
4 4 4
3 3
Take x = A, y = B, z = C , t = A + B + C sin A + sin B + sin C ≤ 3sin A + B + C = 3sin π =
3 3 3 2
 Diamonds in mathematical inequalities 53

10. SELECTIVE PROBLEMS IN USING POINT OF INCIDENCE FOR AM – GM

Problem 1. (Tran Phuong) Let be given ∆ABC with the lengths of the sides a, b, c.
2 2 2
3a 3b 3c 3 3
Prove that: 3 + 3 + 3 ≥ ⋅ 45 (1)
3b + 3c − a 3c + 3a − b 3a + 3b − c 5

Proof

3a 1 3b + 3c − a 4 a+b+c
= x= x+ =
3b + 3c − a x 3a 3 a
3b 1 3c + 3a − b 4 a+b+c
Let = y= y+ =
3c + 3a − b y 3b 3 b
3c 1 3a + 3b − c 4 a+b+c
= x= z+ =
3a + 3b − c z 3c 3 c
−1 −1 −1
1 1 1 a+b+c 4 4 4
+ + = =1 ⇔ x + + y+ + z+ =1
x+ 4 y+4 z+4 a+b+c 3 3 3
3 3 3
1 1 1 3 3
(1) ⇔ + + ≥ ⋅ 45 .
3
x 2 3
y 2 3
z 2 5

Using AM − GM Inequality for 9 terms we have:

9

( )
9 9
4 5 x+ 4 9 x+ 4 5 x+ 4
5 3 5 3 5 3
x5 ⋅ ≤ = ⋅ x5 ≤ ⋅
3 9 3 3 3 3
9 9

( )
9
4 5 y+ 4 9 y+ 4 5
5 y+ 4
5 3 5 3 ⇔ 3
y5 ⋅ ≤ = ⋅ y5 ≤ ⋅
3 9 3 3 3 3
9 9

( )
9
4 5 z+4 9 z+4 5
5 z+4
5 3 5 3 z5 ≤ ⋅ 3
z5 ⋅ ≤ = ⋅
3 9 3 3 3 3

−6
9 −9
x+ 4
5
4 5 4 5
5 x+ 3 1 3 x+ 3
1 9 3
≥3
x≤ ⋅ ≥ ⋅ 3 2 25 3
3 3 x 5 3 x
9 −9 −6

y+ 4
5
4 5 4 5
⇔ 5 y+3 ⇔ 1 3 y+3 ⇔ 1 9 3
y≤ ⋅ ≥ ⋅ ≥3
3 3 y 5 3 3
y 2 25 3
9 −9 −6
4 5 4 5
z+4
5
5 z+ 3 1 3 z+ 3 1 9 3
z≤ ⋅ ≥ ⋅ ≥3
3 3 z 5 3 3 2 25 3
z
−1 −1 −1
Letting m = x + 4
3 ( ) ;n= y+ 4
3 ( ) ; p= z+ 4
3 ( ) m + n + p =1
54 Point of incident technique in AM-GM inequality

Using AM − GM Inequality for 6 terms we have:

6 6 6 6 6 6
5. ( 3m ) 5 + 1 = ( 3m ) 5 + ( 3m ) 5 + ( 3m ) 5 + ( 3m ) 5 + ( 3m ) 5 + 1 ≥ 18m
6 6 6 6 6 6
+ 5. ( 3n ) 5 + 1 = ( 3n ) 5 + ( 3n ) 5 + ( 3n ) 5 + ( 3n ) 5 + ( 3n ) 5 + 1 ≥ 18n

6 6 6 6 6 6
5. ( 3 p ) 5 + 1 = ( 3 p ) 5 + ( 3 p ) 5 + ( 3 p ) 5 + ( 3 p ) 5 + ( 3 p ) 5 + 1 ≥ 18 p

1 1 1 9 6 6 6
9 18 ( m + n + p ) − 3 3
+ + ≥3 ( 3m ) 5 + ( 3n ) 5 + ( 3 p ) 5 ≥3 ⋅ = 3 45
3
x2 3
y2 3
z2 25 25 5 5

Equality occurs ⇔ a = b = c > 0

Problem 2. (Tran Phuong) Let be given a, b, c > 0. Prove that
a 3 + b 3 4 b 3 + c 3 4 c 3 + a 3 12 a2 + b2 3 b2 + c2 3 c2 + a2
4 + + ≥ 2 3 + +
c3 a3 b3 c2 a2 b2

Proof

a3 + b3 a2 + b2
Lemma: 3 ≥ (It is for you to prove it)
2 2
Application: Using AM – GM Inequality and the lemma we have
2
a3 + b3 a3 + b3 a3 + b3 3 1 a3 + b3 3 a2 + b2
4 + 4 + ... + 4 + 1 ≥ 9 ⋅ ≥9⋅ 3
2c 3 2c 3 2c 3 c2 2 2c 2
8 terms

2
b3 + c3 4 b3 + c3 b3 + c3 3 1 b3 + c3 3 b2 + c2
4 + + ... + 4 + 1 ≥ 9 ⋅ ≥9⋅ 3
2a 3 2a 3 2a 3 a2 2 2a 2
8 terms

2
c3 + a3 4 c3 + a3 c3 + a3 3 1 c 3 + a3 3 c2 + a2
4 + + ... + 4 + 1 ≥ 9 ⋅ ≥9⋅ 3
2b 3 2b 3 2b 3 b2 2 2b 2
8 terms

a3 + b3 4 b3 + c3 4 c3 + a3 a2 + b2 3 b2 + c2 3 c2 + a2
8 4 + + +3≥9 3 + +
2c 3 2a 3 2b 3 2c 2 2a 2 2b 2

a2 + b2 3 b2 + c2 3 c2 + a2 a2 + b2 3 b2 + c2 3 c2 + a2
=8 3 + + + 3 + +
2c 2 2a 2 2b 2 2c 2 2a 2 2b 2

a2 + b2 3 b2 + c2 3 c2 + a2 a2 + b2 b2 + c2 c2 + a2
≥8 3 + + + 3. 9 ⋅ ⋅
2c 2 2a 2 2b 2 2c 2 2a 2 2b 2

a2 + b2 3 b2 + c2 3 c2 + a2 2ab 2bc 2ca

≥8 3 + + + 3. 9 ⋅ ⋅
2c 2 2a 2 2b 2 2c 2 2a 2 2b 2
 Diamonds in mathematical inequalities 55

a2 + b2 3 b2 + c2 3 c2 + a2
=8 3 + + + 3 . It follows
2c 2 2a 2 2b 2

a3 + b3 4 b3 + c3 4 c3 + a3 3 a 2 + b2 3 b2 + c 2 3 c 2 + a 2
4 + + ≥ + + (q.e.d.)
2c 3 2a 3 2b 3 2c 2 2a 2 2b 2

Equality occurs ⇔ a = b = c > 0

Problem 3. (Vo Quoc Ba Can) Let be given a, b, c > 0. Prove that

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

Proof
Using AM − GM Inequality we have:

a (b 2 + c 2 ) + b ( c 2 + a 2 ) + c ( a 2 + b 2 ) a (b 2 + c 2 ) ( 2 2)
3 abc b + c
= + b + c ≥ 3 ⋅
a 2 + bc a 2 + bc a 2 + bc

3 a 2 + bc ≥ 3 ( a 2 + bc ) ⋅ 3 abc
b 2 + c 2 a (b 2 + c 2 ) + b (c 2 + a 2 ) + c ( a 2 + b 2 )

a 2 + bc ≥ 3 ( a + b + c + ab + bc + ca ) ⋅ 3 abc (2)
2 2 2
LHS (1) = 3
cyc b 2 + c 2 a (b 2 + c 2 ) + b ( c 2 + a 2 ) + c ( a 2 + b 2 )

Using Schur Inequality we have:

( a + b + c ) ( a 2 + b 2 + c 2 + ab + bc + ca ) − 3 a ( b 2 + c 2 ) + b ( c 2 + a 2 ) + c ( a 2 + b 2 )

= a 3 + b 3 + c 3 + 3abc − ab ( a + b ) − bc ( b + c ) − ca ( c + a ) ≥ 0

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

9 ⋅ 3 abc
From (2) and (3) follow LHS (1) ≥ (q.e.d.)
a+b+c
Equality occurs ⇔ a = b = c ≥ 0

Problem 4. Let be given a, b, c > 0. Prove that

a (b + c ) b (c + a) c (a + b) (
2
+ 2
+ ≤ a + b + c) 1 + 1 + 1 (1)
a + bc b + ca c 2 + ab a b c

Proof
2
a (b + c )
(1) ⇔ ≤( a + b + c) 1 + 1 + 1
cyc a 2 + bc a b c

a (b + c ) ab ( a + c ) ( b + c ) b+c
⇔ +2 ≤3+
cyc a 2 + bc cyc ( a 2 + bc )( b 2 + ca ) cyc bc
56 Point of incident technique in AM-GM inequality

a (b + c ) ab ( a + c ) ( b + c ) b + c − 3 ≤ 0 (2)
⇔ +2 −
cyc a 2 + bc cyc ( a 2 + bc )( b 2 + ca ) cyc bc

a (b + c) a (b + c) b+c
Using AM − GM Inequality we have: ≤ =
cyc a 2 + bc cyc 2 a bc 2
cyc 2 bc

On the other hand, ( a 2 + bc )( b 2 + ca ) − ab ( a + c ) ( b + c ) = c ( a − b ) ( a + b ) ≥ 0

2

ab ( a + c ) ( b + c ) ab ( a + c ) ( b + c )
≤1 ≤3
( a 2 + bc )( b 2 + ca ) cyc ( a 2 + bc )( b 2 + ca )
2
b+c +6− b+c −3= ( b − c)
LHS ( 2 ) ≤ 1− b + c =− ≤0
cyc 2 bc cyc bc cyc 2 bc cyc 2 bc

(2) is true (q.e.d.). Equality occurs ⇔ a = b = c > 0

Problem 5. Let be given a, b, c, d > 0. Prove that

1 + 1 + 1 + 1 + 1 + 1 ≥ 243 (1)
a 3 + b3 a 3 + c 3 a 3 + d 3 b3 + c 3 b3 + d 3 c 3 + d 3 2 (a + b + c + d )3

Proof
3 3 3
WLOG supposing a ≥ b ≥ c ≥ d ≥ 0 a3 + b3 ≤ a + d
3 ( ) ( )
+ b + d ; a3 + d 3 ≤ a + d
3 3 ( )
1 ≥ 1 1 ≥ 1
a + b3
3 3 3
a + d3
3 3

( a + d3 ) + (b + d3 ) a+ d
3 ( )
1 ≥ 1 1 ≥ 1
a3 + c3 3 3
b3 + d 3 3

( a+ d
3 ) ( + c+ d
3 ) ;
b+ d
3 ( )
1 ≥ 1 1 ≥ 1
a + b3
3 3 3
c3 + d 3 3

(b + d3 ) ( + c+ d
3 ) c+ d
3 ( )
LHS (1) ≥ 1 + 1 for x = a + d , y = b + d , z = c + d
cyc x3 + y3 cyc x3 3 3 3

We need to prove 1 + 1 ≥ 243 ⇔ 2 + 1 + 1 ≥ 243

cyc x3 + y3 cyc x3 2 ( x + y + z)3 cyc x3 + y3 x3 y3 ( x + y + z)3

Using AM – GM Inequality we have 2 + 13 + 13 ≥ 3 ⋅ 3 3 3 23

x y (x + y3 )
3
3
x +y x y

= 3⋅ 3 2 ≥ 3⋅ 2 = 24
( xy ) 3
( x − xy + y 2 ) ( x + y ) 3
2 2
3 xy + x − xy + y 2
4
( x + y)3
(x + y)
4
 Diamonds in mathematical inequalities 57

2 + 1 + 1 ≥ 24 1 ≥ 24 ⋅ 3
cyc x3 + y3 x3 y3 cyc ( x + y )
3
( x + y )( y + z ) ( z + x )

≥ 72 = 72. 27 = 243 (q.e.d.)

3 3
( x + y) + ( y + z ) + ( z + x) 2(x + y + z) ( x + y + z )3
3

Equality occurs ⇔ ( a, b, c, d ) is a permutation of (1; 1; 1; 0)

Problem 6. Let be given a, b, c > 0 satisfying the condition a + b + c = 1

Find the maximum value of S = a + b + abc

a + bc b + ca c + ab

Solution

S= a + b + abc = 1 + 1 + ab / c
a + bc b + ca c + ab 1 + bc 1 + ca 1 + ab
a b c
bc A ca B
Taking = tan 2 ; = tan 2 for 0 < A, B < π
a 2 b 2

Then 1 = a + b + c = ab ⋅ ca + bc ⋅ ab + ca ⋅ bc
c b a c b a

A B
ab 1 − tan 2 ⋅ tan 2 A, B, C > 0
It follows
c
=
A
tan + tan B
= cot A + B = tan
2
C
2 ( ) for
A+ B+C =π
2 2

1 1 tan C A B sin C 1
S= + + 2 = cos 2 + cos 2 + = 1 + ( cos A + cos B + sin C )
A B 1 + tan 2 C 2 2 2 2
1 + tan 2 1 + tan 2 2
2 2

3 3
=1+ 1
3 2
cos A +
2
cos B + 1
2 3
( 3 sin A.cos B + 3 sin B.cos A )
≤1+ 1
2 3
( 34 + cos A) + ( 34 + cos B ) + 4 1 3
2 2 ( 3sin 2 A + cos 2 B ) + ( 3sin 2 B + cos 2 A)

3 3( 3( 3 3
=1+ + cos 2 A + sin 2 A ) + cos 2 B + sin 2 B ) = 1 +
4 4 4 4

π 2π
Equality occurs ⇔ A = B = ,C =
6 3

⇔ bc = ca = tan π = 2 − 3 , ab = tan π = 3 ⇔ a = b = 2 3 − 3 , c = 7 − 4 3
a b 12 c 3