Let a , b , c be positive reals satisfying a b c = 3 . Find the minimum value of a 2 b + b 2 c + c 2 a .
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.
Did the same way sir.. AM-GM inequality is simple, yet elegant
can't we take values satisfy d eq ... won't we get sol...
Log in to reply
There are 3 unknown a, b and c but only 1 equation abc=3. There are infinite solutions but only one minimum.
Actually, since the equation a b c = 9 and a 2 b + b 2 c + c 2 a and symmetrical, we can assume a = b = c = 3 3 for minimum a 2 b + b 2 c + c 2 a = 3 + 3 + 3 = 9 .
Problem Loading...
Note Loading...
Set Loading...
Since a , b , c > 0 , we can apply AM-GM Inequality.
⇒ a 2 b + b 2 c + c 2 a ≥ 3 3 a 3 b 3 c 3 = 3 a b c = 9