Let a , b , c be positive real numbers such that a b c = 1 . The minimum value of a 3 ( b + c ) 1 + b 3 ( a + c ) 1 + c 3 ( a + b ) 1 can be written as n m . Find m + n
This is not an original problem
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.
Nice solution, but... letting a = b = c = 1 also does the trick. I find this sad :(
Log in to reply
Minimum value does not always occur when a 1 = a 2 = … a n , but it usually does :)
3 a 3 ( b + c ) 1 + b 3 ( b + c ) 1 + c 3 ( a + b ) 1 ≥ AM-HM a 3 b + a 3 c + b 3 a + b 3 c + c 3 a + c 3 b 3
But a 3 b + a 3 c + b 3 a + b 3 c + c 3 a + c 3 b ≥ AM-GM 6 6 a 8 b 8 c 8 = 6
The equality case of these inequalities is the same, so we can superimpose them:
a 3 ( b + c ) 1 + b 3 ( b + c ) 1 + c 3 ( a + b ) 1 ≥ AM-HM 3 × 6 3 = 2 3
With equality if a = b = c = 1
So the answer is 3 + 2 = 5
Problem Loading...
Note Loading...
Set Loading...
we have a b c = 1 , a , b , c ∈ R +
Write our given expression as:
a ( b + c ) a 2 1 + b ( c + a ) b 2 1 + c ( a + b ) c 2 1
By Titu's Lemma, or Cauchy-Schwarz in Engel form,
We have:
a ( b + c ) a 2 1 + b ( c + a ) b 2 1 + c ( a + b ) c 2 1 ≥ 2 ( a b + b c + c a ) ( a 1 + b 1 + c 1 ) 2 … ( 1 )
The term in the R.H.S is equal to:
2 ( a b + b c + c a ) ( a 1 + b 1 + c 1 ) 2 = 2 a b + b c + c a
By A.M- G.M inequality,
a b + b c + c a ≥ 3 3 a 2 b 2 c 2 = 3 … ( 2 )
Note that, the conditions of equality of both are same.
Thus, the inequalities can be superimposed, giving us:
a ( b + c ) a 2 1 + b ( c + a ) b 2 1 + c ( a + b ) c 2 1 ≥ 2 3