Let a1=√2 and an+1=√2+√an. Now I want to show by induction that √2≤an≤2 for all n.
The base case is n=1 and it is clear √2≤a1≤2. Then I assume that √2≤an≤2 holds and I want to show √2≤an+1≤2.
Then I note that √2≤an+1≤2⟹√2≤√2+√an≤2. By squaring both sides I get 2≤2+√an≤4. Then by subtracting 2, I get 0≤√an≤2. This means that 0≤an≤4. This is ok because I assumed 0≤√2≤an≤2≤4.
Edit
How about this: Since I know √2≤an≤2. Then it is clear that 0≤an≤4. By taking square roots I get 0≤√an≤2. Now if I add 2, 2≤√an+2≤4. Taking another square root I get √2≤√√an+2≤2. So √2≤an+1≤2.
Answer
Note that you want to show the case n implies n+1, but you're going the other way.
The good thing about this sequence is the inductive step is indeed easy.
The base case is √2≤a1≤2
We now assume √2≤an≤2
Take a square root, then add two, then take a square root.
√4√2+2≤√2+√an≤√√2+2
√4√2+2≤an+1≤√√2+2
Note that since √2+2<4⇒√√2+2<2 and similarily 2<4√2+2⇒√2<√4√2+2
Add: Your edit makes perfect sense.
No comments:
Post a Comment