1 / 18

IV.4 Limits of sequences introduction

IV.4 Limits of sequences introduction. What happens to a sequence a n when n tends to infinity? A sequence can have one of three types of behaviour: Convergence Divergence Neither of the above…. Graphical interpretation of limits for explicit sequences. Examples of converging sequences.

heman
Télécharger la présentation

IV.4 Limits of sequences introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IV.4 Limits of sequencesintroduction

  2. What happens to a sequence an when n tends to infinity? • A sequence can have one of three types of behaviour: • Convergence • Divergence • Neither of the above…

  3. Graphical interpretation of limits for explicit sequences

  4. Examples of converging sequences The sequence converges to a unique value: 0 We write this as limn  an = 0

  5. Examples of converging sequences The sequence converges to a unique value: 1 We write this as limn  an = 1

  6. Examples of diverging sequences The sequence diverges, it has no real limit. We can write this as limn  an = + 

  7. Examples of diverging sequences The sequence diverges; it has no real limit.

  8. A sequence that neither converges nor diverges This sequence neither converges nor diverges. In this particular case, it is periodic.

  9. Graphical interpretation of limits for implicit sequences

  10. A recursion that converges This sequence is defined by an implicit formula an+1 = f(an) From the cobweb diagram, we see that it converges to 0: We write limn  an = 0

  11. A recursion that converges This sequence is defined by an implicit formula an+1 = f(an) From the cobweb diagram, we see that it converges to a value a: We write limn  an = a

  12. A recursion that converges When the sequence converges, it always converges to A point at the intersection of the an+1 = an line (dashed), and the an+1 = f(an) curve (solid)

  13. A recursion that converges These points are called fixed points Fixed points satisfy the equation an+1 = an = f(an)

  14. A recursion that diverges This sequence diverges. We can write limn an= 

  15. A recursion that neither converges nor diverges This sequence neither converges not diverges. It is periodic. The fixed points exists but they are not the limit of the sequence

  16. A recursion that neither converges nor diverges This sequence neither converges not diverges. It is chaotic. The fixed points exists but they are not the limit of the sequence

  17. Not all fixed points are limits

  18. Not all fixed points are limits

More Related