Let a , b , c ≥ 0 such that a + b + c = 3 . Find the minimum of b + 2 a 3 + c + 2 b 3 + a + 2 c 3 − a 2 − b 2 − c 2
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.
...Well I guess thats how 75% Of the people got it.....
hy guys, my solution. if any flaws do tell me please:
F o r ⟹ ( a + 2 ) ( b + 2 ) ( c + 2 ) a 3 ( c + 2 ) ( a + 2 ) + b 3 ( a + 2 ) ( b + 2 ) + c 3 ( b + 2 ) ( c + 2 ) − ( a 2 + b 2 + c 2 ) ( a + 2 ) ( b + 2 ) ( c + 2 ) t o b e m i n i m u m ⟹ ( a + 2 ) ( b + 2 ) ( c + 2 ) h a s t o b e m a x i m u m n o w , 3 ( a + 2 ) + ( b + 2 ) + ( c + 2 ) ≥ 3 ( a + 2 ) ( b + 2 ) ( c + 2 ) ⟶ [ b y A M ≥ G M ] ⟹ 3 ≥ 3 ( a + 2 ) ( b + 2 ) ( c + 2 ) ⟹ 2 7 ≥ ( a + 2 ) ( b + 2 ) ( c + 2 ) ∴ t h e m a x v a l u e o f ( a + 2 ) ( b + 2 ) ( c + 2 ) c o m e s 2 7 w h i c h i s p o s s i b l e o n l y w h e n a = b = c = 1 a f t e r p u t t i n g a = b = c = 1 i n t h e o r i g i n a l e q . t h e m i n i m u m v a l u e c o m e s − 2 .
Thats it!!!! Did it the same way. Nice solution:)
Who can write a full solution for this problem?
Try to use AM-GM and CS repeatedly :)
I used the equality case of AM-GM that is I assumed a=b=c=1 can any expert tell me more about this solution
I think we can't solve this problem by using AM-GM!!!
i also used am gm equality that a=b=c=1 how to solve by method
Problem Loading...
Note Loading...
Set Loading...
Really VERY EASY!!!!!! just 1 min ques..
min. value will be when a=b=c=1. put a=b=c=1 in expression and you will get -2.
1 b'coz a,b,c is positive.