Let f ( a , b , c ) = ( a + b + c ) ( ∑ c y c b + c a + b + c + a )
Find the minimum value of f ( a , b , c ) upto 3 decimal places, as a , b , c varies over all positive reals.
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.
Put a=b=c=1 Instead
@Souryajit Roy Aren't we losing generality by assuming a + b + c = 1 ? I'm new to it, please explain. Thanks.
Log in to reply
I am also doubtful.
Here's the explanation , why I assumed a + b + c = 1 . The trick is called Homogenization.
Let s = a + b + c and p = a / s , q = b / s and r = c / s .
Let the minimum value be k ( k is constant)
Then the given inequality can be rewritten as
∑ c y c b + c s + a ≥ s k
On multiplying by s
∑ c y c b + c s + s a ≥ k
Finally, dividing the numerator and the denominator on the left by s
∑ c y c q + r 1 + p ≥ k where p + q + r = a / s + b / s + c / s = 1 .
We can easily solve using Jensen's Inequality from line 2 of your solution
It is a reallly easy solution
Problem Loading...
Note Loading...
Set Loading...
Without loss of generality,one may assume a + b + c = 1 .
So, now we have to find the minimum value of f ( a , b , c ) = ∑ c y c 1 − a 1 + a .
By AM-HM inequality, 3 ∑ c y c ( 1 − a ) ≥ ∑ c y c 1 − a 1 3
or, ∑ c y c 1 − a 1 ≥ ∑ c y c ( 1 − a ) 9 = 3 − ( a + b + c ) 9 = 2 9
Now let a = x , b = y , c = z . Hence, x 2 + y 2 + z 2 = 1
Let g ( x , y ) = ∑ c y c 1 − x 2 x .Now we have to minimize this.
( y + z ) 2 ≥ 2 ( y 2 + z 2 ) = 2 ( 1 − x 2 )
or, 1 − x 2 x ≥ 2 ( y + z ) 2 x
So, ( x + y + z ) g ( x , y ) ≥ 2 ( x + y + z ) ( ∑ c y c ( y + z ) 2 x ) ≥ 2 ( ∑ c y c y + z x ) 2 ≥ 2 ( 2 3 ) 2 = 2 9 (By Nesbitt's Inequality)
By AM-RMS inequality,
x + y + z ≤ 3 3 x 2 + y 2 + z 2 = 3 3
or, x + y + z 1 ≥ 3 3
Hence, g ( x . y ) ≥ 2 3 3
Therefore, f ( a , b , c ) ≥ 2 9 + 3 3 = 7 . 0 9 8