Proving Converging Sequences: {an}, {an + bn}, {bn}

Nan1teZ
Messages
11
Reaction score
0

Homework Statement



Prove or give a counterexample: If {an} and {an + bn} are convergent sequences, then {bn} is a convergent sequence.


2. The attempt at a solution

Ok I couldn't think of any counterexamples, so I tried to prove it using delta epsilon definitions:

|an - L| < E
|an + bn - M| < E
want to show: |bn - N| < E

Is this the right approach?
 
Physics news on Phys.org
Yes, and M=L+N, right? You can certainly prove that. It's the correct approach.
 
yeah I got the N = M-L part. But then after that I go in circles trying to show it is < Epsilon. =[

What's the little trick?
 
Hint: \lim_{n \to \infty} \left\{ a_{n} + b_{n} \right\} = \lim_{n \to \infty} a_{n} + \lim_{n \to \infty} b_{n}
 
And bn=(an+bn)+(-an).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top