Proving Cauchy Sequence: a_n = [a_(n-1) + a_(n-2)]/2

ricardianequiva
Messages
14
Reaction score
0

Homework Statement


Prove that the following sequence is Cauchy:
a_n = [a_(n-1) + a_(n-2)]/2 (i.e. the average of the last two), where
a_0 = x
a_1 = y


Homework Equations


None


The Attempt at a Solution


I was trying to use the definition of Cauchy (i.e. |a_m - a_n| < e) by relating a_n - a_(n-1) to a_(n-1) - a_(n-2), but to no avail.
 
Physics news on Phys.org
can you use the theorem: every convergent sequence, is a cauchy sequence

just prove the sequence converges, cite the theorem, and you're finished
 
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