SOLUTION: The sequence (a_n) is defined by a_1 = {1}/{2} and a_n = a_{n - 1}^2 + a_{n - 1}for n <= 2. Prove that {1}/{a_1 + 1} + {1}/{a_2 + 1} + ... + {1}/{a

SOLUTION: The sequence (a_n) is defined by a_1 = {1}/{2} and a_n = a_{n - 1}^2 + a_{n - 1}for n <= 2. Prove that {1}/{a_1 + 1} + {1}/{a_2 + 1} + ... + {1}/{a_n + 1} < 2 for all n <= 1.

Question 1176741: The sequence (a_n) is defined by a_1 = {1}/{2} and
a_n = a_{n - 1}^2 + a_{n - 1}for n <= 2.
Prove that
{1}/{a_1 + 1} + {1}/{a_2 + 1} + ... + {1}/{a_n + 1} < 2 for all n <= 1.
Answer by CPhill(1959) (Show Source): You can put this solution on YOUR website!
By the property of telescoping sum, we have quite easily that \dfrac{1}{a_n} = 2-\sum_{k=0}^{n-1}\dfrac{1}{n+a_k}.

First we show that a_n<1 which is analogous to proving that \sum_{k=0}^{n-1}\dfrac{1}{n+a_k}<1. Now, we note that \{a_k\} is an increasing sequence, hence a_k\geq a_0 for all k\geq0. This gives \sum_{k=0}^{n-1}\dfrac{1}{n+a_k}\leq\dfrac{n}{n+a_0}=\dfrac{2n}{2n+1}<1 and thus we are done.

Now we prove the other part of the inequality. We note that \sum_{k=0}^{n-1}\dfrac{1}{n+a_k}\geq\dfrac{n}{n+a_n} because of increasing property of the sequence a_n. Now using the fact that \dfrac{1}{a_n}=2-\sum_{k=0}^{n-1}\dfrac{1}{n+a_k} we have, after some algebra that 2a_n^2+(n-1)a_n-n\geq0 implying, and keeping in mind that \{a_k\} is a positive sequence, a_n\geq\dfrac{-(n-1)+\sqrt{(n-1)^2+8n}}{4}. It remains to show that this huge quantity is greater than 1-\dfrac{1}{n}. By squaring both sides, and cancelling out terms, we come to 3n>2 which is true for any n. Hence, 1/(a_1 + 1) + 1/(a_2 + 1) + ... + 1/(a_n + 1) < 2.
RELATED QUESTIONS
a(n) stands for sequence a(1)=2, a(2)=3, {{{a(n+2)=a(n+1)+1/ln(a(n))}}} Prove that the (answered by CPhill)

if n ≥ 1. Prove by induction: a^(n) - 1 =... (answered by ikleyn)

Suppose that a sequence is defined as follows. a[1] = -1 , a[n] = -3a[n-1]+6 for n... (answered by ewatrrr,solver91311)

prove that: Sum of n numbers in a sequence is... (answered by stanbon,TP)

Will n! +2, n! +3,..., n! +n for n>=2 always be a sequence of n-1 composite numbers?... (answered by jim_thompson5910)

Prove by induction: 1+a+a^2+...+a^(n-1)=(a^n-1)/(a-1) (answered by Edwin McCravy)

The sequence is defined recursively. Write the first five terms. {{{a[1]=-3}}};... (answered by Edwin McCravy)

Show that (n + 1)^2 is a divisor of (n + 1)! + n! + (n -... (answered by tommyt3rd)

Prove a^n -1=(a-1)(a^(n-1) + a^(n-2) +.......+ a+1) by using Principle of Mathematical... (answered by KMST)