Minimum of a complicated expression

Level 2

As a , b , c a, b, c range over all positive reals, compute the minimum value of a 3 b c + b 3 c a + c 3 a b + a b c + b c a + c a b \frac{a^3}{bc} + \frac{b^3}{ca} + \frac{c^3}{ab} + \frac{ab}{c} + \frac{bc}{a} + \frac{ca}{b}


The answer is 6.

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.

2 solutions

Clearing out the denominators, we see that the expression equals a 4 + b 4 + c 4 + a 2 b 2 + b 2 c 2 + c 2 a 2 a 2 b 2 c 2 \frac{a^4+b^4+c^4+a^2b^2+b^2c^2+c^2a^2}{a^2b^2c^2} Applying AM-GM inequality on the set ( a 4 , b 2 c 2 ) (a^4, b^2c^2) , we find out a 4 + b 2 c 2 2 a 2 b c a^4+b^2c^2 \geq 2a^2bc Similarly, b 4 + c 2 a 2 2 b 2 c a b^4+c^2a^2 \geq 2b^2ca c 4 + a 2 b 2 2 c 2 a b c^4+a^2b^2 \geq 2c^2ab Summing them up, a 4 + b 4 + c 4 + a 2 b 2 + b 2 c 2 + c 2 a 2 2 ( a 2 b c + b 2 c a + c 2 a b ) a^4+b^4+c^4 + a^2b^2+b^2c^2+c^2a^2\geq 2(a^2bc+b^2ca+c^2ab) Again, from AM-GM inequality, a 2 b c + b 2 c a + c 2 a b 3 a 3 b 3 c 3 3 = 3 a b c a^2bc+b^2ca+c^2ab \geq 3 \sqrt[3]{a^3b^3c^3}= 3abc So a 4 + b 4 + c 4 + a 2 + b 2 + c 2 6 a b c a^4+b^4+c^4+a^2+b^2+c^2 \geq 6abc a 4 + b 4 + c 4 + a 2 b 2 + b 2 c 2 + c 2 a 2 a 2 b 2 c 2 6 \frac{a^4+b^4+c^4+a^2b^2+b^2c^2+c^2a^2}{a^2b^2c^2} \geq 6 Equality holds for ( a , b , c ) = ( 1 , 1 , 1 ) (a, b, c)= (1, 1, 1) . We thus conclude our answer is 6 \boxed{6} .

1 second, am I missing something??? o.O

a = b = c a=b=c simplifies the expression into 6 a 6a . Since a a is a real, we can take the value of a a except 0 0 as small as possible to obtain smaller value.

lim a 0 + 6 a = 0 \lim_{a\rightarrow 0^+} 6a=0

We can obtain something closer to 0 0 . Perhaps I'm making a mistake, but please correct me if I'm wrong. :/

Also, I didn't get the last step where you divided both sides of the inequality by a b c abc .

Jubayer Nirjhor - 7 years, 6 months ago

Log in to reply

Yes, indeed. Thanks for pointing it out. I made an error while copying this problem (and the solution) from my rough work. Sorry to everyone who was misled.

Sreejato Bhattacharya - 7 years, 6 months ago

This question is wrong. If we let a = b = c a=b=c , then the expression becomes 6 a 6a , which has no lower bound.

A Brilliant Member - 7 years, 5 months ago

Log in to reply

I have already mentioned that in the comments. I made a mistake while copying it from my rough work.

Sreejato Bhattacharya - 7 years, 5 months ago
Jubayer Nirjhor
Dec 14, 2013

I solved this at first glance by simple observation. The terms in the expression are very neatly cyclic. So, if we want to take advantage by increasing a a , then decreasing b b and bla bla bla, it's actually disadvantageous since the variables a , b , c a,b,c are cyclically distributed in the whole expression. For example, if we want to minimize b 3 c a \dfrac{b^3}{ca} and so we minimize b b , then maximize c a ca , we are in another way maximizing c a b \dfrac{ca}{b} . Hence, maximizing, minimizing, increasing, decreasing doesn't actually help.

Hence, seeing the question first, the only solution I could think of is that a = b = c a=b=c , implying the minimum value to be 6 \fbox{6} , and it worked. :p

Sorry for being less mathematical, more logical... :D

I appreciate the thought but will not b^3 increase at a much faster rate then b???

Eddie The Head - 7 years, 6 months ago

Log in to reply

Yes, but then we have another dilemma... Since b b increases slower than b 3 b^3 , and we are maximizing c a ca , say we are only maximizing c c more, then we are also maximizing a 3 b c \dfrac{a^3}{bc} .

You'll surely find a gap whatever you do with increasing-decreasing. ;)

Jubayer Nirjhor - 7 years, 6 months ago

Typo : a = b = c = 1 a=b=c=1

Jubayer Nirjhor - 7 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...