This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Or just multiply out: ∑ c y c l ( b c a 2 + a 2 b c ) + 3 ≥ 9
Nice alternative +1!
Same thing using CS. I used that :3
Just to be different, I have a proof through Cauchy Schwarz.
a 2 b 2 c 2 ( a 2 b + b 2 c + c 2 a ) ( a b 2 + b c 2 + c a 2 ) = ( a b c a 2 b + b 2 c + c 2 a ) ( a b c a b 2 + b c 2 + c a 2 ) = ( c y c ∑ b a ) ( c y c ∑ a b ) ≥ ( 1 + 1 + 1 ) 2 = 9
Therefore, the minimum value of the expression is 9 .
Applying A M − G M on ( c a , a b , b c ) : 3 c a + a b + b c ≥ 3 c a × a b × b c a 2 b + b 2 c + c 2 a ≥ 3 a b c
Similarly, a b 2 + b c 2 + c a 2 ≥ 3 a b c ⟹ ( a 2 b + b 2 c + c a ) ( a b 2 + b c 2 + c a 2 ) ≥ 9 a 2 b 2 c 2 a 2 b 2 c 2 ( a 2 b + b 2 c + c a ) ( a b 2 + b c 2 + c a 2 ) ≥ 9
Simple standard approach.
It would have been difficult for you to find suitable terms like c a , a b , b c to get desired things. Why not take a straight path? ;) xD
Log in to reply
I had been doing such problems, so I thought we must show different angle of view so I posted this. :)
Use AM -HM inequality. First divide the firs expression of the numerator with the denominator.Then use AM-HM inequality.
Problem Loading...
Note Loading...
Set Loading...
By A M − G M inequality ,
3 a 2 b + b 2 c + c 2 a ≥ 3 ( a 2 b ) ( b 2 c ) ( c 2 a ) = 3 a 3 b 3 c 3 ⇒ a 2 b + b 2 c + c 2 a ≥ 3 a b c … ( 1 ) 3 a b 2 + b c 2 + c a 2 ≥ 3 ( a b 2 ) ( b c 2 ) ( c a 2 ) = 3 a 3 b 3 c 3 ⇒ a b 2 + b c 2 + c a 2 ≥ 3 a b c … ( 2 ) ( 1 ) × ( 2 ) ⇒ ( a 2 b + b 2 c + c 2 a ) ( a b 2 + b c 2 + c a 2 ) ≥ 9 a 2 b 2 c 2 ⇒ a 2 b 2 c 2 ( a 2 b + b 2 c + c 2 a ) ( a b 2 + b c 2 + c a 2 ) ≥ 9