b + c + d + e a + a + c + d + e b + a + b + d + e c + a + b + c + e d + a + b + c + d e
Over all non-negative real numbers a , b , c , d and e , find the infimium value of the expression above.
Give your answer to 3 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.
Sorry, I have no idea how to use algebraic manipulation get the equation?
In the algebraic manipulation part, I think it's easier for the others to follow the solution if you write like this: n − k k ≥ n 2 k ⇔ k n 2 ≥ 4 k 2 ( n − k ) ⇔ 0 ≥ 4 k 2 ( n − k ) − k n 2 ⇔ 0 ≥ − k ( 2 k − n ) 2 .
This is true for all positive k .
Problem Loading...
Note Loading...
Set Loading...
Let n = a + b + c + d + e . If we call the expression above P , then P = k = a , b , c , d , e ∑ n − k k Using a little algebraic manipulation we get the following: 0 ≥ − k ( 2 k − n ) 2 = 4 k 2 ( n − k ) − k n 2 k n 2 ≥ 4 k 2 ( n − k ) n − k k ≥ n 2 4 k 2 Note that in order for P to be defined, n − k = 0 . Since each k is nonnegative, it follows that both n − k and n are strictly positive, hence the above maneuver is justified. Now taking the square root of both sides gives: n − k k ≥ n 2 k
Therefore, P ≥ k ∑ n 2 k = n 2 n = 2
Since the problem says a , b , c , d , e are nonnegative real numbers, we can select a = b = 1 , c = d = e = 0 which gives the minimum value 2 .