If a , b , c , and d are positive real numbers, what is the infimum (minimum) value of
b + c + d a + a + c + d b + a + b + d c + a + b + c d ?
Round your answer to the nearest hundredth.
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.
Wrong, 0 is not a positive number.
Edit: Oh, good catch, Calvin. None of a , b , c , d can be 0 . Is this problem completely botched now? Because, we could pick c , d as arbitrarily close to 0 , and get an minimum as arbitrarily close to 2 . Maybe the problem should be reworded to say a , b , c , d ≥ 0 , but the minimum has to be determinate?
Edit 2: Problem now slightly re-worded.
(Ignore the following until this is resolved.)
Here's a non-rigorous approach. First, we note that if we consider "lines" passing through the origin { 0 , 0 , 0 , 0 } , using a as a parameter, that is
a = a b = a B c = a C d = a D
then the expression becomes a constant depending only on B , C , D , that is
B + C + D 1 + C + D + 1 B + D + 1 + B C + 1 + B + C D
To minimize this (this is the hand waving part), we simply let C = 0 and D = 0 , and we're left with
B 1 + B
to minimize. A little bit of calculus or other gets us the minimum of 2 .
The salient point of this approach is that if we were to attempt using partial differentials, we won't find any local maxima or minima because the value of the expression is a constant along any straight line through the origin. Hence, we have to look for maxima or minima along boundaries or where some of a , b , c , d could be 0 , but not all of them, as the value is indeterminate at origin.
This could be kind of a hard problem to visualize because it's really 4D geometry.
Log in to reply
The idea is more of "find the infimum", and it occurs when a , b → 0 , c = d .
I have edited the problem accordingly.
Log in to reply
Shee, I had to go look that up, "infimum". But that's right on target for this problem.
Log in to reply
@Michael Mendrin – Yea, it's a calculus term, which is why I almost always add "(minimum)" after it. The "better" way of posing this problem would be to restrict/normalize it to a + b + c + d = 1 .
I believe this problem can be solved using simple inequalities but I couldn't finish it off.
WLOG assume a ≤ b ≤ c ≤ d with a + b + c + d = 1 , and denote a , b , c , d as sin 2 W , sin 2 X , sin 2 Y , sin 2 Z respectively for 0 < W ≤ X ≤ Y ≤ Z ≤ 2 π .
We have sin 2 W + sin 2 X + sin 2 Y + sin 2 Z = 1 and we want to prove that tan W + tan X + tan Y + tan Z ≥ 3 4 .
not a very good approach but let d and c be veeeeerrrrrryyyy small
Problem Loading...
Note Loading...
Set Loading...
the minimum value of 2 of the terms can be 0 so let a=0 b=0 we need to find the minimum value of (c/d)^1/2 + (d/c)^1/2=2