No, the answer is not 2.500

Algebra Level 5

a b + c + d + e + b a + c + d + e + c a + b + d + e + d a + b + c + e + e a + b + c + d \begin{aligned} &&\sqrt{ \dfrac a{b+c+d+e}} + \sqrt{ \dfrac b{a+c+d+e}} + \sqrt{ \dfrac c{a+b+d+e}} \\ && + \sqrt{ \dfrac d{a+b+c+e}} + \sqrt{ \dfrac e{a+b+c+d}} \end{aligned}

Over all non-negative real numbers a , b , c , d a,b,c,d and e e , find the infimium value of the expression above.

Give your answer to 3 decimal places.


The answer is 2.000.

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.

1 solution

Ariel Gershon
Mar 18, 2016

Let n = a + b + c + d + e n=a+b+c+d+e . If we call the expression above P P , then P = k = a , b , c , d , e k n k P = \sum_{k=a,b,c,d,e}\sqrt{\frac{k}{n-k}} Using a little algebraic manipulation we get the following: 0 k ( 2 k n ) 2 = 4 k 2 ( n k ) k n 2 0 \ge -k(2k-n)^2 = 4k^2(n-k)-kn^2 k n 2 4 k 2 ( n k ) kn^2 \ge 4k^2(n-k) k n k 4 k 2 n 2 \frac{k}{n-k} \ge \frac{4k^2}{n^2} Note that in order for P P to be defined, n k 0 n-k \neq 0 . Since each k k is nonnegative, it follows that both n k n-k and n n are strictly positive, hence the above maneuver is justified. Now taking the square root of both sides gives: k n k 2 k n \sqrt{\frac{k}{n-k}} \ge \frac{2k}{n}

Therefore, P k 2 k n = 2 n n = 2 P \ge \sum_{k} \frac{2k}{n} = \frac{2n}{n} = 2

Since the problem says a , b , c , d , e a,b,c,d,e are nonnegative real numbers, we can select a = b = 1 , c = d = e = 0 a=b=1, c=d=e=0 which gives the minimum value 2 \boxed{2} .

Sorry, I have no idea how to use algebraic manipulation get the equation?

Kris Chen - 5 years, 2 months ago

In the algebraic manipulation part, I think it's easier for the others to follow the solution if you write like this: k n k 2 k n k n 2 4 k 2 ( n k ) 0 4 k 2 ( n k ) k n 2 0 k ( 2 k n ) 2 \sqrt{\frac{k}{n-k}} \geq \frac{2k}{n} \Leftrightarrow kn^2 \geq 4k^2(n-k) \Leftrightarrow 0 \geq 4k^2(n-k)-kn^2 \Leftrightarrow 0 \geq -k(2k-n)^2 .

This is true for all positive k k .

Tran Quoc Dat - 5 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...