b + c + d a + a + c + d b + a + b + d c + a + b + c d
If a , b , c and d are positive real numbers, find the minimum value of the expression above.
Give your answer to 2 decimal places.
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
∑ S − a a = ∑ S − a S − 1
4 ∑ S − a S ≥ 4 S − S 4 S
4 ∑ S − a S − 1 ≥ 3 1
thus
∑ S − a S − 1 ≥ 3 4
We can use Jensen's inequality. Since the equation is homogeneous, we can assume that a+b+c+d=1. So the expression becomes a/(1-a)+b/(1-b)+c/(1-c)+d/(1-d). Now consider f(x)=x/(1-x). The second derivative of this is 2/(1-x)^3 which is positive as 0<x<1 This means that the function is convex.
So we know that 1/4((a/(1-a)+b/(1-b)+c/(1-c)+d/(1-d))>= f(1/4)=1/3.
Multiply by 4 to get the required answer.
Aside: We can generalise this argument where the denominator has n terms to get that the sum is >= n+1/n .
The problem is the n = 4 case of the generalised nestbitt's inequality .
Yes it is. What is your favourite approach to the generalized version?
Nice link! Thanks for sharing!!
Call the expression P. We have S = a ( b + c + d ) + b ( c + d + a ) + c ( d + a + b ) + d ( a + b + c ) = 2 [ ( a + d ) ( b + c ) + a d + b c ] Using Cauchy-Schwarz Inequality we get P . S ≥ ( a + b + c + d ) 2 By AM-GM, we get 2 S ≤ 4 ( a + d ) 2 + 4 ( b + c ) 2 + 2 ( a + d ) ( b + c ) + 2 ( a + d ) ( b + c ) ≤ 4 ( a + b + c + d ) 2 + 8 ( a + b + c + d ) 2 ⇒ S ≤ 4 3 ( a + b + c + d ) 2 ∴ P ≥ 3 4 The equality holds when a = b = c = d
Since interchanging a, b, c, d does not change the expression, if all are equal, we get extreme value. Since the expression has > in it, the expression with a=b=c=d could be the maximum. Thus we get 1.333. I am not sure my logic is correct.
In response to Niranjan Khaderia :This is not a solution this is a method for finding the answer in symmetric inequalities ,but this is not a solution !
Log in to reply
You are right in stating that permuting a,b,c,d does not change the value of the expression. However, that does not mean that the minimum will occur when all of the terms are equal. It could be that 4/3 is a stationary point of the function but not a minimum point.
I answered it wrong but I have a solution,
b + c + d a + a + c + d b + a + b + d c + a + b + c d 1 + b + c + d a + 1 + a + c + d b + 1 + a + b + d c + 1 + a + b + c d − 4 ( a + b + c + d ) ( b + c + d 1 + a + c + d 1 + a + b + d 1 + a + b + c 1 ) − 4 3 1 [ ( b + c + d ) + ( a + c + d ) + ( a + b + d ) + ( a + b + c ) ] ( b + c + d 1 + a + c + d 1 + a + b + d 1 + a + b + c 1 ) − 4 = S
Let, ( b + c + d ) = w , ( a + c + d ) = x , ( a + b + d ) = y and ( a + b + c ) = z .
3 S = ( w + x + y + z ) ( w 1 + x 1 + y 1 + z 1 ) − 1 2
Now applying AM-HM inequality on,
( w + x + y + z ) ( w 1 + x 1 + y 1 + z 1 ) ≥ 1 6
Therefore,
3 S ≥ 1 6 − 1 2 ⇒ S ≥ 3 4
Problem Loading...
Note Loading...
Set Loading...
Using re-arrangement inequality,
S − a a + S − b b + S − c c + S − d d ≥ S − b a + S − c b + S − d c + S − a d where S represents a + b + c + d
Similarly, keeping it in all the permutations and then adding,
n ( S − a a + S − b b + S − c c + S − d d ) ≥ ( a + b + c + d ) ( S − b 1 + S − c 1 + S − d 1 + S − a 1 )
Now using Cauchy Schwarz in Engel form,
S − b 1 + S − c 1 + S − d 1 + S − a 1 ≥ 4 S − S 1 6
Substituting,
S − a a + S − b b + S − c c + S − d d ≥ 1 2 S 1 6 S
≥ 3 4
Well, here we draw a conclusion that S − a 1 a 1 + S − a 2 a 2 + S − a 3 a 3 + . . . . . . + S − a n a n ≥ n n + 1 for any n ∈ Z +