### Learning Objectives

- 5.2.1. Explain the meaning of the sum of an infinite series.
- 5.2.2. Calculate the sum of a geometric series.
- 5.2.3. Evaluate a telescoping series.

We have seen that a sequence is an ordered set of terms. If you add these terms together, you get a series. In this section we define an infinite series and show how series are related to sequences. We also define what it means for a series to converge or diverge. We introduce one of the most important types of series: the geometric series. We will use geometric series in the next chapter to write certain functions as polynomials with an infinite number of terms. This process is important because it allows us to evaluate, differentiate, and integrate complicated functions by using polynomials that are easier to handle. We also discuss the harmonic series, arguably the most interesting divergent series because it just fails to converge.

### Sums and Series

An infinite series is a sum of infinitely many terms and is written in the form

But what does this mean? We cannot add an infinite number of terms in the same way we can add a finite number of terms. Instead, the value of an infinite series is defined in terms of the *limit* of partial sums. A partial sum of an infinite series is a finite sum of the form

To see how we use partial sums to evaluate infinite series, consider the following example. Suppose oil is seeping into a lake such that $1000$ gallons enters the lake the first week. During the second week, an additional $500$ gallons of oil enters the lake. The third week, $250$ more gallons enters the lake. Assume this pattern continues such that each week half as much oil enters the lake as did the previous week. If this continues forever, what can we say about the amount of oil in the lake? Will the amount of oil continue to get arbitrarily large, or is it possible that it approaches some finite amount? To answer this question, we look at the amount of oil in the lake after $k$ weeks. Letting ${S}_{k}$ denote the amount of oil in the lake (measured in thousands of gallons) after $k$ weeks, we see that

Looking at this pattern, we see that the amount of oil in the lake (in thousands of gallons) after $k$ weeks is

We are interested in what happens as $k\to \infty .$ Symbolically, the amount of oil in the lake as $k\to \infty $ is given by the infinite series

At the same time, as $k\to \infty ,$ the amount of oil in the lake can be calculated by evaluating $\underset{k\to \infty}{\text{lim}}{S}_{k}.$ Therefore, the behavior of the infinite series can be determined by looking at the behavior of the sequence of partial sums $\left\{{S}_{k}\right\}.$ If the sequence of partial sums $\left\{{S}_{k}\right\}$ converges, we say that the infinite series converges, and its sum is given by $\underset{k\to \infty}{\text{lim}}{S}_{k}.$ If the sequence $\left\{{S}_{k}\right\}$ diverges, we say the infinite series diverges. We now turn our attention to determining the limit of this sequence $\left\{{S}_{k}\right\}.$

First, simplifying some of these partial sums, we see that

Plotting some of these values in Figure 5.10, it appears that the sequence $\left\{{S}_{k}\right\}$ could be approaching 2.

Let’s look for more convincing evidence. In the following table, we list the values of ${S}_{k}$ for several values of $k.$

$k$ | $5$ | $10$ | $15$ | $20$ |

${S}_{k}$ | $1.9375$ | $1.998$ | $1.999939$ | $1.999998$ |

These data supply more evidence suggesting that the sequence $\left\{{S}_{k}\right\}$ converges to $2.$ Later we will provide an analytic argument that can be used to prove that $\underset{k\to \infty}{\text{lim}}{S}_{k}=2.$ For now, we rely on the numerical and graphical data to convince ourselves that the sequence of partial sums does actually converge to $2.$ Since this sequence of partial sums converges to $2,$ we say the infinite series converges to $2$ and write

Returning to the question about the oil in the lake, since this infinite series converges to $2,$ we conclude that the amount of oil in the lake will get arbitrarily close to $2000$ gallons as the amount of time gets sufficiently large.

This series is an example of a geometric series. We discuss geometric series in more detail later in this section. First, we summarize what it means for an infinite series to converge.

### Definition

An infinite series is an expression of the form

For each positive integer $k,$ the sum

is called the $k\text{th}$ partial sum of the infinite series. The partial sums form a sequence $\left\{{S}_{k}\right\}.$ If the sequence of partial sums converges to a real number $S,$ the infinite series converges. If we can describe the convergence of a series to $S,$ we call $S$ the sum of the series, and we write

If the sequence of partial sums diverges, we have the divergence of a series.

### Media

This website shows a more whimsical approach to series.

Note that the index for a series need not begin with $n=1$ but can begin with any value. For example, the series

can also be written as

Often it is convenient for the index to begin at $1,$ so if for some reason it begins at a different value, we can reindex by making a change of variables. For example, consider the series

By introducing the variable $m=n-1,$ so that $n=m+1,$ we can rewrite the series as

### Example 5.7

#### Evaluating Limits of Sequences of Partial Sums

For each of the following series, use the sequence of partial sums to determine whether the series converges or diverges.

- $\sum _{n=1}^{\infty}\frac{n}{n+1}$
- $\sum _{n=1}^{\infty}{(\mathrm{-1})}^{n}$
- $\sum _{n=1}^{\infty}\frac{1}{n(n+1)}$

Determine whether the series $\sum}_{n=1}^{\infty}(n+1)\text{/}n$ converges or diverges.

#### The Harmonic Series

A useful series to know about is the harmonic series. The harmonic series is defined as

This series is interesting because it diverges, but it diverges very slowly. By this we mean that the terms in the sequence of partial sums $\left\{{S}_{k}\right\}$ approach infinity, but do so very slowly. We will show that the series diverges, but first we illustrate the slow growth of the terms in the sequence $\left\{{S}_{k}\right\}$ in the following table.

$k$ | $10$ | $100$ | $1000$ | $\mathrm{10,000}$ | $\mathrm{100,000}$ | $\mathrm{1,000,000}$ |

${S}_{k}$ | $2.92897$ | $5.18738$ | $7.48547$ | $9.78761$ | $12.09015$ | $14.39273$ |

Even after $\mathrm{1,000,000}$ terms, the partial sum is still relatively small. From this table, it is not clear that this series actually diverges. However, we can show analytically that the sequence of partial sums diverges, and therefore the series diverges.

To show that the sequence of partial sums diverges, we show that the sequence of partial sums is unbounded. We begin by writing the first several partial sums:

Notice that for the last two terms in ${S}_{4},$

Therefore, we conclude that

Using the same idea for ${S}_{8},$ we see that

From this pattern, we see that ${S}_{1}=1,$ ${S}_{2}=1+1\text{/}2,$ ${S}_{4}>1+2\left(1\text{/}2\right),$ and ${S}_{8}>1+3\left(1\text{/}2\right).$ More generally, it can be shown that ${S}_{{2}^{j}}>1+j(1\text{/}2)$ for all $j>1.$ Since $1+j(1\text{/}2)\to \infty ,$ we conclude that the sequence $\left\{{S}_{k}\right\}$ is unbounded and therefore diverges. In the previous section, we stated that convergent sequences are bounded. Consequently, since $\left\{{S}_{k}\right\}$ is unbounded, it diverges. Thus, the harmonic series diverges.

#### Algebraic Properties of Convergent Series

Since the sum of a convergent infinite series is defined as a limit of a sequence, the algebraic properties for series listed below follow directly from the algebraic properties for sequences.

### Theorem 5.7

#### Algebraic Properties of Convergent Series

Let $\sum}_{n=1}^{\infty}{a}_{n$ and $\sum}_{n=1}^{\infty}{b}_{n$ be convergent series. Then the following algebraic properties hold.

- The series $\sum _{n=1}^{\infty}({a}_{n}+{b}_{n})$ converges and $\sum}_{n=1}^{\infty}\left({a}_{n}+{b}_{n}\right)={\displaystyle \sum}_{n=1}^{\infty}{a}_{n}+{\displaystyle \sum}_{n=1}^{\infty}{b}_{n}.$ (Sum Rule)
- The series $\sum _{n=1}^{\infty}({a}_{n}-{b}_{n})$ converges and $\sum}_{n=1}^{\infty}\left({a}_{n}-{b}_{n}\right)={\displaystyle \sum}_{n=1}^{\infty}{a}_{n}-{\displaystyle \sum}_{n=1}^{\infty}{b}_{n}.$ (Difference Rule)
- For any real number $c,$ the series $\sum _{n=1}^{\infty}c}{a}_{n$ converges and $\sum}_{n=1}^{\infty}c{a}_{n}=c{\displaystyle \sum}_{n=1}^{\infty}{a}_{n}.$ (Constant Multiple Rule)

### Example 5.8

#### Using Algebraic Properties of Convergent Series

Evaluate

### Checkpoint 5.8

Evaluate $\sum}_{n=1}^{\infty}\frac{5}{{2}^{n-1}}.$

#### Geometric Series

A geometric series is any series that we can write in the form

Because the ratio of each term in this series to the previous term is *r*, the number *r* is called the ratio. We refer to *a* as the initial term because it is the first term in the series. For example, the series

is a geometric series with initial term $a=1$ and ratio $r=1\text{/}2.$

In general, when does a geometric series converge? Consider the geometric series

when $a>0.$ Its sequence of partial sums $\left\{{S}_{k}\right\}$ is given by

Consider the case when $r=1.$ In that case,

Since $a>0,$ we know $ak\to \infty $ as $k\to \infty .$ Therefore, the sequence of partial sums is unbounded and thus diverges. Consequently, the infinite series diverges for $r=1.$ For $r\ne 1,$ to find the limit of $\left\{{S}_{k}\right\},$ multiply Equation 5.6 by $1-r.$ Doing so, we see that

All the other terms cancel out.

Therefore,

From our discussion in the previous section, we know that the geometric sequence ${r}^{k}\to 0$ if $\left|r\right|<1$ and that ${r}^{k}$ diverges if $\left|r\right|>1$ or $r=\text{\xb1}1.$ Therefore, for $\left|r\right|<1,$ ${S}_{k}\to a\text{/}(1-r)$ and we have

If $\left|r\right|\ge 1,$ ${S}_{k}$ diverges, and therefore

### Definition

A geometric series is a series of the form

If $\left|r\right|<1,$ the series converges, and

If $\left|r\right|\ge 1,$ the series diverges.

Geometric series sometimes appear in slightly different forms. For example, sometimes the index begins at a value other than $n=1$ or the exponent involves a linear expression for $n$ other than $n-1.$ As long as we can rewrite the series in the form given by Equation 5.5, it is a geometric series. For example, consider the series

To see that this is a geometric series, we write out the first several terms:

We see that the initial term is $a=4\text{/}9$ and the ratio is $r=2\text{/}3.$ Therefore, the series can be written as

Since $r=2\text{/}3<1,$ this series converges, and its sum is given by

### Example 5.9

#### Determining Convergence or Divergence of a Geometric Series

Determine whether each of the following geometric series converges or diverges, and if it converges, find its sum.

- $\sum}_{n=1}^{\infty}\frac{{(\mathrm{-3})}^{n+1}}{{4}^{n-1}$
- $\sum}_{n=1}^{\infty}{e}^{2n$

### Checkpoint 5.9

Determine whether the series $\sum _{n=1}^{\infty}{\left(\frac{\mathrm{-2}}{5}\right)}^{n-1}$ converges or diverges. If it converges, find its sum.

We now turn our attention to a nice application of geometric series. We show how they can be used to write repeating decimals as fractions of integers.

### Example 5.10

#### Writing Repeating Decimals as Fractions of Integers

Use a geometric series to write $3.\stackrel{\text{\u2014}}{26}$ as a fraction of integers.

### Checkpoint 5.10

Write $5.2\stackrel{\text{\u2013}}{7}$ as a fraction of integers.

### Example 5.11

#### Chapter Opener: Finding the Area of the Koch Snowflake

Define a sequence of figures $\left\{{F}_{n}\right\}$ recursively as follows (Figure 5.11). Let ${F}_{0}$ be an equilateral triangle with sides of length $1.$ For $n\ge 1,$ let ${F}_{n}$ be the curve created by removing the middle third of each side of ${F}_{n-1}$ and replacing it with an equilateral triangle pointing outward. The limiting figure as $n\to \infty $ is known as Koch’s snowflake.

- Find the length ${L}_{n}$ of the perimeter of ${F}_{n}.$ Evaluate $\underset{n\to \infty}{\text{lim}}{L}_{n}$ to find the length of the perimeter of Koch’s snowflake.
- Find the area ${A}_{n}$ of figure ${F}_{n}.$ Evaluate $\underset{n\to \infty}{\text{lim}}{A}_{n}$ to find the area of Koch’s snowflake.

#### Analysis

The Koch snowflake is interesting because it has finite area, yet infinite perimeter. Although at first this may seem impossible, recall that you have seen similar examples earlier in the text. For example, consider the region bounded by the curve $y=1\text{/}{x}^{2}$ and the $x$-axis on the interval $[1,\infty ).$ Since the improper integral

converges, the area of this region is finite, even though the perimeter is infinite.

### Telescoping Series

Consider the series $\sum _{n=1}^{\infty}\frac{1}{n(n+1)}}.$ We discussed this series in Example 5.7, showing that the series converges by writing out the first several partial sums ${S}_{1},{S}_{2}\text{,\u2026},{S}_{6}$ and noticing that they are all of the form ${S}_{k}=\frac{k}{k+1}.$ Here we use a different technique to show that this series converges. By using partial fractions, we can write

Therefore, the series can be written as

Writing out the first several terms in the sequence of partial sums $\left\{{S}_{k}\right\},$ we see that

In general,

We notice that the middle terms cancel each other out, leaving only the first and last terms. In a sense, the series collapses like a spyglass with tubes that disappear into each other to shorten the telescope. For this reason, we call a series that has this property a telescoping series. For this series, since ${S}_{k}=1-1\text{/}(k+1)$ and $1\text{/}(k+1)\to 0$ as $k\to \infty ,$ the sequence of partial sums converges to $1,$ and therefore the series converges to $1.$

### Definition

A telescoping series is a series in which most of the terms cancel in each of the partial sums, leaving only some of the first terms and some of the last terms.

For example, any series of the form

is a telescoping series. We can see this by writing out some of the partial sums. In particular, we see that

In general, the *k*th partial sum of this series is

Since the *k*th partial sum can be simplified to the difference of these two terms, the sequence of partial sums $\left\{{S}_{k}\right\}$ will converge if and only if the sequence $\left\{{b}_{k+1}\right\}$ converges. Moreover, if the sequence ${b}_{k+1}$ converges to some finite number $B,$ then the sequence of partial sums converges to ${b}_{1}-B,$ and therefore

In the next example, we show how to use these ideas to analyze a telescoping series of this form.

### Example 5.12

#### Evaluating a Telescoping Series

Determine whether the telescoping series

converges or diverges. If it converges, find its sum.

Determine whether $\sum}_{n=1}^{\infty}\left[{e}^{1\text{/}n}-{e}^{1\text{/}(n+1)}\right]$ converges or diverges. If it converges, find its sum.

### Student Project

#### Euler’s Constant

We have shown that the harmonic series $\sum}_{n=1}^{\infty}\frac{1}{n$ diverges. Here we investigate the behavior of the partial sums ${S}_{k}$ as $k\to \infty .$ In particular, we show that they behave like the natural logarithm function by showing that there exists a constant $\gamma $ such that

This constant $\gamma $ is known as Euler’s constant.

- Let ${T}_{k}={\displaystyle \sum _{n=1}^{k}\frac{1}{n}-\text{ln}\phantom{\rule{0.1em}{0ex}}k}.$ Evaluate ${T}_{k}$ for various values of $k.$
- For ${T}_{k}$ as defined in part 1. show that the sequence $\left\{{T}_{k}\right\}$ converges by using the following steps.
- Show that the sequence $\left\{{T}_{k}\right\}$ is monotone decreasing. (
*Hint:*Show that $\text{ln}\left(1+1\text{/}k>1\text{/}\left(k+1\right)\right)$ - Show that the sequence $\left\{{T}_{k}\right\}$ is bounded below by zero. (
*Hint:*Express $\text{ln}\phantom{\rule{0.1em}{0ex}}k$ as a definite integral.) - Use the Monotone Convergence Theorem to conclude that the sequence $\left\{{T}_{k}\right\}$ converges. The limit $\gamma $ is Euler’s constant.

- Show that the sequence $\left\{{T}_{k}\right\}$ is monotone decreasing. (
- Now estimate how far ${T}_{k}$ is from $\gamma $ for a given integer $k.$ Prove that for $k\ge 1,$ $0<{T}_{k}-\gamma \le 1\text{/}k$ by using the following steps.
- Show that $\text{ln}\left(k+1\right)-\text{ln}\phantom{\rule{0.1em}{0ex}}k<1\text{/}k.$
- Use the result from part a. to show that for any integer $k,$

$${T}_{k}-{T}_{k+1}<\frac{1}{k}-\frac{1}{k+1}.$$ - For any integers $k$ and $j$ such that $j>k,$ express ${T}_{k}-{T}_{j}$ as a telescoping sum by writing

$${T}_{k}-{T}_{j}=\left({T}_{k}-{T}_{k+1}\right)+\left({T}_{k+1}-{T}_{k+2}\right)+\left({T}_{k+2}-{T}_{k+3}\right)+\text{\cdots}+\left({T}_{j-1}-{T}_{j}\right).$$

Use the result from part b. combined with this telescoping sum to conclude that

$${T}_{k}-{T}_{j}<\frac{1}{k}-\frac{1}{j}.$$ - Apply the limit to both sides of the inequality in part c. to conclude that

$${T}_{k}-\gamma \le \frac{1}{k}.$$ - Estimate $\gamma $ to an accuracy of within $0.001.$

### Section 5.2 Exercises

Using sigma notation, write the following expressions as infinite series.

$1-1+1-1+\text{\cdots}$

$\text{sin}\phantom{\rule{0.1em}{0ex}}1+\text{sin}\phantom{\rule{0.1em}{0ex}}1\text{/}2+\text{sin}\phantom{\rule{0.1em}{0ex}}1\text{/}3+\text{sin}\phantom{\rule{0.1em}{0ex}}1\text{/}4+\text{\cdots}$

Compute the first four partial sums ${S}_{1}\text{,\u2026},{S}_{4}$ for the series having $n\text{th}$ term ${a}_{n}$ starting with $n=1$ as follows.

${a}_{n}=1\text{/}n$

${a}_{n}={\left(\mathrm{-1}\right)}^{n}$

In the following exercises, compute the general term ${a}_{n}$ of the series with the given partial sum ${S}_{n}.$ If the sequence of partial sums converges, find its limit $S.$

${S}_{n}=\frac{n\left(n+1\right)}{2},$ $n\ge 1$

${S}_{n}=2-\left(n+2\right)\text{/}{2}^{n},n\ge 1$

For each of the following series, use the sequence of partial sums to determine whether the series converges or diverges.

$\sum _{n=1}^{\infty}\left(1-{\left(\mathrm{-1}\right)}^{n})\right)$

$\sum _{n=1}^{\infty}\frac{1}{\left(n+1\right)\left(n+2\right)}$ (*Hint:* Use a partial fraction decomposition like that for $\sum _{n=1}^{\infty}\frac{1}{n\left(n+1\right)}}.)$

$\sum _{n=1}^{\infty}\frac{1}{2n+1}$ (*Hint:* Follow the reasoning for $\sum _{n=1}^{\infty}\frac{1}{n}}.)$

Suppose that $\sum _{n=1}^{\infty}{a}_{n}=1},$ that $\sum _{n=1}^{\infty}{b}_{n}=\mathrm{-1}},$ that ${a}_{1}=2,$ and ${b}_{1}=\mathrm{-3}.$ Find the sum of the indicated series.

$\sum _{n=1}^{\infty}({a}_{n}-2{b}_{n})$

$\sum _{n=1}^{\infty}(3{a}_{n+1}-4{b}_{n+1})$

State whether the given series converges and explain why.

$\sum _{n=1}^{\infty}\frac{1}{n+{10}^{80}}$ (*Hint:* Rewrite using a change of index.)

$1+\frac{e}{\pi}+\frac{{e}^{2}}{{\pi}^{2}}+\frac{{e}^{3}}{{\pi}^{3}}+\text{\cdots}$

$1+\frac{\pi}{{e}^{2}}+\frac{{\pi}^{2}}{{e}^{4}}+\frac{{\pi}^{3}}{{e}^{6}}+\frac{{\pi}^{4}}{{e}^{8}}+\text{\cdots}$

$1-\sqrt{\frac{\pi}{3}}+\sqrt{\frac{{\pi}^{2}}{9}}-\sqrt{\frac{{\pi}^{3}}{27}}+\text{\cdots}$

For ${a}_{n}$ as follows, write the sum as a geometric series of the form $\sum _{n=1}^{\infty}a{r}^{n}}.$ State whether the series converges and if it does, find the value of $\sum {a}_{n}}.$

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

${a}_{1}=1\text{/}10$ and ${a}_{n}\text{/}{a}_{n+1}=\mathrm{-10}$ for $n\ge 1.$

Use the identity $\frac{1}{1-y}={\displaystyle \sum _{n=0}^{\infty}{y}^{n}}$ to express the function as a geometric series in the indicated term.

$\frac{\sqrt{x}}{1-{x}^{3\text{/}2}}$ in $\sqrt{x}$

${\text{sec}}^{2}x$ in $\text{sin}\phantom{\rule{0.1em}{0ex}}x$

Evaluate the following telescoping series or state whether the series diverges.

$\sum _{n=1}^{\infty}\frac{1}{{n}^{13}}}-\frac{1}{{\left(n+1\right)}^{13}$

$\sum _{n=1}^{\infty}\left(\text{sin}\phantom{\rule{0.1em}{0ex}}n-\text{sin}\left(n+1\right)\right)$

Express the following series as a telescoping sum and evaluate its *n*th partial sum.

$\sum _{n=1}^{\infty}\frac{2n+1}{{\left({n}^{2}+n\right)}^{2}}$ (*Hint:* Factor denominator and use partial fractions.)

$\sum _{n=2}^{\infty}\frac{\text{ln}\left(1{+}_{n}^{1}\right)}{\text{ln}\phantom{\rule{0.1em}{0ex}}n\phantom{\rule{0.1em}{0ex}}\text{ln}\left(n+1\right)}$

$\sum _{n=1}^{\infty}\frac{\left(n+2\right)}{n\left(n+1\right){2}^{n+1}}$ (*Hint:* Look at $1\text{/}\left(n{2}^{n}\right).)$

A general telescoping series is one in which all but the first few terms cancel out after summing a given number of successive terms.

Let ${a}_{n}=f\left(n\right)-2f\left(n+1\right)+f\left(n+2\right),$ in which $f\left(n\right)\to 0$ as $n\to \infty .$ Find $\sum _{n=1}^{\infty}{a}_{n}}.$

${a}_{n}=f\left(n\right)-f\left(n+1\right)-f\left(n+2\right)+f\left(n+3\right),$ in which $f\left(n\right)\to 0$ as $n\to \infty .$ Find $\sum _{n=1}^{\infty}{a}_{n}}.$

Suppose that ${a}_{n}={c}_{0}f\left(n\right)+{c}_{1}f\left(n+1\right)+{c}_{2}f\left(n+2\right)+{c}_{3}f\left(n+3\right)+{c}_{4}f\left(n+4\right),$ where $f\left(n\right)\to 0$ as $n\to \infty .$ Find a condition on the coefficients ${c}_{0}\text{,\u2026},{c}_{4}$ that make this a general telescoping series.

Evaluate $\sum _{n=1}^{\infty}\frac{1}{n\left(n+1\right)\left(n+2\right)}$ (*Hint:* $\frac{1}{n\left(n+1\right)\left(n+2\right)}=\frac{1}{2n}-\frac{1}{n+1}+\frac{1}{2\left(n+2\right)})$

Find a formula for $\sum _{n=1}^{\infty}\frac{1}{n\left(n+N\right)}$ where $N$ is a positive integer.

**[T]** Define a sequence ${t}_{k}={\displaystyle \sum _{n=1}^{k-1}(1\text{/}k)-\text{ln}\phantom{\rule{0.1em}{0ex}}k.}$ Use the graph of $1\text{/}x$ to verify that ${t}_{k}$ is increasing. Plot ${t}_{k}$ for $k=1\text{\u2026}100$ and state whether it appears that the sequence converges.

**[T]** Suppose that $N$ equal uniform rectangular blocks are stacked one on top of the other, allowing for some overhang. Archimedes’ law of the lever implies that the stack of $N$ blocks is stable as long as the center of mass of the top $\left(N-1\right)$ blocks lies at the edge of the bottom block. Let $x$ denote the position of the edge of the bottom block, and think of its position as relative to the center of the next-to-bottom block. This implies that $(N-1)x=\left(\frac{1}{2}-x\right)$ or $x=1\text{/}\left(2N\right).$ Use this expression to compute the maximum overhang (the position of the edge of the top block over the edge of the bottom block.) See the following figure.

Each of the following infinite series converges to the given multiple of $\pi $ or $1\text{/}\pi .$

In each case, find the minimum value of $N$ such that the $N\text{th}$ partial sum of the series accurately approximates the left-hand side to the given number of decimal places, and give the desired approximate value. Up to $15$ decimals place, $\pi =\mathrm{3.141592653589793...}.$

**[T]** $\pi =\mathrm{-3}+{\displaystyle \sum _{n=1}^{\infty}\frac{n{2}^{n}n{\text{!}}^{2}}{\left(2n\right)\text{!}}},$ error $<0.0001$

**[T]** $\frac{\pi}{2}={\displaystyle \sum _{k=0}^{\infty}\frac{k\text{!}}{\left(2k+1\right)\text{!}\text{!}}}={\displaystyle \sum _{k=0}^{\infty}\frac{{2}^{k}k{\text{!}}^{2}}{\left(2k+1\right)\text{!}}},$ error $<{10}^{\mathrm{-4}}$

**[T]** $\frac{9801}{2\pi}=\frac{4}{9801}{\displaystyle \sum _{k=0}^{\infty}\frac{\left(4k\right)\text{!}\left(1103+26390k\right)}{{\left(k\text{!}\right)}^{4}{396}^{4k}}},$ error $<{10}^{\mathrm{-12}}$

**[T]** $\frac{1}{12\pi}={\displaystyle \sum _{k=0}^{\infty}\frac{{\left(\mathrm{-1}\right)}^{k}\left(6k\right)\text{!}\left(13591409+545140134k\right)}{\left(3k\right)\text{!}{\left(k\text{!}\right)}^{3}{640320}^{3k+3\text{/}2}}},$ error $<{10}^{\mathrm{-15}}$

**[T]** A fair coin is one that has probability $1\text{/}2$ of coming up heads when flipped.

- What is the probability that a fair coin will come up tails $n$ times in a row?
- Find the probability that a coin comes up heads for the first time after an even number of coin flips.

**[T]** Find the probability that a fair coin is flipped a multiple of three times before coming up heads.

**[T]** Find the probability that a fair coin will come up heads for the second time after an even number of flips.

**[T]** Find a series that expresses the probability that a fair coin will come up heads for the second time on a multiple of three flips.

**[T]** The expected number of times that a fair coin will come up heads is defined as the sum over $n=1,2\text{,\u2026}$ of $n$ times the probability that the coin will come up heads exactly $n$ times in a row, or $n\text{/}{2}^{n+1}.$ Compute the expected number of consecutive times that a fair coin will come up heads.

**[T]** A person deposits $\text{\$}10$ at the beginning of each quarter into a bank account that earns $4\text{\%}$ annual interest compounded quarterly (four times a year).

- Show that the interest accumulated after $n$ quarters is $\text{\$}10\left(\frac{{1.01}^{n+1}-1}{0.01}-n\right).$
- Find the first eight terms of the sequence.
- How much interest has accumulated after $2$ years?

**[T]** Suppose that the amount of a drug in a patient’s system diminishes by a multiplicative factor $r<1$ each hour. Suppose that a new dose is administered every $N$ hours. Find an expression that gives the amount $A\left(n\right)$ in the patient’s system after $n$ hours for each $n$ in terms of the dosage $d$ and the ratio $r.$ (*Hint:* Write $n=mN+k,$ where $0\le k<N,$ and sum over values from the different doses administered.)

**[T]** A certain drug is effective for an average patient only if there is at least $1$ mg per kg in the patient’s system, while it is safe only if there is at most $2$ mg per kg in an average patient’s system. Suppose that the amount in a patient’s system diminishes by a multiplicative factor of $0.9$ each hour after a dose is administered. Find the maximum interval $N$ of hours between doses, and corresponding dose range $d$ (in mg/kg) for this $N$ that will enable use of the drug to be both safe and effective in the long term.

Suppose that ${a}_{n}\ge 0$ is a sequence of numbers. Explain why the sequence of partial sums of ${a}_{n}$ is increasing.

**[T]** Suppose that ${a}_{n}$ is a sequence of positive numbers and the sequence ${S}_{n}$ of partial sums of ${a}_{n}$ is bounded above. Explain why $\sum _{n=1}^{\infty}{a}_{n}$ converges. Does the conclusion remain true if we remove the hypothesis ${a}_{n}\ge 0\text{?}$

**[T]** Suppose that ${a}_{1}={S}_{1}=1$ and that, for given numbers $S>1$ and $0<k<1,$ one defines ${a}_{n+1}=k(S-{S}_{n})$ and ${S}_{n+1}={a}_{n+1}+{S}_{n}.$ Does ${S}_{n}$ converge? If so, to what? (*Hint:* First argue that ${S}_{n}<S$ for all $n$ and ${S}_{n}$ is increasing.)

**[T]** A version of von Bertalanffy growth can be used to estimate the age of an individual in a homogeneous species from its length if the annual increase in year $n+1$ satisfies ${a}_{n+1}=k(S-{S}_{n}),$ with ${S}_{n}$ as the length at year $n,$ $S$ as a limiting length, and $k$ as a relative growth constant. If ${S}_{1}=3,$ $S=9,$ and $k=1\text{/}2,$ numerically estimate the smallest value of $n$ such that ${S}_{n}\ge 8.$ Note that ${S}_{n+1}={S}_{n}+{a}_{n+1}.$ Find the corresponding $n$ when $k=1\text{/}4.$

**[T]** Suppose that $\sum _{n=1}^{\infty}{a}_{n}$ is a convergent series of positive terms. Explain why $\underset{N\to \infty}{\text{lim}}{\displaystyle \sum _{n=N+1}^{\infty}{a}_{n}=0}.$

**[T]** Find the length of the dashed zig-zag path in the following figure.

**[T]** The Sierpinski triangle is obtained from a triangle by deleting the middle fourth as indicated in the first step, by deleting the middle fourths of the remaining three congruent triangles in the second step, and in general deleting the middle fourths of the remaining triangles in each successive step. Assuming that the original triangle is shown in the figure, find the areas of the remaining parts of the original triangle after $N$ steps and find the total length of all of the boundary triangles after $N$ steps.

**[T]** The Sierpinski gasket is obtained by dividing the unit square into nine equal sub-squares, removing the middle square, then doing the same at each stage to the remaining sub-squares. The figure shows the remaining set after four iterations. Compute the total area removed after $N$ stages, and compute the length the total perimeter of the remaining set after $N$ stages.