How can we prove the convergence of recursive defined sequences?

  • Context: MHB 
  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Convergence Sequence
Click For Summary
SUMMARY

The discussion focuses on proving the convergence of two recursive defined sequences: the first sequence, \(a_n=\left (\frac{n+2000}{n-2000}\right)^n\), converges to \(e^{4000}\) as \(n\) approaches infinity. The second sequence, defined recursively as \(a_n=\frac{a_{n-1}}{a_{n-1}+2}\) with \(a_1=1\), is shown to be decreasing and bounded below, thus converging by the monotone convergence theorem. Participants emphasize the importance of correctly applying propositions to avoid mistakes in limit calculations.

PREREQUISITES
  • Understanding of limits and convergence in sequences
  • Familiarity with the monotone convergence theorem
  • Basic knowledge of recursive sequences
  • Proficiency in mathematical induction
NEXT STEPS
  • Study the application of the monotone convergence theorem in detail
  • Explore different methods for proving convergence of sequences
  • Learn about the properties of exponential functions in limits
  • Investigate advanced topics in recursive sequences and their convergence
USEFUL FOR

Mathematicians, students studying real analysis, and anyone interested in understanding the convergence of recursive sequences and their applications in mathematical proofs.

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
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
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)
 
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)
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 17 ·
Replies
17
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 44 ·
2
Replies
44
Views
7K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 21 ·
Replies
21
Views
3K
Replies
1
Views
2K
Replies
3
Views
2K