and define
Prove
Is it as simple as
Therefore,
Printable View
and define
Prove
Is it as simple as
Therefore,
I don't know why you pickedand I don't know where to go from the
.
Can you elaborate further.
you can rewrite this difference as the sum of two differences, and use a version of the triagle inequality.....
the "idea" behind this is that any convergent series is Cauchy, so for large enough n, two successive terms are as close as we like (this means something in terms of epsilon), so the "average" of the two successive terms (for large enough n) is going to be close to the limit as well.
since {an}-->A, for any ε > 0, there IS some N with |an - A| < ε for all n > N. so 1/2 of that is less than ε/2.
if n > N, surely n+1 > N as well, thus |a(n+1) - A| < ε, too. there is no need for a "secondary" epsilon: