### Learning Objectives

- 5.1.1. Find the formula for the general term of a sequence.
- 5.1.2. Calculate the limit of a sequence if it exists.
- 5.1.3. Determine the convergence or divergence of a given sequence.

In this section, we introduce sequences and define what it means for a sequence to converge or diverge. We show how to find limits of sequences that converge, often by using the properties of limits for functions discussed earlier. We close this section with the Monotone Convergence Theorem, a tool we can use to prove that certain types of sequences converge.

### Terminology of Sequences

To work with this new topic, we need some new terms and definitions. First, an infinite sequence is an ordered list of numbers of the form

Each of the numbers in the sequence is called a term. The symbol $n$ is called the index variable for the sequence. We use the notation

to denote this sequence. A similar notation is used for sets, but a sequence is an ordered list, whereas a set is not ordered. Because a particular number ${a}_{n}$ exists for each positive integer $n,$ we can also define a sequence as a function whose domain is the set of positive integers.

Let’s consider the infinite, ordered list

This is a sequence in which the first, second, and third terms are given by ${a}_{1}=2,$ ${a}_{2}=4,$ and ${a}_{3}=8.$ You can probably see that the terms in this sequence have the following pattern:

Assuming this pattern continues, we can write the $n\text{th}$ term in the sequence by the explicit formula ${a}_{n}={2}^{n}.$ Using this notation, we can write this sequence as

Alternatively, we can describe this sequence in a different way. Since each term is twice the previous term, this sequence can be defined recursively by expressing the $n\text{th}$ term ${a}_{n}$ in terms of the previous term ${a}_{n-1}.$ In particular, we can define this sequence as the sequence $\left\{{a}_{n}\right\}$ where ${a}_{1}=2$ and for all $n\ge 2,$ each term ${a}_{n}$ is defined by the recurrence relation${a}_{n}=2{a}_{n-1}.$

### Definition

An infinite sequence$\left\{{a}_{n}\right\}$ is an ordered list of numbers of the form

The subscript $n$ is called the index variable of the sequence. Each number ${a}_{n}$ is a term of the sequence. Sometimes sequences are defined by explicit formulas, in which case ${a}_{n}=f(n)$ for some function $f(n)$ defined over the positive integers. In other cases, sequences are defined by using a recurrence relation. In a recurrence relation, one term (or more) of the sequence is given explicitly, and subsequent terms are defined in terms of earlier terms in the sequence.

Note that the index does not have to start at $n=1$ but could start with other integers. For example, a sequence given by the explicit formula ${a}_{n}=f(n)$ could start at $n=0,$ in which case the sequence would be

Similarly, for a sequence defined by a recurrence relation, the term ${a}_{0}$ may be given explicitly, and the terms ${a}_{n}$ for $n\ge 1$ may be defined in terms of ${a}_{n-1}.$ Since a sequence $\left\{{a}_{n}\right\}$ has exactly one value for each positive integer $n,$ it can be described as a function whose domain is the set of positive integers. As a result, it makes sense to discuss the graph of a sequence. The graph of a sequence $\left\{{a}_{n}\right\}$ consists of all points $(n,{a}_{n})$ for all positive integers $n.$ Figure 5.2 shows the graph of $\left\{{2}^{n}\right\}.$

Two types of sequences occur often and are given special names: arithmetic sequences and geometric sequences. In an arithmetic sequence, the *difference* between every pair of consecutive terms is the same. For example, consider the sequence

You can see that the difference between every consecutive pair of terms is $4.$ Assuming that this pattern continues, this sequence is an arithmetic sequence. It can be described by using the recurrence relation

Note that

Thus the sequence can also be described using the explicit formula

In general, an arithmetic sequence is any sequence of the form ${a}_{n}=cn+b.$

In a geometric sequence, the *ratio* of every pair of consecutive terms is the same. For example, consider the sequence

We see that the ratio of any term to the preceding term is $-\frac{1}{3}.$ Assuming this pattern continues, this sequence is a geometric sequence. It can be defined recursively as

Alternatively, since

we see that the sequence can be described by using the explicit formula

The sequence $\left\{{2}^{n}\right\}$ that we discussed earlier is a geometric sequence, where the ratio of any term to the previous term is $2.$ In general, a geometric sequence is any sequence of the form ${a}_{n}=c{r}^{n}.$

### Example 5.1

#### Finding Explicit Formulas

For each of the following sequences, find an explicit formula for the $n\text{th}$ term of the sequence.

- $-\frac{1}{2},\frac{2}{3},-\frac{3}{4},\frac{4}{5},-\frac{5}{6}\text{,\u2026}$
- $\frac{3}{4},\frac{9}{7},\frac{27}{10},\frac{81}{13},\frac{243}{16}\text{,\u2026}$

#### Solution

- First, note that the sequence is alternating from negative to positive. The odd terms in the sequence are negative, and the even terms are positive. Therefore, the $n\text{th}$ term includes a factor of ${\left(\mathrm{-1}\right)}^{n}.$ Next, consider the sequence of numerators $\{1,2,3\text{,\u2026}\}$ and the sequence of denominators $\{2,3,4\text{,\u2026}\}.$ We can see that both of these sequences are arithmetic sequences. The $n\text{th}$ term in the sequence of numerators is $n,$ and the $n\text{th}$ term in the sequence of denominators is $n+1.$ Therefore, the sequence can be described by the explicit formula

$${a}_{n}=\frac{{\left(\mathrm{-1}\right)}^{n}n}{n+1}.$$ - The sequence of numerators $3,9,27,81,243\text{,\u2026}$ is a geometric sequence. The numerator of the $n\text{th}$ term is ${3}^{n}$ The sequence of denominators $4,7,10,13,16\text{,\u2026}$ is an arithmetic sequence. The denominator of the $n\text{th}$ term is $4+3\left(n-1\right)=3n+1.$ Therefore, we can describe the sequence by the explicit formula ${a}_{n}=\frac{{3}^{n}}{3n+1}.$

Find an explicit formula for the $n\text{th}$ term of the sequence $\{\frac{1}{5},-\frac{1}{7},\frac{1}{9},-\frac{1}{11}\text{,\u2026}\}.$

### Example 5.2

#### Defined by Recurrence Relations

For each of the following recursively defined sequences, find an explicit formula for the sequence.

- ${a}_{1}=2,$ ${a}_{n}=\mathrm{-3}{a}_{n-1}$ for $n\ge 2$
- ${a}_{1}=\frac{1}{2},$ ${a}_{n}={a}_{n-1}+{\left(\frac{1}{2}\right)}^{n}$ for $n\ge 2$

#### Solution

- Writing out the first few terms, we have

$$\begin{array}{c}{a}_{1}=2\hfill \\ {a}_{2}=\mathrm{-3}{a}_{1}=\mathrm{-3}\left(2\right)\hfill \\ {a}_{3}=\mathrm{-3}{a}_{2}={\left(\mathrm{-3}\right)}^{2}2\hfill \\ {a}_{4}=\mathrm{-3}{a}_{3}={\left(\mathrm{-3}\right)}^{3}2.\hfill \end{array}$$

In general,

$${a}_{n}=2{\left(\mathrm{-3}\right)}^{n-1}.$$ - Write out the first few terms:

$$\begin{array}{}\\ \\ {a}_{1}=\frac{1}{2}\hfill \\ {a}_{2}={a}_{1}+{\left(\frac{1}{2}\right)}^{2}=\frac{1}{2}+\frac{1}{4}=\frac{3}{4}\hfill \\ {a}_{3}={a}_{2}+{\left(\frac{1}{2}\right)}^{3}=\frac{3}{4}+\frac{1}{8}=\frac{7}{8}\hfill \\ {a}_{4}={a}_{3}+{\left(\frac{1}{2}\right)}^{4}=\frac{7}{8}+\frac{1}{16}=\frac{15}{16}.\hfill \end{array}$$

From this pattern, we derive the explicit formula

$${a}_{n}=\frac{{2}^{n}-1}{{2}^{n}}=1-\frac{1}{{2}^{n}}.$$

Find an explicit formula for the sequence defined recursively such that ${a}_{1}=\mathrm{-4}$ and ${a}_{n}={a}_{n-1}+6.$

### Limit of a Sequence

A fundamental question that arises regarding infinite sequences is the behavior of the terms as $n$ gets larger. Since a sequence is a function defined on the positive integers, it makes sense to discuss the limit of the terms as $n\to \infty .$ For example, consider the following four sequences and their different behaviors as $n\to \infty $ (see Figure 5.3):

- $\left\{1+3n\right\}=\{4,7,10,13\text{,\u2026}\}.$ The terms $1+3n$ become arbitrarily large as $n\to \infty .$ In this case, we say that $1+3n\to \infty $ as $n\to \infty .$
- $\left\{1-{\left(\frac{1}{2}\right)}^{n}\right\}=\left\{\frac{1}{2},\frac{3}{4},\frac{7}{8},\frac{15}{16}\text{,\u2026}\right\}.$ The terms $1-{\left(\frac{1}{2}\right)}^{n}\to 1$ as $n\to \infty .$
- $\left\{{\left(\mathrm{-1}\right)}^{n}\right\}=\{\text{\u2212}1,1,\mathrm{-1},1\text{,\u2026}\}.$ The terms alternate but do not approach one single value as $n\to \infty .$
- $\left\{\frac{{\left(\mathrm{-1}\right)}^{n}}{n}\right\}=\left\{\mathrm{-1},\frac{1}{2},-\frac{1}{3},\frac{1}{4}\text{,\u2026}\right\}.$ The terms alternate for this sequence as well, but $\frac{{\left(\mathrm{-1}\right)}^{n}}{n}\to 0$ as $n\to \infty .$

From these examples, we see several possibilities for the behavior of the terms of a sequence as $n\to \infty .$ In two of the sequences, the terms approach a finite number as $n\to \infty .$ In the other two sequences, the terms do not. If the terms of a sequence approach a finite number $L$ as $n\to \infty ,$ we say that the sequence is a convergent sequence and the real number $L$ is the limit of the sequence. We can give an informal definition here.

### Definition

Given a sequence $\left\{{a}_{n}\right\},$ if the terms ${a}_{n}$ become arbitrarily close to a finite number $L$ as $n$ becomes sufficiently large, we say $\left\{{a}_{n}\right\}$ is a convergent sequence and $L$ is the limit of the sequence. In this case, we write

If a sequence $\left\{{a}_{n}\right\}$ is not convergent, we say it is a divergent sequence.

From Figure 5.3, we see that the terms in the sequence $\left\{1-{\left(\frac{1}{2}\right)}^{n}\right\}$ are becoming arbitrarily close to $1$ as $n$ becomes very large. We conclude that $\left\{1-{\left(\frac{1}{2}\right)}^{n}\right\}$ is a convergent sequence and its limit is $1.$ In contrast, from Figure 5.3, we see that the terms in the sequence $1+3n$ are not approaching a finite number as $n$ becomes larger. We say that $\{1+3n\}$ is a divergent sequence.

In the informal definition for the limit of a sequence, we used the terms “arbitrarily close” and “sufficiently large.” Although these phrases help illustrate the meaning of a converging sequence, they are somewhat vague. To be more precise, we now present the more formal definition of limit for a sequence and show these ideas graphically in Figure 5.4.

### Definition

A sequence $\left\{{a}_{n}\right\}$ converges to a real number $L$ if for all $\epsilon >0,$ there exists an integer $N$ such that $\left|{a}_{n}-L\right|<\epsilon $ if $n\ge N.$ The number $L$ is the limit of the sequence and we write

In this case, we say the sequence $\left\{{a}_{n}\right\}$ is a convergent sequence. If a sequence does not converge, it is a divergent sequence, and we say the limit does not exist.

We remark that the convergence or divergence of a sequence $\left\{{a}_{n}\right\}$ depends only on what happens to the terms ${a}_{n}$ as $n\to \infty .$ Therefore, if a finite number of terms ${b}_{1},{b}_{2}\text{,\u2026},{b}_{N}$ are placed before ${a}_{1}$ to create a new sequence

this new sequence will converge if $\left\{{a}_{n}\right\}$ converges and diverge if $\left\{{a}_{n}\right\}$ diverges. Further, if the sequence $\left\{{a}_{n}\right\}$ converges to $L,$ this new sequence will also converge to $L.$

As defined above, if a sequence does not converge, it is said to be a divergent sequence. For example, the sequences $\{1+3n\}$ and $\left\{{\left(\mathrm{-1}\right)}^{n}\right\}$ shown in Figure 5.4 diverge. However, different sequences can diverge in different ways. The sequence $\left\{{\left(\mathrm{-1}\right)}^{n}\right\}$ diverges because the terms alternate between $1$ and $\mathrm{-1},$ but do not approach one value as $n\to \infty .$ On the other hand, the sequence $\{1+3n\}$ diverges because the terms $1+3n\to \infty $ as $n\to \infty .$ We say the sequence $\{1+3n\}$ diverges to infinity and write $\underset{n\to \infty}{\text{lim}}(1+3n)=\infty .$ It is important to recognize that this notation does not imply the limit of the sequence $\{1+3n\}$ exists. The sequence is, in fact, divergent. Writing that the limit is infinity is intended only to provide more information about why the sequence is divergent. A sequence can also diverge to negative infinity. For example, the sequence $\{\text{\u2212}5n+2\}$ diverges to negative infinity because $\mathrm{-5}n+2\to \text{\u2212}\infty $ as $n\to \text{\u2212}\infty .$ We write this as $\underset{n\to \infty}{\text{lim}}\left(\mathrm{-5}n+2\right)=\to \text{\u2212}\infty .$

Because a sequence is a function whose domain is the set of positive integers, we can use properties of limits of functions to determine whether a sequence converges. For example, consider a sequence $\left\{{a}_{n}\right\}$ and a related function $f$ defined on all positive real numbers such that $f(n)={a}_{n}$ for all integers $n\ge 1.$ Since the domain of the sequence is a subset of the domain of $f,$ if $\underset{x\to \infty}{\text{lim}}f(x)$ exists, then the sequence converges and has the same limit. For example, consider the sequence $\left\{\frac{1}{n}\right\}$ and the related function $f\left(x\right)=\frac{1}{x}.$ Since the function $f$ defined on all real numbers $x>0$ satisfies $f\left(x\right)=\frac{1}{x}\to 0$ as $x\to \infty ,$ the sequence $\left\{\frac{1}{n}\right\}$ must satisfy $\frac{1}{n}\to 0$ as $n\to \infty .$

#### Limit of a Sequence Defined by a Function

Consider a sequence $\left\{{a}_{n}\right\}$ such that ${a}_{n}=f(n)$ for all $n\ge 1.$ If there exists a real number $L$ such that

then $\left\{{a}_{n}\right\}$ converges and

We can use this theorem to evaluate $\underset{n\to \infty}{\text{lim}}{r}^{n}$ for $0\le r\le 1.$ For example, consider the sequence $\left\{{\left(1\text{/}2\right)}^{n}\right\}$ and the related exponential function $f(x)={\left(1\text{/}2\right)}^{x}.$ Since $\underset{x\to \infty}{\text{lim}}{\left(1\text{/}2\right)}^{x}=0,$ we conclude that the sequence $\left\{{\left(1\text{/}2\right)}^{n}\right\}$ converges and its limit is $0.$ Similarly, for any real number $r$ such that $0\le r<1,$ $\underset{x\to \infty}{\text{lim}}{r}^{x}=0,$ and therefore the sequence $\left\{{r}^{n}\right\}$ converges. On the other hand, if $r=1,$ then $\underset{x\to \infty}{\text{lim}}{r}^{x}=1,$ and therefore the limit of the sequence $\left\{{1}^{n}\right\}$ is $1.$ If $r>1,$ $\underset{x\to \infty}{\text{lim}}{r}^{x}=\infty ,$ and therefore we cannot apply this theorem. However, in this case, just as the function ${r}^{x}$ grows without bound as $n\to \infty ,$ the terms ${r}^{n}$ in the sequence become arbitrarily large as $n\to \infty ,$ and we conclude that the sequence $\left\{{r}^{n}\right\}$ diverges to infinity if $r>1.$

We summarize these results regarding the geometric sequence $\left\{{r}^{n}\right\}\text{:}$

Later in this section we consider the case when $r<0.$

We now consider slightly more complicated sequences. For example, consider the sequence $\{{(2\text{/}3)}^{n}+{(1\text{/}4)}^{n}\}.$ The terms in this sequence are more complicated than other sequences we have discussed, but luckily the limit of this sequence is determined by the limits of the two sequences $\left\{{(2\text{/}3)}^{n}\right\}$ and $\left\{{(1\text{/}4)}^{n}\right\}.$ As we describe in the following algebraic limit laws, since $\left\{{(2\text{/}3)}^{n}\right\}$ and ${\{1\text{/}4)}^{n}\}$ both converge to $0,$ the sequence $\{{(2\text{/}3)}^{n}+{(1\text{/}4)}^{n}\}$ converges to $0+0=0.$ Just as we were able to evaluate a limit involving an algebraic combination of functions $f$ and $g$ by looking at the limits of $f$ and $g$ (see Introduction to Limits), we are able to evaluate the limit of a sequence whose terms are algebraic combinations of ${a}_{n}$ and ${b}_{n}$ by evaluating the limits of $\left\{{a}_{n}\right\}$ and $\left\{{b}_{n}\right\}.$

#### Algebraic Limit Laws

Given sequences $\left\{{a}_{n}\right\}$ and $\left\{{b}_{n}\right\}$ and any real number $c,$ if there exist constants $A$ and $B$ such that $\underset{n\to \infty}{\text{lim}}{a}_{n}=A$ and $\underset{n\to \infty}{\text{lim}}{b}_{n}=B,$ then

- $\underset{n\to \infty}{\text{lim}}c=c$
- $\underset{n\to \infty}{\text{lim}}c{a}_{n}=c\underset{n\to \infty}{\text{lim}}{a}_{n}=cA$
- $\underset{n\to \infty}{\text{lim}}\left({a}_{n}\pm {b}_{n}\right)=\underset{n\to \infty}{\text{lim}}{a}_{n}\pm \underset{n\to \infty}{\text{lim}}{b}_{n}=A\pm B$
- $\underset{\text{n}\to \infty}{\text{lim}}\left({a}_{n}\xb7{b}_{n}\right)=\left(\underset{n\to \infty}{\text{lim}}{a}_{n}\right)\xb7\left(\underset{n\to \infty}{\text{lim}}{b}_{n}\right)=A\xb7B$
- $\underset{n\to \infty}{\text{lim}}\left(\frac{{a}_{n}}{{b}_{n}}\right)=\frac{\underset{n\to \infty}{\text{lim}}{a}_{n}}{\underset{n\to \infty}{\text{lim}}{b}_{n}}=\frac{A}{B},$ provided $B\ne 0$ and each ${b}_{n}\ne 0.$

#### Proof

We prove part iii.

Let $\u03f5>0.$ Since $\underset{n\to \infty}{\text{lim}}{a}_{n}=A,$ there exists a constant positive integer ${N}_{1}$ such that $|{a}_{n}-A|<\frac{\epsilon}{2}$ for all $n\ge {N}_{1}.$ Since $\underset{n\to \infty}{\text{lim}}{b}_{n}=B,$ there exists a constant ${N}_{2}$ such that $|{b}_{n}-B|<\epsilon \text{/}2$ for all $n\ge {N}_{2}.$ Let $N$ be the larger of ${N}_{1}$ and ${N}_{2}.$ Therefore, for all $n\ge N,$

$|({a}_{n}+{b}_{n})\text{\u2212}(A+B)|\le |{a}_{n}-A|+|{b}_{n}-B|<\frac{\epsilon}{2}+\frac{\epsilon}{2}=\epsilon .$

□

The algebraic limit laws allow us to evaluate limits for many sequences. For example, consider the sequence $\left\{\frac{1}{{n}^{2}}\right\}.$ As shown earlier, $\underset{n\to \infty}{\text{lim}}1\text{/}n=0.$ Similarly, for any positive integer $k,$ we can conclude that

In the next example, we make use of this fact along with the limit laws to evaluate limits for other sequences.

### Example 5.3

#### Determining Convergence and Finding Limits

For each of the following sequences, determine whether or not the sequence converges. If it converges, find its limit.

- $\left\{5-\frac{3}{{n}^{2}}\right\}$
- $\left\{\frac{3{n}^{4}-7{n}^{2}+5}{6-4{n}^{4}}\right\}$
- $\left\{\frac{{2}^{n}}{{n}^{2}}\right\}$
- $\left\{{\left(1+\frac{4}{n}\right)}^{n}\right\}$

#### Solution

- We know that $1\text{/}n\to 0.$ Using this fact, we conclude that

$$\underset{n\to \infty}{\text{lim}}\frac{1}{{n}^{2}}=\underset{n\to \infty}{\text{lim}}\left(\frac{1}{n}\right).\underset{n\to \infty}{\text{lim}}\left(\frac{1}{n}\right)=0.$$

Therefore,

$$\underset{n\to \infty}{\text{lim}}\left(5-\frac{3}{{n}^{2}}\right)=\underset{n\to \infty}{\text{lim}}5-3\underset{n\to \infty}{\text{lim}}\frac{1}{{n}^{2}}=5-3.0=5.$$

The sequence converges and its limit is $5.$ - By factoring ${n}^{4}$ out of the numerator and denominator and using the limit laws above, we have

$$\begin{array}{cc}\hfill \underset{n\to \infty}{\text{lim}}\frac{3{n}^{4}-7{n}^{2}+5}{6-4{n}^{4}}& =\underset{n\to \infty}{\text{lim}}\frac{3-\frac{7}{{n}^{2}}+\frac{5}{{n}^{4}}}{\frac{6}{{n}^{4}}-4}\hfill \\ & =\frac{\underset{n\to \infty}{\text{lim}}\left(3-\frac{7}{{n}^{2}}+\frac{5}{{n}^{4}}\right)}{\underset{n\to \infty}{\text{lim}}\left(\frac{6}{{n}^{4}}-4\right)}\hfill \\ & =\frac{\left(\underset{n\to \infty}{\text{lim}}(3)\text{\u2212}\underset{n\to \infty}{\text{lim}}\frac{7}{{n}^{2}}+\underset{n\to \infty}{\text{lim}}\frac{5}{{n}^{4}}\right)}{\left(\underset{n\to \infty}{\text{lim}}\frac{6}{{n}^{4}}-\underset{n\to \infty}{\text{lim}}(4)\right)}\hfill \\ & =\frac{\left(\underset{n\to \infty}{\text{lim}}(3)\text{\u2212}7\xb7\underset{n\to \infty}{\text{lim}}\frac{1}{{n}^{2}}+5\xb7\underset{n\to \infty}{\text{lim}}\frac{1}{{n}^{4}}\right)}{\left(6\xb7\underset{n\to \infty}{\text{lim}}\frac{1}{{n}^{4}}-\underset{n\to \infty}{\text{lim}}(4)\right)}\hfill \\ & =\frac{3-7\xb70+5\xb70}{6\xb70-4}=-\frac{3}{4}.\hfill \end{array}$$

The sequence converges and its limit is $\mathrm{-3}\text{/}4.$ - Consider the related function $f\left(x\right)={2}^{x}\text{/}{x}^{2}$ defined on all real numbers $x>0.$ Since ${2}^{x}\to \infty $ and ${x}^{2}\to \infty $ as $x\to \infty ,$ apply L’Hôpital’s rule and write

$$\begin{array}{ccccc}\underset{x\to \infty}{\text{lim}}\frac{{2}^{x}}{{x}^{2}}\hfill & =\underset{x\to \infty}{\text{lim}}\frac{{2}^{x}\text{ln}\phantom{\rule{0.1em}{0ex}}2}{2x}\hfill & & & \text{Take the derivatives of the numerator and denominator.}\hfill \\ & =\underset{x\to \infty}{\text{lim}}\frac{{2}^{x}{\left(\text{ln}\phantom{\rule{0.1em}{0ex}}2\right)}^{2}}{2}\hfill & & & \text{Take the derivatives again.}\hfill \\ & =\infty .\hfill & & & \end{array}$$

We conclude that the sequence diverges. - Consider the function $f\left(x\right)={\left(1+\frac{4}{x}\right)}^{x}$ defined on all real numbers $x>0.$ This function has the indeterminate form ${1}^{\infty}$ as $x\to \infty .$ Let

$$y=\underset{x\to \infty}{\text{lim}}{\left(1+\frac{4}{x}\right)}^{x}.$$

Now taking the natural logarithm of both sides of the equation, we obtain

$$\text{ln}\left(y\right)=\text{ln}\left[\underset{x\to \infty}{\text{lim}}{\left(1+\frac{4}{x}\right)}^{x}\right].$$

Since the function $f\left(x\right)=\text{ln}\phantom{\rule{0.1em}{0ex}}x$ is continuous on its domain, we can interchange the limit and the natural logarithm. Therefore,

$$\text{ln}\left(y\right)=\underset{x\to \infty}{\text{lim}}\left[\text{ln}{\left(1+\frac{4}{x}\right)}^{x}\right].$$

Using properties of logarithms, we write

$$\underset{x\to \infty}{\text{lim}}\left[\text{ln}{\left(1+\frac{4}{x}\right)}^{x}\right]=\underset{x\to \infty}{\text{lim}}x\phantom{\rule{0.1em}{0ex}}\text{ln}\left(1+\frac{4}{x}\right).$$

Since the right-hand side of this equation has the indeterminate form $\infty \xb70,$ rewrite it as a fraction to apply L’Hôpital’s rule. Write

$$\underset{x\to \infty}{\text{lim}}x\phantom{\rule{0.1em}{0ex}}\text{ln}\left(1+\frac{4}{x}\right)=\underset{x\to \infty}{\text{lim}}\frac{\text{ln}\left(1+4\text{/}x\right)}{1\text{/}x}.$$

Since the right-hand side is now in the indeterminate form $0\text{/}0,$ we are able to apply L’Hôpital’s rule. We conclude that

$$\underset{x\to \infty}{\text{lim}}\frac{\text{ln}\left(1+4\text{/}x\right)}{1\text{/}x}=\underset{x\to \infty}{\text{lim}}\frac{4}{1+4\text{/}x}=4.$$

Therefore, $\text{ln}\left(y\right)=4$ and $y={e}^{4}.$ Therefore, since $\underset{x\to \infty}{\text{lim}}{\left(1+\frac{4}{x}\right)}^{x}={e}^{4},$ we can conclude that the sequence $\left\{{\left(1+\frac{4}{n}\right)}^{n}\right\}$ converges to ${e}^{4}.$

### Checkpoint 5.3

Consider the sequence $\left\{\left(5{n}^{2}+1\right)\text{/}{e}^{n}\right\}.$ Determine whether or not the sequence converges. If it converges, find its limit.

Recall that if $f$ is a continuous function at a value $L,$ then $f\left(x\right)\to f(L)$ as $x\to L.$ This idea applies to sequences as well. Suppose a sequence ${a}_{n}\to L,$ and a function $f$ is continuous at $L.$ Then $f\left({a}_{n}\right)\to f\left(L\right).$ This property often enables us to find limits for complicated sequences. For example, consider the sequence $\sqrt{5-\frac{3}{{n}^{2}}}.$ From Example 5.3a. we know the sequence $5-\frac{3}{{n}^{2}}\to 5.$ Since $\sqrt{x}$ is a continuous function at $x=5,$

### Theorem 5.3

#### Continuous Functions Defined on Convergent Sequences

Consider a sequence $\left\{{a}_{n}\right\}$ and suppose there exists a real number $L$ such that the sequence $\left\{{a}_{n}\right\}$ converges to $L.$ Suppose $f$ is a continuous function at $L.$ Then there exists an integer $N$ such that $f$ is defined at all values ${a}_{n}$ for $n\ge N,$ and the sequence $\left\{f\left({a}_{n}\right)\right\}$ converges to $f\left(L\right)$ (Figure 5.5).

#### Proof

Let $\u03f5>0.$ Since $f$ is continuous at $L,$ there exists $\delta >0$ such that $\left|f\left(x\right)-f\left(L\right)\right|<\epsilon $ if $\left|x-L\right|<\delta .$ Since the sequence $\left\{{a}_{n}\right\}$ converges to $L,$ there exists $N$ such that $\left|{a}_{n}-L\right|<\delta $ for all $n\ge N.$ Therefore, for all $n\ge N,$ $\left|{a}_{n}-L\right|<\delta ,$ which implies $\left|f({a}_{n})\text{\u2212}f(L)\right|<\epsilon .$ We conclude that the sequence $\left\{f\left({a}_{n}\right)\right\}$ converges to $f\left(L\right).$

□

### Example 5.4

#### Limits Involving Continuous Functions Defined on Convergent Sequences

Determine whether the sequence $\left\{\text{cos}\left(3\text{/}{n}^{2}\right)\right\}$ converges. If it converges, find its limit.

#### Solution

Since the sequence $\left\{3\text{/}{n}^{2}\right\}$ converges to $0$ and $\text{cos}\phantom{\rule{0.1em}{0ex}}x$ is continuous at $x=0,$ we can conclude that the sequence $\left\{\text{cos}\left(3\text{/}{n}^{2}\right)\right\}$ converges and

### Checkpoint 5.4

Determine if the sequence $\left\{\sqrt{\frac{2n+1}{3n+5}}\right\}$ converges. If it converges, find its limit.

Another theorem involving limits of sequences is an extension of the Squeeze Theorem for limits discussed in Introduction to Limits.

### Theorem 5.4

#### Squeeze Theorem for Sequences

Consider sequences $\left\{{a}_{n}\right\},$ $\left\{{b}_{n}\right\},$ and $\left\{{c}_{n}\right\}.$ Suppose there exists an integer $N$ such that

If there exists a real number $L$ such that

then $\left\{{b}_{n}\right\}$ converges and $\underset{n\to \infty}{\text{lim}}{b}_{n}=L$ (Figure 5.6).

#### Proof

Let $\epsilon >0.$ Since the sequence $\left\{{a}_{n}\right\}$ converges to $L,$ there exists an integer ${N}_{1}$ such that $\left|{a}_{n}-L\right|<\epsilon $ for all $n\ge {N}_{1}.$ Similarly, since $\left\{{c}_{n}\right\}$ converges to $L,$ there exists an integer ${N}_{2}$ such that $\left|{c}_{n}-L\right|<\epsilon $ for all $n\ge {N}_{2}.$ By assumption, there exists an integer $N$ such that ${a}_{n}\le {b}_{n}\le {c}_{n}$ for all $n\ge N.$ Let $M$ be the largest of ${N}_{1},{N}_{2},$ and $N.$ We must show that $|{b}_{n}-L|<\epsilon $ for all $n\ge M.$ For all $n\ge M,$

Therefore, $\text{\u2212}\epsilon <{b}_{n}-L<\epsilon ,$ and we conclude that $\left|{b}_{n}-L\right|<\epsilon $ for all $n\ge M,$ and we conclude that the sequence $\left\{{b}_{n}\right\}$ converges to $L.$

□

### Example 5.5

#### Using the Squeeze Theorem

Use the Squeeze Theorem to find the limit of each of the following sequences.

- $\left\{\frac{\text{cos}\phantom{\rule{0.1em}{0ex}}n}{{n}^{2}}\right\}$
- $\left\{{\left(-\frac{1}{2}\right)}^{n}\right\}$

#### Solution

- Since $\mathrm{-1}\le \text{cos}\phantom{\rule{0.1em}{0ex}}n\le 1$ for all integers $n,$ we have

$$-\frac{1}{{n}^{2}}\le \frac{\text{cos}\phantom{\rule{0.1em}{0ex}}n}{{n}^{2}}\le \frac{1}{{n}^{2}}.$$

Since $\mathrm{-1}\text{/}{n}^{2}\to 0$ and $1\text{/}{n}^{2}\to 0,$ we conclude that $\text{cos}\phantom{\rule{0.1em}{0ex}}n\text{/}{n}^{2}\to 0$ as well. - Since

$$-\frac{1}{{2}^{n}}\le {\left(-\frac{1}{2}\right)}^{n}\le \frac{1}{{2}^{n}}$$

for all positive integers $n,$ $\mathrm{-1}\text{/}{2}^{n}\to 0$ and $1\text{/}{2}^{n}\to 0,$ we can conclude that ${(\mathrm{-1}\text{/}2)}^{n}\to 0.$

### Checkpoint 5.5

Find $\underset{n\to \infty}{\text{lim}}\frac{2n-\text{sin}\phantom{\rule{0.1em}{0ex}}n}{n}.$

Using the idea from Example 5.5b. we conclude that ${r}^{n}\to 0$ for any real number $r$ such that $\mathrm{-1}<r<0.$ If $r<\text{\u2212}1,$ the sequence $\left\{{r}^{n}\right\}$ diverges because the terms oscillate and become arbitrarily large in magnitude. If $r=\mathrm{-1},$ the sequence $\left\{{r}^{n}\right\}=\left\{{\left(\mathrm{-1}\right)}^{n}\right\}$ diverges, as discussed earlier. Here is a summary of the properties for geometric sequences.

### Bounded Sequences

We now turn our attention to one of the most important theorems involving sequences: the Monotone Convergence Theorem. Before stating the theorem, we need to introduce some terminology and motivation. We begin by defining what it means for a sequence to be bounded.

### Definition

A sequence $\left\{{a}_{n}\right\}$ is bounded above if there exists a real number $M$ such that

for all positive integers $n.$

A sequence $\left\{{a}_{n}\right\}$ is bounded below if there exists a real number $M$ such that

for all positive integers $n.$

A sequence $\left\{{a}_{n}\right\}$ is a bounded sequence if it is bounded above and bounded below.

If a sequence is not bounded, it is an unbounded sequence.

For example, the sequence $\left\{1\text{/}n\right\}$ is bounded above because $1\text{/}n\le 1$ for all positive integers $n.$ It is also bounded below because $1\text{/}n\ge 0$ for all positive integers *n.* Therefore, $\left\{1\text{/}n\right\}$ is a bounded sequence. On the other hand, consider the sequence $\left\{{2}^{n}\right\}.$ Because ${2}^{n}\ge 2$ for all $n\ge 1,$ the sequence is bounded below. However, the sequence is not bounded above. Therefore, $\left\{{2}^{n}\right\}$ is an unbounded sequence.

We now discuss the relationship between boundedness and convergence. Suppose a sequence $\left\{{a}_{n}\right\}$ is unbounded. Then it is not bounded above, or not bounded below, or both. In either case, there are terms ${a}_{n}$ that are arbitrarily large in magnitude as $n$ gets larger. As a result, the sequence $\left\{{a}_{n}\right\}$ cannot converge. Therefore, being bounded is a necessary condition for a sequence to converge.

#### Convergent Sequences Are Bounded

If a sequence $\left\{{a}_{n}\right\}$ converges, then it is bounded.

Note that a sequence being bounded is not a sufficient condition for a sequence to converge. For example, the sequence $\left\{{\left(\mathrm{-1}\right)}^{n}\right\}$ is bounded, but the sequence diverges because the sequence oscillates between $1$ and $\mathrm{-1}$ and never approaches a finite number. We now discuss a sufficient (but not necessary) condition for a bounded sequence to converge.

Consider a bounded sequence $\left\{{a}_{n}\right\}.$ Suppose the sequence $\left\{{a}_{n}\right\}$ is increasing. That is, ${a}_{1}\le {a}_{2}\le {a}_{3}\text{\u2026}.$ Since the sequence is increasing, the terms are not oscillating. Therefore, there are two possibilities. The sequence could diverge to infinity, or it could converge. However, since the sequence is bounded, it is bounded above and the sequence cannot diverge to infinity. We conclude that $\left\{{a}_{n}\right\}$ converges. For example, consider the sequence

Since this sequence is increasing and bounded above, it converges. Next, consider the sequence

Even though the sequence is not increasing for all values of $n,$ we see that $\mathrm{-1}\text{/}2<\text{\u2212}1\text{/}3<\text{\u2212}1\text{/}4<\text{\cdots}.$ Therefore, starting with the eighth term, ${a}_{8}=\mathrm{-1}\text{/}2,$ the sequence is increasing. In this case, we say the sequence is *eventually* increasing. Since the sequence is bounded above, it converges. It is also true that if a sequence is decreasing (or eventually decreasing) and bounded below, it also converges.

### Definition

A sequence $\left\{{a}_{n}\right\}$ is increasing for all $n\ge {n}_{0}$ if

A sequence $\left\{{a}_{n}\right\}$ is decreasing for all $n\ge {n}_{0}$ if

A sequence $\left\{{a}_{n}\right\}$ is a monotone sequence for all $n\ge {n}_{0}$ if it is increasing for all $n\ge {n}_{0}$ or decreasing for all $n\ge {n}_{0}.$

We now have the necessary definitions to state the Monotone Convergence Theorem, which gives a sufficient condition for convergence of a sequence.

#### Monotone Convergence Theorem

If $\left\{{a}_{n}\right\}$ is a bounded sequence and there exists a positive integer ${n}_{0}$ such that $\left\{{a}_{n}\right\}$ is monotone for all $n\ge {n}_{0},$ then $\left\{{a}_{n}\right\}$ converges.

The proof of this theorem is beyond the scope of this text. Instead, we provide a graph to show intuitively why this theorem makes sense (Figure 5.7).

In the following example, we show how the Monotone Convergence Theorem can be used to prove convergence of a sequence.

### Example 5.6

#### Using the Monotone Convergence Theorem

For each of the following sequences, use the Monotone Convergence Theorem to show the sequence converges and find its limit.

- $\left\{\frac{{4}^{n}}{n\text{!}}\right\}$
- $\left\{{a}_{n}\right\}$ defined recursively such that

$${a}_{1}=2\phantom{\rule{0.2em}{0ex}}\text{and}\phantom{\rule{0.2em}{0ex}}{a}_{n+1}=\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\phantom{\rule{0.2em}{0ex}}\text{for all}\phantom{\rule{0.2em}{0ex}}n\ge 2.$$

#### Solution

- Writing out the first few terms, we see that

$$\left\{\frac{{4}^{n}}{n\text{!}}\right\}=\left\{4,8,\frac{32}{3},\frac{32}{3},\frac{128}{15}\text{,\u2026}\right\}.$$

At first, the terms increase. However, after the third term, the terms decrease. In fact, the terms decrease for all $n\ge 3.$ We can show this as follows.

$${a}_{n+1}=\frac{{4}^{n+1}}{\left(n+1\right)\text{!}}=\frac{4}{n+1}\xb7\frac{{4}^{n}}{n\text{!}}=\frac{4}{n+1}\xb7{a}_{n}\le {a}_{n}\phantom{\rule{0.2em}{0ex}}if\phantom{\rule{0.2em}{0ex}}n\ge 3.$$

Therefore, the sequence is decreasing for all $n\ge 3.$ Further, the sequence is bounded below by $0$ because ${4}^{n}\text{/}n\text{!}\ge 0$ for all positive integers $n.$ Therefore, by the Monotone Convergence Theorem, the sequence converges.

To find the limit, we use the fact that the sequence converges and let $L=\underset{n\to \infty}{\text{lim}}{a}_{n}.$ Now note this important observation. Consider $\underset{n\to \infty}{\text{lim}}{a}_{n+1}.$ Since

$$\left\{{a}_{n+1}\right\}=\left\{{a}_{2,}{a}_{3},{a}_{4}\text{,\u2026}\right\},$$the only difference between the sequences $\left\{{a}_{n+1}\right\}$ and $\left\{{a}_{n}\right\}$ is that $\left\{{a}_{n+1}\right\}$ omits the first term. Since a finite number of terms does not affect the convergence of a sequence,

$$\underset{n\to \infty}{\text{lim}}{a}_{n+1}=\underset{n\to \infty}{\text{lim}}{a}_{n}=L.$$

Combining this fact with the equation

$${a}_{n+1}=\frac{4}{n+1}{a}_{n}$$

and taking the limit of both sides of the equation

$$\underset{n\to \infty}{\text{lim}}{a}_{n+1}=\underset{n\to \infty}{\text{lim}}\frac{4}{n+1}{a}_{n},$$

we can conclude that

$$L=0\xb7L=0.$$ - Writing out the first several terms,

$$\left\{2,\frac{5}{4},\frac{41}{40},\frac{3281}{3280}\text{,\u2026}\right\}.$$

we can conjecture that the sequence is decreasing and bounded below by $1.$ To show that the sequence is bounded below by $1,$ we can show that

$$\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\ge 1.$$

To show this, first rewrite

$$\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}=\frac{{a}_{n}^{2}+1}{2{a}_{n}}.$$

Since ${a}_{1}>0$ and ${a}_{2}$ is defined as a sum of positive terms, ${a}_{2}>0.$ Similarly, all terms ${a}_{n}>0.$ Therefore,

$$\frac{{a}_{n}^{2}+1}{2{a}_{n}}\ge 1$$

if and only if

$${a}_{n}^{2}+1\ge 2{a}_{n}.$$

Rewriting the inequality ${a}_{n}^{2}+1\ge 2{a}_{n}$ as ${a}_{n}^{2}-2{a}_{n}+1\ge 0,$ and using the fact that

$${a}_{n}^{2}-2{a}_{n}+1={({a}_{n}-1)}^{2}\ge 0$$

because the square of any real number is nonnegative, we can conclude that

$$\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\ge 1.$$

To show that the sequence is decreasing, we must show that ${a}_{n+1}\le {a}_{n}$ for all $n\ge 1.$ Since $1\le {a}_{n}^{2},$ it follows that

$${a}_{n}^{2}+1\le 2{a}_{n}^{2}.$$

Dividing both sides by $2{a}_{n},$ we obtain

$$\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\le {a}_{n}.$$

Using the definition of ${a}_{n+1},$ we conclude that

$${a}_{n+1}=\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\le {a}_{n}.$$

Since $\left\{{a}_{n}\right\}$ is bounded below and decreasing, by the Monotone Convergence Theorem, it converges.

To find the limit, let $L=\underset{n\to \infty}{\text{lim}}{a}_{n}.$ Then using the recurrence relation and the fact that $\underset{n\to \infty}{\text{lim}}{a}_{n}=\underset{n\to \infty}{\text{lim}}{a}_{n+1},$ we have

$$\underset{n\to \infty}{\text{lim}}{a}_{n+1}=\underset{n\to \infty}{\text{lim}}\left(\frac{{a}_{n}}{2}+\frac{1}{2{a}_{n}}\right),$$

and therefore

$$L=\frac{L}{2}+\frac{1}{2L}.$$

Multiplying both sides of this equation by $2L,$ we arrive at the equation

$$2{L}^{2}={L}^{2}+1.$$

Solving this equation for $L,$ we conclude that ${L}^{2}=1,$ which implies $L=\text{\xb1}1.$ Since all the terms are positive, the limit $L=1.$

Consider the sequence $\left\{{a}_{n}\right\}$ defined recursively such that ${a}_{1}=1,$ ${a}_{n}={a}_{n-1}\text{/}2.$ Use the Monotone Convergence Theorem to show that this sequence converges and find its limit.

### Student Project

#### Fibonacci Numbers

The Fibonacci numbers are defined recursively by the sequence $\left\{{F}_{n}\right\}$ where ${F}_{0}=0,$ ${F}_{1}=1$ and for $n\ge 2,$

Here we look at properties of the Fibonacci numbers.

- Write out the first twenty Fibonacci numbers.
- Find a closed formula for the Fibonacci sequence by using the following steps.
- Consider the recursively defined sequence $\left\{{x}_{n}\right\}$ where ${x}_{o}=c$ and ${x}_{n+1}=a{x}_{n}.$ Show that this sequence can be described by the closed formula ${x}_{n}=c{a}^{n}$ for all $n\ge 0.$
- Using the result from part a. as motivation, look for a solution of the equation

$${F}_{n}={F}_{n-1}+{F}_{n-2}$$

of the form ${F}_{n}=c{\lambda}^{n}.$ Determine what two values for $\lambda $ will allow ${F}_{n}$ to satisfy this equation. - Consider the two solutions from part b.: ${\lambda}_{1}$ and ${\lambda}_{2}.$ Let ${F}_{n}={c}_{1}{\lambda}_{1}{}^{n}+{c}_{2}{\lambda}_{2}{}^{n}.$ Use the initial conditions ${F}_{0}$ and ${F}_{1}$ to determine the values for the constants ${c}_{1}$ and ${c}_{2}$ and write the closed formula ${F}_{n}.$

- Use the answer in 2 c. to show that

$$\underset{n\to \infty}{\text{lim}}\frac{{F}_{n+1}}{{F}_{n}}=\frac{1+\sqrt{5}}{2}.$$

The number $\varphi =\left(1+\sqrt{5}\right)\text{/}2$ is known as the golden ratio (Figure 5.8 and Figure 5.9).

### Section 5.1 Exercises

Find the first six terms of each of the following sequences, starting with $n=1.$

${a}_{n}={n}^{2}-1$ for $n\ge 1$

${a}_{1}=1,$ ${a}_{2}=1$ and ${a}_{n+2}={a}_{n}+{a}_{n+1}$ for $n\ge 1$

Find a formula ${a}_{n}$ for the $n\text{th}$ term of the arithmetic sequence whose first term is ${a}_{1}=1$ such that ${a}_{n-1}-{a}_{n}=17$ for $n\ge 1.$

Find a formula ${a}_{n}$ for the $n\text{th}$ term of the arithmetic sequence whose first term is ${a}_{1}=\mathrm{-3}$ such that ${a}_{n-1}-{a}_{n}=4$ for $n\ge 1.$

Find a formula ${a}_{n}$ for the $n\text{th}$ term of the geometric sequence whose first term is ${a}_{1}=1$ such that $\frac{{a}_{n+1}}{{a}_{n}}=10$ for $n\ge 1.$

Find a formula ${a}_{n}$ for the $n\text{th}$ term of the geometric sequence whose first term is ${a}_{1}=3$ such that $\frac{{a}_{n+1}}{{a}_{n}}=1\text{/}10$ for $n\ge 1.$

Find an explicit formula for the $n\text{th}$ term of the sequence whose first several terms are $\left\{0,3,8,15,24,35,48,63,80,99\text{,\u2026}\right\}.$ (*Hint:* First add one to each term.)

Find an explicit formula for the $n\text{th}$ term of the sequence satisfying ${a}_{1}=0$ and ${a}_{n}=2{a}_{n-1}+1$ for $n\ge 2.$

Find a formula for the general term ${a}_{n}$ of each of the following sequences.

$\left\{1,0,\mathrm{-1},0,1,0,\mathrm{-1},0\text{,\u2026}\right\}$ (*Hint:* Find where $\text{sin}\phantom{\rule{0.1em}{0ex}}x$ takes these values)

Find a function $f\left(n\right)$ that identifies the $n\text{th}$ term ${a}_{n}$ of the following recursively defined sequences, as ${a}_{n}=f\left(n\right).$

${a}_{1}=1$ and ${a}_{n+1}=\text{\u2212}{a}_{n}$ for $n\ge 1$

${a}_{1}=1$ and ${a}_{n+1}=\left(n+1\right){a}_{n}$ for $n\ge 1$

${a}_{1}=1$ and ${a}_{n+1}={a}_{n}\text{/}{2}^{n}$ for $n\ge 1$

Plot the first $N$ terms of each sequence. State whether the graphical evidence suggests that the sequence converges or diverges.

**[T]** ${a}_{1}=1,$ ${a}_{2}=2,$ and for $n\ge 2,$ ${a}_{n}=\frac{1}{2}\left({a}_{n-1}+{a}_{n-2}\right);$ $N=30$

**[T]** ${a}_{1}=1,$ ${a}_{2}=2,$ ${a}_{3}=3$ and for $n\ge 4,$ ${a}_{n}=\frac{1}{3}\left({a}_{n-1}+{a}_{n-2}+{a}_{n-3}\right),$ $N=30$

**[T]** ${a}_{1}=1,$ ${a}_{2}=2,$ ${a}_{3}=3,$ and for $n\ge 4,$ ${a}_{n}=\sqrt{{a}_{n-1}{a}_{n-2}{a}_{n-3}};$ $N=30$

Suppose that $\underset{n\to \infty}{\text{lim}}{a}_{n}=1,$ $\underset{n\to \infty}{\text{lim}}{b}_{n}=\mathrm{-1},$ and $0<\text{\u2212}{b}_{n}<{a}_{n}$ for all $n.$ Evaluate each of the following limits, or state that the limit does not exist, or state that there is not enough information to determine whether the limit exists.

$\underset{n\to \infty}{\text{lim}}(\frac{1}{2}{b}_{n}-\frac{1}{2}{a}_{n})$

$\underset{n\to \infty}{\text{lim}}\frac{{a}_{n}-{b}_{n}}{{a}_{n}+{b}_{n}}$

Find the limit of each of the following sequences, using L’Hôpital’s rule when appropriate.

$\frac{{\left(n-1\right)}^{2}}{{\left(n+1\right)}^{2}}$

${n}^{1\text{/}n}$ (*Hint:* ${n}^{1\text{/}n}={e}^{\frac{1}{n}\phantom{\rule{0.1em}{0ex}}\text{ln}\phantom{\rule{0.2em}{0ex}}n})$

For each of the following sequences, whose $n\text{th}$ terms are indicated, state whether the sequence is bounded and whether it is eventually monotone, increasing, or decreasing.

$\text{ln}\left(1+\frac{1}{n}\right)$

$\text{cos}\left({n}^{2}\right)$

${n}^{\mathrm{-1}\text{/}n},$ $n\ge 3$

Determine whether the sequence defined as follows has a limit. If it does, find the limit.

${a}_{1}=\sqrt{2},$ ${a}_{2}=\sqrt{2\sqrt{2}},$ ${a}_{3}=\sqrt{2\sqrt{2\sqrt{2}}}$ etc.

Determine whether the sequence defined as follows has a limit. If it does, find the limit.

${a}_{1}=3,$ ${a}_{n}=\sqrt{2{a}_{n-1}},$ $n=2,3\text{,\u2026}.$

Use the Squeeze Theorem to find the limit of each of the following sequences.

$n\phantom{\rule{0.1em}{0ex}}\text{sin}\left(1\text{/}n\right)$

${a}_{n}=\frac{n\text{!}}{{n}^{n}}$

${a}_{n}=\text{sin}\phantom{\rule{0.1em}{0ex}}n\phantom{\rule{0.1em}{0ex}}\text{sin}\left(1\text{/}n\right)$

For the following sequences, plot the first $25$ terms of the sequence and state whether the graphical evidence suggests that the sequence converges or diverges.

**[T]** ${a}_{n}=\text{sin}\phantom{\rule{0.1em}{0ex}}n$

Determine the limit of the sequence or show that the sequence diverges. If it converges, find its limit.

${a}_{n}={\text{tan}}^{\mathrm{-1}}({n}^{2})$

${a}_{n}=\frac{\text{ln}({n}^{2})}{\text{ln}(2n)}$

${a}_{n}=\text{ln}\left(\frac{n+2}{{n}^{2}-3}\right)$

${a}_{n}=\frac{{(1000)}^{n}}{n\text{!}}$

Newton’s method seeks to approximate a solution $f\left(x\right)=0$ that starts with an initial approximation ${x}_{0}$ and successively defines a sequence ${x}_{n+1}={x}_{n}-\frac{f\left({x}_{n}\right)}{{f}^{\prime}\left({x}_{n}\right)}.$ For the given choice of $f$ and ${x}_{0},$ write out the formula for ${x}_{n+1}.$ If the sequence appears to converge, give an exact formula for the solution $x,$ then identify the limit $x$ accurate to four decimal places and the smallest $n$ such that ${x}_{n}$ agrees with $x$ up to four decimal places.

**[T]** $f\left(x\right)={x}^{2}-2,$ ${x}_{0}=1$

**[T]** $f\left(x\right)={e}^{x}-2,$ ${x}_{0}=1$

**[T]** Suppose you start with one liter of vinegar and repeatedly remove $0.1\phantom{\rule{0.2em}{0ex}}\text{L,}$ replace with water, mix, and repeat.

- Find a formula for the concentration after $n$ steps.
- After how many steps does the mixture contain less than $10\text{\%}$ vinegar?

**[T]** A lake initially contains $2000$ fish. Suppose that in the absence of predators or other causes of removal, the fish population increases by $6\text{\%}$ each month. However, factoring in all causes, $150$ fish are lost each month.

- Explain why the fish population after $n$ months is modeled by ${P}_{n}=1.06{P}_{n-1}-150$ with ${P}_{0}=2000.$
- How many fish will be in the pond after one year?

**[T]** A bank account earns $5\text{\%}$ interest compounded monthly. Suppose that $\text{\$}1000$ is initially deposited into the account, but that $\text{\$}10$ is withdrawn each month.

- Show that the amount in the account after $n$ months is ${A}_{n}=\left(1+.05\text{/}12\right){A}_{n-1}-10;$ ${A}_{0}=1000.$
- How much money will be in the account after $1$ year?
- Is the amount increasing or decreasing?
- Suppose that instead of $\text{\$}10,$ a fixed amount $d$ dollars is withdrawn each month. Find a value of $d$ such that the amount in the account after each month remains $\text{\$}1000.$
- What happens if $d$ is greater than this amount?

**[T]** A student takes out a college loan of $\text{\$}\mathrm{10,000}$ at an annual percentage rate of $6\text{\%},$ compounded monthly.

- If the student makes payments of $\text{\$}100$ per month, how much does the student owe after $12$ months?
- After how many months will the loan be paid off?

**[T]** Consider a series combining geometric growth and arithmetic decrease. Let ${a}_{1}=1.$ Fix $a>1$ and $0<b<a.$ Set ${a}_{n+1}=a.{a}_{n}-b.$ Find a formula for ${a}_{n+1}$ in terms of ${a}^{n},$ $a,$ and $b$ and a relationship between $a$ and $b$ such that ${a}_{n}$ converges.

**[T]** The binary representation $x=0.{b}_{1}{b}_{2}{b}_{3}...$ of a number $x$ between $0$ and $1$ can be defined as follows. Let ${b}_{1}=0$ if $x<1\text{/}2$ and ${b}_{1}=1$ if $1\text{/}2\le x<1.$ Let ${x}_{1}=2x-{b}_{1}.$ Let ${b}_{2}=0$ if ${x}_{1}<1\text{/}2$ and ${b}_{2}=1$ if $1\text{/}2\le x<1.$ Let ${x}_{2}=2{x}_{1}-{b}_{2}$ and in general, ${x}_{n}=2{x}_{n-1}-{b}_{n}$ and ${b}_{n-1}=0$ if ${x}_{n}<1\text{/}2$ and ${b}_{n-1}=1$ if $1\text{/}2\le {x}_{n}<1.$ Find the binary expansion of $1\text{/}3.$

**[T]** To find an approximation for $\pi ,$ set ${a}_{0}=\sqrt{2+1},$ ${a}_{1}=\sqrt{2+{a}_{0}},$ and, in general, ${a}_{n+1}=\sqrt{2+{a}_{n}}.$ Finally, set ${p}_{n}={3.2}^{n}\sqrt{2-{a}_{n}}.$ Find the first ten terms of ${p}_{n}$ and compare the values to $\pi .$

For the following two exercises, assume that you have access to a computer program or Internet source that can generate a list of zeros and ones of any desired length. Pseudorandom number generators (PRNGs) play an important role in simulating random noise in physical systems by creating sequences of zeros and ones that appear like the result of flipping a coin repeatedly. One of the simplest types of PRNGs recursively defines a random-looking sequence of $N$ integers ${a}_{1},{a}_{2}\text{,\u2026},{a}_{N}$ by fixing two special integers $K$ and $M$ and letting ${a}_{n+1}$ be the remainder after dividing $K.{a}_{n}$ into $M,$ then creates a bit sequence of zeros and ones whose $n\text{th}$ term ${b}_{n}$ is equal to one if ${a}_{n}$ is odd and equal to zero if ${a}_{n}$ is even. If the bits ${b}_{n}$ are pseudorandom, then the behavior of their average $\left({b}_{1}+{b}_{2}+\text{\cdots}+{b}_{N}\right)\text{/}N$ should be similar to behavior of averages of truly randomly generated bits.

**[T]** Starting with $K=\mathrm{16,807}$ and $M=\mathrm{2,147,483,647},$ using ten different starting values of ${a}_{1},$ compute sequences of bits ${b}_{n}$ up to $n=1000,$ and compare their averages to ten such sequences generated by a random bit generator.

**[T]** Find the first $1000$ digits of $\pi $ using either a computer program or Internet resource. Create a bit sequence ${b}_{n}$ by letting ${b}_{n}=1$ if the $n\text{th}$ digit of $\pi $ is odd and ${b}_{n}=0$ if the $n\text{th}$ digit of $\pi $ is even. Compute the average value of ${b}_{n}$ and the average value of ${d}_{n}=\left|{b}_{n+1}-{b}_{n}\right|,$ $n=1\text{,...},999.$ Does the sequence ${b}_{n}$ appear random? Do the differences between successive elements of ${b}_{n}$ appear random?