For positive reals a , b , and c , find the minimum value of the expression below.
( a + b 1 ) ( b + c 1 ) ( c + a 1 )
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.
Applying Hölder's inequality and then AM-GM inequality :
( a + b 1 ) ( b + c 1 ) ( c + a 1 ) ≥ ( a b c + a b c 1 ) 3 ≥ ( 2 a b c a b c ) 3 = 2 3 = 8
Equality occurs when a = b = c = 1 .
( a + b 1 ) + ( b + c 1 ) + ( c + a 1 ) = ( a b c + a b c 1 ) + ( a + b + c ) + ( a 1 + b 1 + c 1 ) .
Now,
a b c + a b c 1 ≥ 2 (A. M.-G. M. inequality) .
( a + b + c ) + ( a 1 + b 1 + c 1 ) ≥ 2 ( a + b + c ) ( a 1 + b 1 + c 1 ) (A. M.-G. M. inequality) , ≥ 2 9 = 6 (A. M.-H. M. inequality)
So the minimum of the given expression is 2 + 6 = 8 .
Lemma: First, consider the function f ( x ) = x + x 1 . The minimum value of this function, for x ∈ R + , is found at x = 1 , where f ( x ) = 2 .
(This is an easy fact to note considering the behavior of f ′ ( x ) = 1 − x 2 1 . )
Now expand the expression above:
( a + b 1 ) ( b + c 1 ) ( c + a 1 ) =
a b c + a + b + c + a 1 + b 1 + c 1 + a b c 1 =
( a + a 1 ) + ( b + b 1 ) + ( c + c 1 ) + ( a b c + a b c 1 )
≥ (by Lemma) 2 + 2 + 2 + 2 = 8 .
And the minimum is achieved at a = b = c = 1 .
Expanding, we get the expression a b c + a + b + c + a 1 + b 1 + c 1 + a b c 1 .
We re-arrange this to get the expression a b c + a b c 1 + a + a 1 + b + b 1 + c + c 1 .
Then, we apply AM-GM. In general, for positive reals (which is the domain stated in the question):
2 k + k 1 ≥ k × k 1
k + k 1 ≥ 2
We apply this logic to our equation, and the minimum value of it is 8 . Equality occurs when a = b = c = 1 .
Problem Loading...
Note Loading...
Set Loading...
Simply applying AM-GM inequality,we get
( a + b 1 ) ( b + c 1 ) ( c + a 1 ) ≥ ( 2 b a ∗ 2 c b ∗ 2 a c )
which results in ≥ 8 .Hence 8 is the answer.