The minimum value of a x 3 + b y 3 + c z 2 + x y z d for fixed a , b , c , d > 0 and x , y , z ≥ 0 can be written in the form l 9 / n m 1 0 / n n n a 2 b 2 c 3 d 6 , where l , m , and n are positive integers. What is l + m + n ?
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.
You are a man of genius... I solved it hard.
Log in to reply
Would you mind posting it. Solution might be hard here but it may be easier elsewhere. Who knows?
Same. Nice problem . : )
easy isn't it @Nishant Sharma
Problem Loading...
Note Loading...
Set Loading...
Since the problem says a single application of A.M-G.M. would do the job so we seek such terms so that their product will result in x 0 y 0 z 0 . L.C.M. of 3 and 2 is 6 . Now applying the inequality:
1 3 ( 2 a x 3 + 2 a x 3 ) + ( 2 b y 3 + 2 b y 3 ) + ( 3 c z 2 + 3 c z 2 + 3 c z 2 ) + ( 6 x y z d + 6 x y z d + 6 x y z d + 6 x y z d + 6 x y z d + 6 x y z d ) ≥ ( 2 1 0 3 9 a 2 b 2 c 3 d 6 ) 1 3 1 . So we get l + m + n = 1 3 + 2 + 3 = 1 8 .