Summary of Sequences

Essential Concepts

  • To determine the convergence of a sequence given by an explicit formula an=f(n)an=f(n), we use the properties of limits for functions.
  • If {an}{an} and {bn}{bn} are convergent sequences that converge to AA and BB, respectively, and cc is any real number, then the sequence {can}{can} converges to cAcA, the sequences {an±bn}{an±bn} converge to A±BA±B, the sequence {anbn}{anbn} converges to ABAB, and the sequence {anbn}{anbn} converges to ABAB, provided B0B0.
  • If a sequence is bounded and monotone, then it converges, but not all convergent sequences are monotone.
  • If a sequence is unbounded, it diverges, but not all divergent sequences are unbounded.
  • The geometric sequence {rn}{rn} converges if and only if |r|<1|r|<1 or r=1r=1.

Glossary

arithmetic sequence
a sequence in which the difference between every pair of consecutive terms is the same is called an arithmetic sequence
bounded above
a sequence {an}{an} is bounded above if there exists a constant MM such that anManM for all positive integers nn
bounded below
a sequence {an}{an} is bounded below if there exists a constant MM such that ManMan for all positive integers nn
bounded sequence
a sequence {an}{an} is bounded if there exists a constant MM such that |an|M|an|M for all positive integers nn
convergent sequence
a convergent sequence is a sequence {an}{an} for which there exists a real number LL such that anan is arbitrarily close to LL as long as nn is sufficiently large
divergent sequence
a sequence that is not convergent is divergent
explicit formula
a sequence may be defined by an explicit formula such that an=f(n)an=f(n)
geometric sequence
a sequence {an}{an} in which the ratio an+1anan+1an is the same for all positive integers nn is called a geometric sequence
index variable
the subscript used to define the terms in a sequence is called the index
limit of a sequence
the real number LL to which a sequence converges is called the limit of the sequence
monotone sequence
an increasing or decreasing sequence
recurrence relation
a recurrence relation is a relationship in which a term anan in a sequence is defined in terms of earlier terms in the sequence
sequence
an ordered list of numbers of the form a1,a2,a3,a1,a2,a3, is a sequence
term
the number anan in the sequence {an}{an} is called the nthnth term of the sequence
unbounded sequence
a sequence that is not bounded is called unbounded