Given that n = 1 ∑ k x n 2 = 9 and that n = 1 ∑ k y n 2 = 5 3 2 9
Find the maximum value of n = 1 ∑ k ( x n + y n ) 2 .
Note : x n , y n ≥ 0 .
this is a part of Who's up to the challenge?
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.
upvoted!
the intended solution was to use Minkowski's inequality,which you can prove using the same logic you were using :)
Log in to reply
Thnx :D, can you write the proof with minkowski?
I dont think we need to use Minkowski's Inequality, as it is a far generalization of Cauchy-Schwartz Inequality, because
∑ n = 1 n = k ( x n + y n ) 2 = ∑ n = 1 n = k x n 2 + ∑ n = 1 n = k y n 2 + 2 ∑ n = 1 n = k ( x n y n )
≤ 9 + 5 3 2 9 + 2 ( ∑ n = 1 n = k x n 2 ∑ n = 1 n = k y n 2 ) 2 1 (by Cauchy-Schwartz Inequality
= 5 3 3 8 + 2 . 3 . 7 3 = 5 3 3 8 + 4 3 8 = 5 7 7 6 .
Problem Loading...
Note Loading...
Set Loading...
We have that x 1 2 + ⋯ + x k 2 = 9 = 3 2 and y 1 2 + ⋯ + y k 2 = 5 3 2 9 = 7 3 2
Let N = 2 x 1 y 1 + ⋯ + 2 x k y k
Adding the three equations....
( x 1 + y 1 ) 2 + ⋯ + ( x k + y k ) 2 = 5 3 3 8 + N
The max possible value of x is 3 because of ( x 2 = 9 ) and the max possible value of y is 7 3 because of ( y 2 = 5 3 2 9 )
So the max possible value of N = 2 x y is 2 ∗ 3 ∗ 7 3 = 4 3 8
Therefore the max possible value of the sum is 5 3 3 8 + 4 3 8 = 5 7 7 6