Keep calm and do the limit

Algebra Level 5

k = 1 n 1 x k x k + 1 k = 1 n x k 2 \large\dfrac{\displaystyle\sum_{k=1}^{n-1}x_kx_{k+1}}{\displaystyle\sum_{k=1}^{n}x_k^2}

Let M n M_n be the maximum of the expression above, where x 1 , , x n x_1,\ldots,x_n are positive real numbers. Find lim n M n \displaystyle \lim_{n\to\infty}M_n .

Bonus question : Find a closed formula for M n M_n .

Note : The limit is much easier to find than M n M_n itself.


Related problems here and here .


The answer is 1.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

Andreas Wendler
Jan 8, 2016

For x 1 = x 2 = . . . = x n x_{1}=x_{2}=...=x_{n} the value is n 1 n \frac {n-1}{n} . But we find greater maxima for example 2 2 \frac{\sqrt{2}}{2} for n=3 or 15 + 5 20 \frac{15+\sqrt{5}}{20} for n=4. The value of the expression always has to be less than 1 and so does the maximum. Therefore we can write:

n 1 n < = M n < 1 \frac {n-1}{n}<=M_{n}<1

This means the limit will be equal 1.

Ja genau! (+1) Just to make the solution complete, can you explain why the expression always has to be less than 1.

Where did you get M 4 = 15 + 5 20 M_4=\frac{15+\sqrt{5}}{20} from? That's not the value I found.

Otto Bretscher - 5 years, 5 months ago

Log in to reply

1.) Completion of proof:

First we assume an order: x 1 < = x 2 < = x 3 < = . . . < = x n |x_{1}|<=|x_{2}|<=|x_{3}|<=...<=|x_{n}|

So we can write: x k x k + 1 < = x k + 1 2 x_{k}x_{k+1}<=x_{k+1}^{2}

Therefore: k = 1 n 1 x k x k + 1 < = k = 2 n x k 2 < k = 1 n x k 2 \sum_{k=1}^{n-1}x_{k}x_{k+1}<=\sum_{k=2}^{n}x_{k}^{2}<\sum_{k=1}^{n}x_{k}^{2}

q.e.d.

2.) Remark: The mentioned value for M 4 M_4 I got after calculation by hand using that first derivations to x k x_{k} must be 0. Maybe that an error occured here.

Andreas Wendler - 5 years, 5 months ago

Log in to reply

I don't mean to be difficult, but I don't think we can assume an ascending order of the variables since the function k = 1 n 1 x k x k + 1 \sum_{k=1}^{n-1}x_kx_{k+1} is not symmetric. At the maximum, the variables will not be ordered the way you assume.

One way to do it is to apply Cauchy-Schwarz to the two vectors ( x 1 , x 2 , . . . , x n , 0 ) (x_1,x_2,...,x_n,0) and ( 0 , x 1 , . . . , x n 1 , x n ) (0,x_1,...,x_{n-1},x_n) ; that gives k = 1 n 1 x k x k + 1 < k = 1 n x k 2 \sum_{k=1}^{n-1}x_kx_{k+1}<\sum_{k=1}^{n}x_k^2 so M n < 1 M_n<1 .

Otto Bretscher - 5 years, 5 months ago

Log in to reply

@Otto Bretscher I got the limit the same way ! Can you give any hint on the bonus question?

Utsav Bhardwaj - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...