- #1
life is maths
- 38
- 0
Homework Statement
A sequence {an} defined recursively by a1=1 and an+1=[itex]\frac{1}{2+a subn}[/itex], n[itex]\geq[/itex]1. Show that the sequence is convergent.
Homework Equations
If a sequence is bdd below and decreasing or it is bdd above and increasing, then it is convergent.
The Attempt at a Solution
{an}[itex]\geq[/itex]0, hence it is bounded below. I checked a few terms from the beginning and obtained a decreasing sequence. I tried induction to show this, but it didn't work. Base case is O.K. a0>a1 Suppose ak>ak+1.
Then we get
ak+2=[itex]\frac{1}{2+a sub(k+1)}[/itex]>[itex]\frac{1}{2+a subk}[/itex]=ak+1, and ak+2>ak+1. I feel like I'm doing a stupid mistake, and I can't understand, if this is true, why the induction does not work. I would be grateful if you could help me. Thanks for your time and effort :)