How can we prove the convergence of recursive defined sequences?

In summary, we discussed the convergence of two sequences, one defined recursively and one given by a formula, and calculated their limits. For the first sequence, we showed that it converges to $e^{4000}$ and for the second sequence, we used the monotone convergence theorem to prove its convergence.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :giggle:

a) Check the convergence of the sequence $a_n=\left (\frac{n+2000}{n-2000}\right)^n$, $n>1$. If it converges calculate the limit.
b) Check the convergence of the recursive defined sequence $a_n=\frac{a_{n-1}}{a_{n-1}+2}$, $n>1$, with $a_1=1$.For a) we have $$a_n=\left (1+\frac{4000}{n-2000}\right) ^{n-2000}\left (1+\frac{4000}{n-2000}\right) ^{2000}\to e^{4000}$$ Having found the limit means that the sequence is also convergent, right? but could we have shown the convergence also in an other way?For b) when we calculate some terms we see the sequence is decreasing and we can prove that using induction. It also holds that $a_n>0$. This means that the sequence converges, right?

:unsure:
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
mathmari said:
a) Check the convergence of the sequence $a_n=\left (\frac{n+2000}{n-2000}\right)^n$, $n>1$. If it converges calculate the limit.

For a) we have $$a_n=\left (1+\frac{4000}{n-2000}\right) ^{n-2000}\left (1+\frac{4000}{n-2000}\right) ^{2000}\to e^{4000}$$ Having found the limit means that the sequence is also convergent, right? but could we have shown the convergence also in an other way?

Hey mathmari!

That works. (Nod)

We may want to mention which propositions we're using to conclude it though.
It's easy to make mistakes if we take the limits of parts of an expression after all. 🧐

I wouldn't immediately know a different way to do it, other than making sure the steps are correct.

mathmari said:
b) Check the convergence of the recursive defined sequence $a_n=\frac{a_{n-1}}{a_{n-1}+2}$, $n>1$, with $a_1=1$.
For b) when we calculate some terms we see the sequence is decreasing and we can prove that using induction. It also holds that $a_n>0$. This means that the sequence converges, right?
Yep. It follows from the monotone convergence theorem. (Nod)
 
  • #3
Klaas van Aarsen said:
That works. (Nod)

We may want to mention which propositions we're using to conclude it though.
It's easy to make mistakes if we take the limits of parts of an expression after all. 🧐

I wouldn't immediately know a different way to do it, other than making sure the steps are correct.Yep. It follows from the monotone convergence theorem. (Nod)

Great! Thank you! (Sun)
 

FAQ: How can we prove the convergence of recursive defined sequences?

How do we define a recursive sequence?

A recursive sequence is a sequence in which each term is defined in terms of previous terms. This means that the value of a term in the sequence depends on the values of one or more previous terms in the sequence.

What is the difference between a convergent and a divergent recursive sequence?

A convergent recursive sequence is one in which the terms approach a specific limit as the sequence progresses. In contrast, a divergent recursive sequence is one in which the terms do not approach a limit and instead either increase or decrease without bound.

How can we prove the convergence of a recursive sequence?

To prove the convergence of a recursive sequence, we can use the Monotone Convergence Theorem. This theorem states that if a sequence is bounded and monotonic (either always increasing or always decreasing), then it must converge to a limit.

Can we use the Limit Comparison Test to prove the convergence of recursive sequences?

Yes, the Limit Comparison Test can be used to prove the convergence of recursive sequences. This test compares the given sequence to a known convergent or divergent sequence and if they have the same behavior, then the given sequence will have the same behavior as well.

Are there any other methods for proving the convergence of recursive sequences?

Yes, there are other methods such as the Ratio Test, Root Test, and Direct Comparison Test that can also be used to prove the convergence of recursive sequences. These tests involve comparing the given sequence to a known convergent or divergent sequence and using that information to determine the behavior of the given sequence.

Similar threads

Replies
4
Views
2K
Replies
17
Views
3K
Replies
9
Views
2K
Replies
44
Views
5K
Replies
9
Views
1K
Replies
21
Views
2K
Back
Top