The simpliest is the strongest INEQUALITIES WITH CLASSICAL PROOFS

Problem 1.1. Let a, b, c be non-negative real numbers such that no two of which
are zeros. Prove that
1 1 1 (a + b + c)2
+ + ≤
2a2 + bc 2b2 + ca 2c2 + ab 2(a2 b2 + b2 c2 + c2 a2 ) + abc(a + b + c)
(Tran Quoc Anh)
Proof. The inequality is written as

1 (a + b + c)2
∑ 2 ≤ .
sym 2a + bc 2(a2 b2 + b2 c2 + c2 a2 ) + abc(a + b + c)

Multiply both sides by 2(a2 b2 + b2 c2 + c2 a2 ) + abc(a + b + c), then it becomes

2(a2 b2 + b2 c2 + c2 a2 ) + abc(a + b + c)
∑ 2
≤ (a + b + c)2 ,
sym 2a + bc

Notice the following identity

2(a2 b2 + b2 c2 + c2 a2 ) + abc(a + b + c) =
= (2a2 + bc)(b2 + c2 + 2bc) − bc(b2 + c2 + a2 ) + abc(b + c − 2a),
Therefore, the inequality is equivalent to
(2a2 + bc)(b2 + c2 + 2bc) − bc(b2 + c2 + a2 ) + abc(b + c − 2a)
∑ 2 + bc
≤ (a + b + c)2 ,
sym 2a

Or
!
abc(b + c − 2a) bc
a2 + b2 + c2 + ∑ 2 + bc
≤ (a2 + b2 + c2 ) ∑ 2a2 + bc ,
sym 2a sym
!
abc(b + c − 2a) bc
∑ 2a2 + bc ≤ (a2 + b2 + c2) ∑ 2 −1 .
sym sym 2a + bc

Now, we have something interesting here

  !
bc bc bc abc b + c − 2a
∑ 2a2 + bc −1 = ∑ 2a2 + bc − ab + bc + ca = ab + bc + ca · ∑ 2 .
sym sym sym 2a + bc

It remains to show that

!
abc(b + c − 2a) abc(a2 + b2 + c2 ) b + c − 2a
∑ 2a2 + bc ≤ ab + bc + ca · ∑ 2a2 + bc ,
sym sym

Which is !
a2 + b2 + c2
 
b + c − 2a
abc · −1 ∑ 2a2 + bc ≥ 0.
ab + bc + ca sym

1
The simpliest is the strongest INEQUALITIES WITH CLASSICAL PROOFS

We only consider the nontrivial case abc 6= 0, then it suffices to prove that
b + c − 2a
∑ 2
≥ 0.
sym 2a + bc

1 1 1
Adding + + to both sides of the above inequality, we have
a b c
 
b + c − 2a 1 ab + bc + ca
∑ 2a2 + bc + a ≥ abc ,
sym

The above inequality is equivalent to the obvious one, which is apparently true
based on Cauchy Schwarz inequality

bc (bc + ca + ab)2
∑ 2 ≥ = 1.
sym 2a + bc 2abc(a + b + c) + a2 b2 + b2 c2 + c2 a2

The proof is completed. Equality holds for abc = 0 or a = b = c. 2