Suppose ( x 1 , x 2 , ⋯ , x n , ⋯ ) is a sequence of positive real numbers such that x 1 ≥ x 2 ≥ x 3 ≥ ⋯ ≥ x n ⋯ , and for all n .
1 x 1 + 2 x 4 + 3 x 9 + ⋯ + n x n 2 ≤ 1
Then find the maximum value of
1 x 1 + 2 x 2 + 3 x 3 + ⋯ + k x k
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.
Problem Loading...
Note Loading...
Set Loading...
Let k be a natural number and let n be the unique integer such that ( n − 1 ) 2 ≤ k < n 2 Then we see that r = 1 ∑ k r x r ≤ ( 1 x 1 + 2 x 2 + 3 x 3 ) + ( 4 x 4 + 5 x 5 + ⋯ + 8 x 8 ) + ⋯ + ( ( n − 1 ) 2 x ( n − 1 ) 2 + ⋯ + k x k + ⋯ + n 2 − 1 x n 2 − 1 ) ≤ ( 1 x 1 + 1 x 1 + 1 x 1 ) + ( 4 x 4 + 4 x 4 + ⋯ + 4 x 4 ) + ⋯ + ( ( n − 1 ) 2 x ( n − 1 ) 2 + ⋯ + ( n − 1 ) 2 x ( n − 1 ) 2 ) = 1 3 x 1 + 4 5 x 2 + ⋯ + ( n − 1 ) 2 ( 2 n − 1 ) x ( n − 1 ) 2 = r = 1 ∑ n − 1 r 2 ( 2 r + 1 ) x r 2 ≤ r = 1 ∑ n − 1 r 2 ( 3 r ) x r 2 = 3 r = 1 ∑ n − 1 r x r 2 ≤ 3 where the last inequality follows from the given hypothesis.