0% found this document useful (0 votes)
30 views13 pages

Math 155 Lecture Notes Section 9,1

The document defines and provides examples of sequences. Some key points: - A sequence is a function whose domain is the set of positive integers, usually denoted with subscript notation. - Examples of different types of sequences are given, such as recursively defined sequences, convergent sequences, and the Fibonacci sequence. - Convergent sequences have a limiting value, denoted lim an, as n approaches infinity. These sequences exhibit asymptotic behavior when graphed. - The document provides 14 examples of sequences and determines whether they converge or calculates their limiting value.

Uploaded by

Lune Elferdaous
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views13 pages

Math 155 Lecture Notes Section 9,1

The document defines and provides examples of sequences. Some key points: - A sequence is a function whose domain is the set of positive integers, usually denoted with subscript notation. - Examples of different types of sequences are given, such as recursively defined sequences, convergent sequences, and the Fibonacci sequence. - Convergent sequences have a limiting value, denoted lim an, as n approaches infinity. These sequences exhibit asymptotic behavior when graphed. - The document provides 14 examples of sequences and determines whether they converge or calculates their limiting value.

Uploaded by

Lune Elferdaous
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Math 155, Lecture Notes- Bonds Name____________

Section 9.1 Sequences


A sequence is a function whose domain is the set of positive integers. It will usually
be denoted with subscript notation rather than function notation. You can use your
graphing calculator in “sequence mode” to plot terms and create tables that show
terms in a sequence.

An entire sequence can be denoted as {an } .


Ex. 1:
⎪⎧ ⎫
⎪ ⎪ ⎧ ⎫⎪
{an } = ⎪⎨⎪1− n1 ⎪⎬⎪ = ⎪⎨⎪0, 12 , 32 , 34 , 45 , ...⎪⎬⎪

⎩ ⎪
⎭ ⎪
⎩ ⎪

Ex. 2:

{an } = {(−1)n n} = {0, −1, 2, − 3, 4 , ...}

Some sequences are recursively defined.


Ex. 3:

{dn } is defined as dn+1 = dn − 5 and d1 = 25 .

For the majority of the chapter, we’ll be looking at sequences that have limiting
values. These sequences are said to converge.
Ex. 4:

⎪ ⎫
⎪ ⎧
⎪ ⎫

{an } = ⎪⎨⎪ 1n ⎪⎬⎪ = ⎪⎨⎪ 1 , 1 1 1
, , , 1 , ...⎪⎬⎪ This sequence converges to 0.
⎩2 ⎪
⎪ ⎪2
⎭ ⎩ 4 8 16 32 ⎪ ⎭
If we plot the terms of a convergent sequence, we will see a “horizontal
asymptote.” That is, we will see the sequence exhibit asymptotic behavior.

Ex. 5:

⎪ ⎫

{an } = ⎪⎨⎪nn ++14 ⎪⎬⎪
Given: ⎪
⎩ ⎪

lim a =
n→∞ n
Consider

This sequence converges to 1.


In other words, if a sequnce {an } ”agrees” with a function f at every positive
integer, and if f ( x) → L as x → ∞ , then { an } → L as well.

Ex. 6:
⎧⎛
⎪ n⎫
⎞⎟ ⎪
an = ⎨⎜⎜⎜1 + n ⎟⎟ ⎪⎪⎬
{ }⎪
⎪ 1 Consider lim a =

⎪ ⎝ ⎠ ⎪⎪ n→∞ n
Given: ⎪
⎩ ⎪

New Notation: Factorial !
Try working with these on your graphing calculator.
Ex. 7:
⎧ sin n ⎪

⎪ ( )⎫⎪⎪
{ }⎪
an = ⎨
⎪ n ⎪⎪
⎬ Consider lim a =
n→∞ n
Given: ⎪

⎩ ⎪

Ex. 8:


⎪ 5n ⎪⎫⎪⎪
{ }⎪
an = ⎨ 2



Consider lim a =
n→∞ n
Given: ⎪

⎩ n + 4 ⎪


Ex. 9:
⎧ n− 2 !⎪
⎪( ) ⎫⎪⎪
{an } = ⎪⎪⎨
⎪ n! ⎪⎪
⎬ Consider lim a =
n→∞ n
Given: ⎪

⎩ ⎪

Ex. 10:


⎪ n
2
n2 ⎫⎪⎪
{ }
an = ⎨
⎪ 2n +1

2n−1


Consider lim a =
n→∞ n
Given: ⎪

⎩ ⎪


Ex. 11:
{an } = {cos(πn)} Consider lim a =
n→∞ n
Given:
Ex. 12:
⎧1 ⋅ 3 ⋅ 5 ⋅7 ⋅⋅⋅ 2n−1 ⎪
⎪ ( )⎫⎪⎪
{an } = ⎪⎪⎨
⎪ n!


Consider lim a =
n→∞ n
Given: ⎪

⎩ ⎪


Ex. 13:

⎪ −n ⎫

⎪ ⎪
{ }

an = ⎨ne 2




Consider lim a =
n→∞ n
Given: ⎪

⎩ ⎪


−x
From the graph of y = xe 2 , for x ≥ 0 , we can see that the function is bounded
⎪⎧⎪ −n ⎪⎫⎪
above by y = 1 and bounded below by y = 0 . Therefore, by Theorem 9.5, ⎪⎨ne 2 ⎪⎬
⎪⎪ ⎪⎪
⎪⎩ ⎪⎭
⎧⎪ −n ⎫⎪
⎪ ⎪
is a convergent sequence, since ⎪⎨ne 2 ⎪⎬ is bounded and monotonic for n ≥ 2 .
⎪⎪ ⎪⎪
⎪⎩ ⎪⎭

Ex. 14: The Fibonacci Sequence


Consider the sequence is defined by an+ 2 = an+1 + an with a1 = 1 and a2 = 1 .

{an } = {1, 1, 2, 3, 5, 8, 13, 21, 34, 55, .....}


This is the Fibonacci Sequence.

You might also like