Maths Olympiad Prep

Library / Vijetnam /11 of 20

Vijetnam, 2011

Algebra Difficulty 6.4 National Olympiad Prove it Vietnam

Given a sequence of real numbers (xnx_n):
x1=1andxn=2n(n−1)2∑i=1n−1xifor all n≥2. x_1 = 1 \quad \text{and} \quad x_n = \frac{2n}{(n-1)^2} \sum_{i=1}^{n-1} x_i \quad \text{for all } n \ge 2.
For each positive integer nn, let yn=xn+1−xny_n = x_{n+1} - x_n.
Show that the sequence (yny_n) has finite limit as n→+∞n \to +\infty.

Solution

For all n≥1n \ge 1, we have
xn+1=2(n+1)n2⋅∑i=1nxi=2(n+1)n2((n−1)22n+1)xn=(n+1)(n2+1)n3xn. x_{n+1} = \frac{2(n+1)}{n^2} \cdot \sum_{i=1}^{n} x_i = \frac{2(n+1)}{n^2} \left( \frac{(n-1)^2}{2n} + 1 \right) x_n = \frac{(n+1)(n^2+1)}{n^3} x_n.
Consequently xn+1n+1=(1+1n2)⋅xnn∀n≥1\frac{x_{n+1}}{n+1} = \left(1 + \frac{1}{n^2}\right) \cdot \frac{x_n}{n} \quad \forall n \ge 1.
Hence, for all n≥2n \ge 2
yn=xn+1−xn=((n+1)(n2+1)n3−1)xn=n2+n+1n2⋅xnn=(1+n+1n2)∏k=1n−1(1+1k2).(1) y_n = x_{n+1} - x_n = \left( \frac{(n+1)(n^2+1)}{n^3} - 1 \right) x_n = \frac{n^2+n+1}{n^2} \cdot \frac{x_n}{n} = \left(1 + \frac{n+1}{n^2}\right) \prod_{k=1}^{n-1} \left(1 + \frac{1}{k^2}\right). \quad (1)
Whence, with the notice that y1=x2−x1=3y_1 = x_2 - x_1 = 3, we have yn>0∀n≥1y_n > 0 \quad \forall n \ge 1, y1<y2y_1 < y_2 and for all n≥3n \ge 3
ynyn−1=n2+n+1n2⋅(n−1)2(n−1)2+n⋅(1+1(n−1)2)=1+2n4−n3+n2>1. \frac{y_n}{y_{n-1}} = \frac{n^2 + n + 1}{n^2} \cdot \frac{(n-1)^2}{(n-1)^2 + n} \cdot \left(1 + \frac{1}{(n-1)^2}\right) = 1 + \frac{2}{n^4 - n^3 + n^2} > 1.
Consequently (yn)(y_n) is an increasing sequence. (2)

Since for all n≥2n \ge 2 we have n+1<n2n + 1 < n^2 and ∏k=1n−1(1+1k2)≤(1+∑k=1n−11k2n−1)n−1\prod_{k=1}^{n-1} \left(1 + \frac{1}{k^2}\right) \le \left(1 + \frac{\sum_{k=1}^{n-1} \frac{1}{k^2}}{n-1}\right)^{n-1}, it follows from (1) that
yn<2(1+∑k=1n−11k2n−1)n−1∀n≥2.(3) y_n < 2 \left( 1 + \frac{\sum_{k=1}^{n-1} \frac{1}{k^2}}{n-1} \right)^{n-1} \quad \forall n \ge 2. \quad (3)
But ∑k=1n−11k2<1+∑k=2n−11k(k−1)=1+∑k=2n−1(1k−1−1k)=2−1n−1<2∀n≥3\sum_{k=1}^{n-1} \frac{1}{k^2} < 1 + \sum_{k=2}^{n-1} \frac{1}{k(k-1)} = 1 + \sum_{k=2}^{n-1} \left(\frac{1}{k-1} - \frac{1}{k}\right) = 2 - \frac{1}{n-1} < 2 \quad \forall n \ge 3
Hence, (3) implies yn<2(1+2n−1)n−1<2e2∀n≥2y_n < 2 \left(1 + \frac{2}{n-1}\right)^{n-1} < 2e^2 \quad \forall n \ge 2.
Hence (yn)(y_n) is bounded from above. Together with (2) this implies that (yn)(y_n) is convergent. ■

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.