You're given that n 1 + k 1 = 1 and that n = 4 . If the sum i = 1 ∑ m x i n = 1 2 9 6 and the sum i = 1 ∑ m y i k = 1 6 then find the maximum value of i = 1 ∑ m x i y i .
Note : All x i and y i are non-negative real numbers.
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.
This is the exact statement of Holder's Inequality and a special case of it yields the maximum value of the required summation to be ( 1 2 9 6 1 / 4 ) ∗ ( 1 6 1 − 4 1 ) = 6 ∗ 8 = 4 8
Exactly, I also applied Holder's Inequality. This problem is a direct application of that. (+1)
By Holder's inequality ( ∑ i = 1 m x i 4 ) 4 1 ( ∑ i = 1 m y i 3 4 ) 4 3 ≥ ∑ i = 1 m x i y i
Problem Loading...
Note Loading...
Set Loading...
By Holder's Inequality, we have:
i = 1 ∑ m x i 4 ⋅ i = 1 ∑ m y i 3 4 ⋅ i = 1 ∑ m y i 3 4 ⋅ i = 1 ∑ m y i 3 4 ≥ ( i = 1 ∑ m x i y i ) 4
⇒ ( 1 2 9 6 × 1 6 × 1 6 × 1 6 ) 4 1 ≥ i = 1 ∑ m x i y i
⇒ 4 8 ≥ i = 1 ∑ m x i y i