⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ a ≤ 1 a + b ≤ 5 a + b + c ≤ 1 4 a + b + c + d ≤ 3 0
Let a , b , c and d be positive real numbers satisfying the system of inequalities above. What is the maximum value of
a + b + c + d ?
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.
This is a great problem. I guessed my way through based on intuition. y = x for non-negative integers grows very rapidly for small values of x (consider the function for 0 ≤ x ≤ 4 ) while grows very slowly for larger values. So by intuition, I tried to pick values in such a way to distribute the magnitude equally, which lead to 1 , 4 , 9 , 1 6 permutation. This is of course a dumb way to do it and your proof is great!
Nice solution. It involves large amount of practicing on Jensen's inequality.
Just thought a=1,b=4,c=9,d=16..
Attempted 10 and was correct!
This is not a solution. Can you prove the maximum value is 10?
New solution:
We will prove a more general statement:
If a 1 , a 2 , . . . , a n are positive, 0 ≤ b 1 ≤ b 2 ≤ . . . ≤ b n , and for all k ≤ n ,
a 1 + a 2 + . . . + a k ≤ b 1 + b 2 + . . . + b k , then
a 1 + a 2 + . . . + a n ≤ b 1 + b 2 + . . . b n
Let us prove the above result. We have
∑ r = 1 n b r a r = a 1 ( b 1 1 − b 2 1 ) + ( a 1 + a 2 ) ( b 2 1 − b 3 1 ) + . . . . + ( a 1 + a 2 + . . . + a n ) ( b n 1 ) .
The differences in the parentheses are all positive. Using the hypothesis, we obtain that this expression is less than or equal to
b 1 ( b 1 1 − b 2 1 ) + ( b 1 + b 2 ) ( b 2 1 − b 3 1 ) + . . . . + ( b 1 + b 2 + . . . + b n ) ( b n 1 ) = b 1 + b 2 + . . . + b n .
Hence,
∑ r = 1 n b r a r ≤ b 1 + b 2 + . . . b n .
Using this result and and the CAUCHY-SCHWARZ inequality, we obtain
( a 1 + a 2 + . . . + a n ) 2 = ( ∑ r = 1 n ( 4 b r . b r a r ) ) 2
≤
( b 1 + b 2 + . . . + b n ) ( ∑ r = 1 n ( b r a r ) ) ≤ ( b 1 + b 2 + . . . + b n ) 2 .
This gives
a 1 + a 2 + . . . + a n ≤ b 1 + b 2 + . . . b n .
The special case of the original problem is obtained for n = 4 , by setting b k = k 2 , k = 1 , 2 , 3 , 4
Which gives us a + b + c + d ≤ 1 0 .
Please tell how the solution is.
It is wrong since you haven't considered what if a , b , c are quite small and d becomes massive (eg a = b = c = 1 and d = 2 7 , which satisfies the equations. You cannot subtract inequalities like that unfortunately.
Log in to reply
I have posted a new solution. Please tell how it is.
Problem Loading...
Note Loading...
Set Loading...
Note that f ( x ) = x is a concave function, so by weighted Jensen's inequality, we have
x 1 + x 2 + x 3 + x 4 x 1 f ( y 1 ) + x 2 f ( y 2 ) + x 3 f ( y 3 ) + x 4 f ( y 4 ) ≤ f ( x 1 + x 2 + x 3 + x 4 x 1 y 1 + x 2 y 2 + x 3 y 3 + x 4 y 4 )
If we substitute y 1 = a , y 2 = 4 b , y 3 = 9 c , y 4 = 1 6 d , x 1 = 1 0 1 , x 2 = 1 0 2 , x 3 = 1 0 3 and x 4 = 1 0 4 , we have
1 0 1 a + 1 0 2 4 b + 1 0 3 9 c + 1 0 4 1 6 d a + b + c + d ≤ 1 0 a + 2 0 b + 3 0 c + 4 0 d ≤ 1 0 1 2 0 1 2 a + 6 b + 4 c + 3 d
Note that 1 2 a + 6 b + 4 c + 3 d = 3 ( a + b + c + d ) + ( a + b + c ) + 2 ( a + b ) + 6 a ≤ 3 × 3 0 + 1 4 + 2 × 5 + 6 × 1 = 1 2 0 . Thus,
1 2 0 1 2 a + 6 b + 4 c + 3 d ≤ 1
so, a + b + c + d ≤ 1 0 .