Professional Documents
Culture Documents
Previously
Sequences
Graph of Sequences
Convergence of a Sequence
Theorems for finding limits of sequences
Outline
Outline
Alternating Sequences
If the signs of a sequence alternate from positive to negative, or vice-verse,
we say that the sequence is an alternating sequence.
Alternating Sequences
If the signs of a sequence alternate from positive to negative, or vice-verse,
we say that the sequence is an alternating sequence.
Example
(1)n
1 1 1 1
= , , , , ...
2n
2 4 8 16
n+1
{(1)
} = {1, 1, 1, 1, 1, ...}
Theorem
If lim |an | = 0, then lim an = 0.
n
Theorem
If lim |an | = 0, then lim an = 0.
n
Note
Totoo lang ito kapag zero ang limit.
Example
(1)n
2n
is convergent.
Example
(1)n
2n
is convergent.
Remark
Let {an } be an alternating sequence. If lim |an | 6= lim |an |, then lim an
n
n
n
does not exist. (That is, {an } is divergent.)
Example
Use the remark to show that the sequence (1)n+1 is divergent.
Example
Use the remark to show that the sequence (1)n+1 is divergent.
Outline
Definition
A sequence {an }
n=1 is said to be
Definition
A sequence {an }
n=1 is said to be
1
increasing if
Definition
A sequence {an }
n=1 is said to be
1
Definition
A sequence {an }
n=1 is said to be
1
decreasing if
Definition
A sequence {an }
n=1 is said to be
1
2
N
decreasing if an an+1 for all n N
increasing if an an+1 for all n
Definition
A sequence {an }
n=1 is said to be
1
2
3
N
decreasing if an an+1 for all n N
increasing if an an+1 for all n
monotonic if
Definition
A sequence {an }
n=1 is said to be
1
2
3
N
decreasing if an an+1 for all n N
increasing if an an+1 for all n
monotonic if {an }
n=1 is either increasing or decreasing.
Definition
A sequence {an }
n=1 is said to be
1
2
3
N
decreasing if an an+1 for all n N
increasing if an an+1 for all n
monotonic if {an }
n=1 is either increasing or decreasing.
Example
1
1
1 1 1
= 1, , , , ... is a decreasing sequence
n
2 3 4
Definition
A sequence {an }
n=1 is said to be
1
2
3
N
decreasing if an an+1 for all n N
increasing if an an+1 for all n
monotonic if {an }
n=1 is either increasing or decreasing.
Example
1
1
1 1 1
= 1, , , , ... is a decreasing sequence
n
2 3 4
{3n 8} = {5, 2, 1, 4, ..} is an increasing sequence.
Remark
Two methods to show that a sequence {an } is monotonic:
1 Let f (n) = a . Consider f (n) as a function of
. Find f 0 (n).
n
increasing: f 0 (n) 0 for all n [k, )
decreasing: f 0 (n) 0 for all n [k, )
Remark
Two methods to show that a sequence {an } is monotonic:
1 Let f (n) = a . Consider f (n) as a function of
. Find f 0 (n).
n
increasing: f 0 (n) 0 for all n [k, )
decreasing: f 0 (n) 0 for all n [k, )
2
increasing:
Example
Determine whether or not the following sequences are monotonic:
5n + 1
2n
Example
Determine whether or not the following sequences are monotonic:
5n + 1
2n
decreasing
Example
Determine whether or not the following sequences are monotonic:
5n + 1
2n
n!
10
decreasing
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
(2n)!
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
decreasing
(2n)!
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
decreasing
(2n)!
(1)n
2n
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
decreasing
(2n)!
(1)n
not monotonic
2n
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
decreasing
(2n)!
(1)n
not monotonic
2n
n
o
cos
n n=2
Example
Determine whether or not the following sequences are monotonic:
5n + 1
decreasing
2n
n!
increasing
10
1
decreasing
(2n)!
(1)n
not monotonic
2n
n
o
increasing
cos
n n=2
Definition
If {an }
n=1 is a sequence, then
Definition
If {an }
n=1 is a sequence, then
1
Definition
If {an }
n=1 is a sequence, then
1
N.
Definition
If {an }
n=1 is a sequence, then
1
N.
Definition
If {an }
n=1 is a sequence, then
N.
N.
Definition
If {an }
n=1 is a sequence, then
N.
N.
Definition
If {an }
n=1 is a sequence, then
N.
N.
Example
Which among the sequences in the previous example are bounded?
5n + 1
2n
(decreasing)
Example
Which among the sequences in the previous example are bounded?
5n + 1
2n
(decreasing) bounded
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing)
10
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing) not bounded
10
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing) not bounded
10
1
(decreasing)
(2n)!
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing) not bounded
10
1
(decreasing) bounded
(2n)!
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing) not bounded
10
1
(decreasing) bounded
(2n)!
n
o
cos
(increasing)
n n=2
Example
Which among the sequences in the previous example are bounded?
5n + 1
(decreasing) bounded
2n
n!
(increasing) not bounded
10
1
(decreasing) bounded
(2n)!
n
o
cos
(increasing) bounded
n n=2
Is the sequence
(1)n
2n
Is the sequence
(1)n
2n
Is the sequence
BOUNDED!
(1)n
2n
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
2n
(decreasing, bounded)
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
2n
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded)
10
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded)
(2n)!
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
(1)n
(not monotonic, bounded)
2n
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
(1)n
(not monotonic, bounded) no conclusion
2n
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded)
n n=2
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded) convergent
n n=2
Example
Which among the sequences in the previous examples are convergent by
the theorem?
5n + 1
(decreasing, bounded) convergent
2n
n!
(increasing, not bounded) no conclusion
10
1
(decreasing, bounded) convergent
(2n)!
(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded) convergent
n n=2
Completeness Axiom
Let S be a nonempty set S of real numbers. If S has an upperbound, then
S has a smallest upper bound (called the least upper bound). If S has a
lower bound, then S has largest lower bound (called the greatest lower
bound).
Remark
Let {an } be a bounded monotonic sequence.
Remark
Let {an } be a bounded monotonic sequence.
1
increasing: glb =
Remark
Let {an } be a bounded monotonic sequence.
1
Remark
Let {an } be a bounded monotonic sequence.
1
Remark
Let {an } be a bounded monotonic sequence.
1
decreasing: lub =
Remark
Let {an } be a bounded monotonic sequence.
1
Remark
Let {an } be a bounded monotonic sequence.
1
Remark
Let {an } be a bounded monotonic sequence.
1
Example
Determine the glb and lub of the convergent sequences in the previous
example.
5n + 1
2n
(decreasing)
Remark
Let {an } be a bounded monotonic sequence.
1
Example
Determine the glb and lub of the convergent sequences in the previous
example.
5n + 1
(decreasing)
2n
1
(decreasing)
(2n)!
Remark
Let {an } be a bounded monotonic sequence.
1
Example
Determine the glb and lub of the convergent sequences in the previous
example.
5n + 1
(decreasing)
2n
1
(decreasing)
(2n)!
n
o
cos
(increasing)
n n=2
Remark
Let {an } be a bounded monotonic sequence.
1
Example
Determine the glb and lub of the convergent sequences in the previous
example.
5n + 1
(decreasing)
2n
1
(decreasing)
(2n)!
n
o
cos
(increasing)
n n=2
Outline
L +
L
L
L +
L
L
N
0
L +
L +
N
0
L +
L +
N
0
L +
L
L
L +
L
L
N
0
Remark
To show that {an } converges to L by definition:
Remark
To show that {an } converges to L by definition:
1
Remark
To show that {an } converges to L by definition:
1
2
Tip:
1
Simplify |an L|
Tip:
1
2
Simplify |an L|
In the inequality |an L| < , solve for n in terms of . The the
expression in terms of is your candidate for N .
Example
Prove the following using the definition of convergence of a sequence:
1
2
converges to 0.
n2n1
5n
converges to 25 .
Announcements