For positive real numbers a , b , and c , find the minimum value of
a b c ( a + b ) ( b + c ) ( a + b + c )
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.
Your solution is similar to mine. Brilliant!
Beautiful usage on F ( a , c ) ⩾ F ( 2 1 ( a + c ) , 2 1 ( a + c ) ) .
I did get F ( a , c ) = a c 1 + 1 − a − c 1 as well. But here's where I failed spectacularly:
Then using AM-HM on the pairs on the numbers, we F ( a , c ) = a c 1 + 1 − a − c 1 = 2 ⋅ A M ( a c 1 , 1 − a − c 1 ) ⩾ 2 ⋅ H M ( a c 1 , 1 − a − c 1 ) = a c + ( 1 − a − c ) 4 or F ( a , c ) ⩾ ( a − 1 ) ( c − 1 ) 4 so we want to maximize H ( a , c ) : = ( a − 1 ) ( c − 1 ) where a , c are both in the interval ( 0 , 1 ) . And it's trivial that max ( H ( a , c ) ) occurs when a = c = 2 1 , but this means that b = 0 . Oh no!!! Where did I go wrong?!
Log in to reply
Another issue: "And it's trivial that max ( H ( a , c ) ) occurs when a = c = 2 1 ."
Actually, the closer a and c are to zero, the closer H ( a , c ) will be to 1 . eg. H ( 0 . 1 , 0 . 1 ) = 0 . 8 1 , which is greater than H ( 2 1 , 2 1 ) = 4 1 . So H does not have a true maximum in the open interval. (But even if it did, the minimum of F may occur at a different point, as Mark said.)
Log in to reply
Yup, I just got that after Mark's explanation. I've made many blunders everywhere when I tried to use a no-calculus approach.
Log in to reply
@Pi Han Goh – Yes, so far everyone has turned it over to calculus at some point. Perhaps after eliminating b or arguing that a = c .
Log in to reply
@Matthew Feig – I tried using the substitution b ↔ 2 5 + 1 b so that the minimum can occur when a = b = c , but no luck so far...
While the AM/HM inequality is true, it is not sharp, since the actual minimum value occurs when a = c , but not when a c = 1 − a − c ...
Log in to reply
Superb. I spent an hour on this but I couldn't figure out why. It's amazing that I couldn't understand why I messed up on something so elementary.
How a+b+c=1? Can we assume any finite number?
Log in to reply
Yes, we can scale a , b , c by any constant. In this case it helped to have a + b + c = 1 . Sometimes we might want a b c = 1 , or a 2 + b 2 + c 2 = 1 or even a b + a c + b c = 1 - it all depends on what we are trying to establish. The bottom line is that, when we are looking at a homogeneous expression, we can perform a scaling, reducing the degrees of freedom by one.
Log in to reply
Of course, the rescaling equation doesn't have to treat the variables symmetrically. b = 1 is a pretty good option here.
Got it thanks
I also used a calculus approach. Let X = a b c ( a + b ) ( b + c ) ( a + b + c ) . Then consider the value of a in respect to b and c , when X is minimum.
∂ a ∂ X = a 2 b c a ( ( b + c ) ( a + b + c ) + ( a + b ) ( b + c ) − ( a + b ) ( b + c ) ( a + b + c )
Putting ∂ a ∂ X = 0 , we have a 2 = b 2 + b c . Similarly, ∂ c ∂ X = 0 , ⟹ c 2 = b 2 + a b . Since a and c are interchangeable, we can assume a = c when X is minimum. Then
a 2 − a b − b 2 ⟹ a = 0 = 2 b + b 2 + 4 b 2 = 2 1 + 5 b = φ b for a > 0 where φ denotes the golden ratio.
Then minimum value of X :
min ( X ) = a b c ( a + b ) ( b + c ) ( a + b + c ) = φ 2 b 3 ( φ + 1 ) 2 b 2 ( 2 φ + 1 ) b = φ 2 φ 4 φ 3 = φ 5 = 5 φ + 3 ≈ 1 1 . 0 9 0
Looks good!
I solved this the same way. What's interesting is if you try to divide the numerator and denominator of the objective function by a 3 to reduce the number of variables by 1, then (using the calculus approach) the equations because become harder to solve (but still doable).
Log in to reply
Interesting
Actually, I took a closer look at your solution, and my way required more work. But I think it might've been better justified.
Here's a terrible solution. Because I have to resort to calculus, which I don't think is the intended approach.
Without the loss of generality, let a + b + c = 1 , then the expression in question can be reduced to a 2-variable expression: f ( a , c ) : = a c ( 1 − a − c ) ( 1 − c ) ( 1 − a ) where a and c are both in the interval ( 0 , 1 ) . Near the boundary points, f ( a , c ) diverges to infinity, so f ( a , c ) has no maximum point.
At the minimum point, the partial derivatives of f ( a , c ) must be 0, ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ δ a δ f ( a , c ) = 0 0 δ c δ f ( a , c ) = 0 ⇒ ⎩ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎧ a 2 c ( − a − c + 1 ) 2 ( c − 1 ) ( ( a − 1 ) 2 − c ) = 0 0 a c 2 ( − a − c + 1 ) 2 ( a − 1 ) ( ( a − 1 ) 2 − c ) = 0 ⟹ { ( a − 1 ) 2 − c = 0 ( c − 1 ) 2 − a = 0 Solving the system of equations above gives a = c = 2 3 − 5 ⟹ min [ f ( a , c ) ] = 2 1 1 + 5 5 ≈ 1 1 . 0 9 0 1 6 9 9 Hence, expression in question has a minimum value of 2 1 1 + 5 5 , when ( a , b , c ) take the ratio a : b : c = 2 : ( 5 − 1 ) : 2 .
I wonder if there's a way to prove that the minimum value of f ( a , c ) is 2 1 1 + 5 5 without resorting to calculus. That is,
Prove that 2 ( 1 − c ) ( 1 − a ) − ( 1 1 + 5 5 ) ⋅ a c ⋅ ( 1 − a − c ) is strictly non-negative. And it equals 0 when a = c = 2 3 − 5 .
I tried the substitution ( a , c ) ↔ ( 1 − a , 1 − c ) but I'm still stuck.
I have cut it down to one-dimensional calculus. Doubtless some devious use of the AM/GM inquality could finish it off, but never mind!
Admittedly this is not a very good solution but it spared me a lot of tedious algebra and calculus. I made extensive use of the graphing calculator Desmos to solve this problem.
Since we have three variables that can change, we can try to find when the value of a b c ( a + b ) ( b + c ) ( a + b + c ) is minimized if we only allow one variable at a time to vary. Let c = x and let f ( x ) = a b x ( a + b ) ( b + x ) ( a + b + x ) . We can expand out f ( x ) as follows:
f ( x ) = a b ( a + b ) x ( b + x ) ( a + b + x ) f ( x ) = a b ( a + b ) x a b + b 2 + b x + a x + b x + x 2 f ( x ) = a ( a + b ) 2 x 1 + a b ( a + b ) ( a + 2 b + x )
Taking the derivative of f ( x ) and setting find the x such that f ′ ( x ) = 0 gives the equation − a ( a + b ) 2 x 2 1 + a b ( a + b ) = 0 or x = ( a + b ) b .
Here is where desmos comes in. If we let c = ( a + b ) b , we can graph g ( x ) = a x c ( a + x ) ( x + c ) ( a + x + c ) against x and vary the value of a in the interval ( 0 , ∞ ) . It just so happens that the minimum of this function always occurs at the same y-value independent of our choice for a (so long as a is positive and real). The minimum of g ( x ) is approximately 1 1 . 0 9 0 1 7 .
Problem Loading...
Note Loading...
Set Loading...
Since the expression a b c ( a + b ) ( b + c ) ( a + b + c ) is homogeneous in a , b , c , we can assume that a + b + c = 1 . Thus we want to minimize a c ( 1 − a − c ) ( 1 − a ) ( 1 − c ) = a c 1 + 1 − a − c 1 = F ( a , c ) over a , c > 0 , a + c < 1 . Since 2 1 ( a + c ) ≥ a c . we deduce that F ( a , c ) ≥ F ( 2 1 ( a + c ) , 2 1 ( a + c ) ) and hence we will achieve the minimum value of F ( a , c ) when a = c . Thus we want to minimize G ( a ) = F ( a , a ) = a 2 1 + 1 − 2 a 1 0 < a < 2 1 Since G ′ ( a ) = ( 1 − 2 a ) 2 2 − a 3 2 , we see that the minimum value of G occurs when 0 = a 3 − ( 2 a − 1 ) 2 = a 3 − 4 a 2 + 4 a − 1 = ( a − 1 ) ( a 2 − 3 a + 1 ) and hence when a = 2 1 ( 3 − 5 ) , at which point G ( a ) = 2 1 ( 1 1 + 5 5 ) .