Maths Olympiad Prep

Library / /7 of 14

Algebra Difficulty 5.5 AIME, harder Prove it Bulgaria

Let a1>112a_1 > \frac{1}{12} and an+1=(n+2)an+1a_{n+1} = \sqrt{(n+2)a_n + 1} for n1n \ge 1. Prove that:

a) an>n2na_n > n - \frac{2}{n};

b) the sequence bn=2n(ann1)b_n = 2^n \left(\frac{a_n}{n} - 1\right), n=1,2,n = 1, 2, \dots, is convergent.

Solution

a) We shall prove the statement by induction if a1>19243(112>19243)a_1 > \frac{19}{243} \left(\frac{1}{12} > \frac{19}{243}\right). It is true for n3n \le 3, since a2>319243+1=109a_2 > \sqrt{3 \cdot \frac{19}{243} + 1} = \frac{10}{9} and a3>4109+1=73a_3 > \sqrt{4 \cdot \frac{10}{9} + 1} = \frac{7}{3}.

Assume that an>n2na_n > n - \frac{2}{n} for some n3n \ge 3. Then
an+1>(n+2)(n2n)+1. a_{n+1} > \sqrt{(n+2)\left(n - \frac{2}{n}\right) + 1}.
It is enough to show that right-hand side is bigger than n+12n+1n+1 - \frac{2}{n+1}. It is easy to see that this is equivalent to 12>1n+1(n+1)2\frac{1}{2} > \frac{1}{n} + \frac{1}{(n+1)^2}, which obviously holds for n3n \ge 3.

b) Note first that if a1=1a_1 = 1, then an=na_n = n by induction, implying that bn=2n(ann1)=0b_n = 2^n \left(\frac{a_n}{n} - 1\right) = 0.
If a1<1a_1 < 1, then an<na_n < n again by induction, i.e., bn<0b_n < 0. We shall prove that bn<bn+1b_n < b_{n+1}. This is equivalent to ann2n<an+1n1n+1\frac{a_n - n}{2n} < \frac{a_{n+1} - n - 1}{n+1}. The right-hand side equals
an+12n1(n+1)(an+1+n+1)=(n+2)an+1(n+1)2(n+1)(an+1+n+1)=(n+2)(ann)(n+1)(an+1+n+1). \frac{a_{n+1}^2 - n - 1}{(n+1)(a_{n+1} + n + 1)} = \frac{(n+2)a_n + 1 - (n+1)^2}{(n+1)(a_{n+1} + n + 1)} = \frac{(n+2)(a_n - n)}{(n+1)(a_{n+1} + n + 1)}.
It remains to show that 12n>n+2(n+1)(an+1+n+1)\frac{1}{2n} > \frac{n+2}{(n+1)(a_{n+1} + n + 1)}, i.e.,
(n+1)an+1>2n(n+2)(n+1)2=(n+1)22, (n+1)a_{n+1} > 2n(n+2) - (n+1)^2 = (n+1)^2 - 2,
which follows by a).
The above arguments show that if a1>1a_1 > 1, then bn>bn+1>0b_n > b_{n+1} > 0.
So the sequence (bn)(b_n) is monotone and bounded; hence it converges.

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

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.