Chapter3 - Chapter 3 Sequences and Their Limits 3.0...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Chapter 3 Sequences and Their Limits 3.0 Definition of Sequence Informally, a sequence is an infinite “list” of numbers where order is important. For example, { , 1 , , 1 , , 1 ,... } is a sequence. Formally, we make the following definition. Definition 3.0.1. A sequence is a function f : N → R . For n ∈ N , we call f ( n ) the n th term of the sequence; for the sake of intuitive notation, we will usually denote the n th term of the sequence by x n , y n , a n , b n , or some other letter with n as subscript, instead of f ( n ). We will denote the whole sequence by { x n } n ∈ N or simply by { x n } , where x could be any letter. Note that a sequence does not need to have a pattern at all; however, most of the sequence we will be working with will be defined by formulae such as 1 n . When we want to write down a sequence, we can specify how to compute its n th term, as in 1 n , or we can list the terms until the pattern becomes apparent, as in 1 , 1 2 , 1 3 , 1 4 ,... . We will frequently encounter sequences that are defined by recursion . An example of such a sequence is: a 1 = 1 ,a n +1 = √ 3 + 2 a n . You wil notice that in the above example we can use what we kow of the first term to calculate the second term. We can then determine the third term, and so on. For recursively defined sequences calculating a particular term requires us to already know the values of previous terms. Diversion . Is there a difference between induction and recursion? Given a sequence { a 1 ,a 2 ,a 3 ,... } , a tail of the sequence is a sequence of the form { a k ,a k +1 ,a k +2 ,... } ; that is, a collection of terms in the original sequence 24 from some fixed point onwards—thus the word tail . A tail is obtained by deleting the first few terms off the sequence. 3.1 Limits of Sequences Defining the limit. Consider the sequence 1 , 1 2 , 1 3 ,..., 1 n ,... or 1 n n ∈ N . What can we say about the a n ’s as n gets very large? As n gets larger, these germs are getting “closer and closer” to the value 0. We say that 0 is the limit of the sequence { a n } as n → ∞ , or { a n } converges to 0. We give below an informal, heuristic definition of convergence. Informal definition . Given a sequence { a n } , we say that L is the limit of { a n } as n goes to infinity if as n gets very large, the a n ’s get “closer and closer” to L . There is a problem with this definition. Note that as n gets larger, a n = 1 n gets closer and closer to- 17; however, we do not want- 17 to be a limit! What we are missing is a way of quantifying the fact that as n gets large all of the terms in the tail of the sequence are very close to 0. The following is the formal definition of limit....
View Full Document

This note was uploaded on 10/21/2010 for the course MATH 147 taught by Professor Wolzcuk during the Fall '09 term at Waterloo.

Page1 / 17

Chapter3 - Chapter 3 Sequences and Their Limits 3.0...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online