# 8.3: Series of Real Numbers

- Page ID
- 107848

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)- What is an infinite series?
- What is the \(n\)th partial sum of an infinite series?
- How do we add up an infinite number of numbers? In other words, what does it mean for an infinite series of real numbers to converge?
- What does it mean for an infinite series of real numbers to diverge?

In Section 8.2, we encountered infinite geometric series. For example, by writing

\[ N = 0.1212121212 \cdots = \frac{12}{100} + \frac{12}{100} \cdot \frac{1}{100} + \frac{12}{100} \cdot \frac{1}{100^2} + \cdots \nonumber \]

as a geometric series, we found a way to write \(N\) as a single fraction: \(N = \frac{4}{33}\text{.}\) In this section, we explore other types of infinite sums. In Preview Activity \(\PageIndex{1}\) we see how one such sum is related to the famous number \(e\text{.}\)

Have you ever wondered how your calculator can produce a numeric approximation for complicated numbers like \(e\text{,}\) \(\pi\) or \(\ln(2)\text{?}\) After all, the only operations a calculator can really perform are addition, subtraction, multiplication, and division, the operations that make up polynomials. This activity provides the first steps in understanding how this process works. Throughout the activity, let \(f(x) = e^x\text{.}\)

- Find the tangent line to \(f\) at \(x=0\) and use this linearization to approximate \(e\text{.}\) That is, find a formula \(L(x)\) for the tangent line, and compute \(L(1)\text{,}\) since \(L(1) \approx f(1) = e\text{.}\)
- The linearization of \(e^x\) does not provide a good approximation to \(e\) since 1 is not very close to 0. To obtain a better approximation, we alter our approach a bit. Instead of using a straight line to approximate \(e\text{,}\) we put an appropriate bend in our estimating function to make it better fit the graph of \(e^x\) for \(x\) close to 0. With the linearization, we had both \(f(x)\) and \(f'(x)\) share the same value as the linearization at \(x=0\text{.}\) We will now use a quadratic approximation \(P_2(x)\) to \(f(x) = e^x\) centered at \(x=0\) which has the property that \(P_2(0) = f(0)\text{,}\) \(P'_2(0) = f'(0)\text{,}\) and \(P''_2(0) = f''(0)\text{.}\)
- Let \(P_2(x) = 1+x+\frac{x^2}{2}\text{.}\) Show that \(P_2(0) = f(0)\text{,}\) \(P'_2(0) = f'(0)\text{,}\) and \(P''_2(0) = f''(0)\text{.}\) Then, use \(P_2(x)\) to approximate \(e\) by observing that \(P_2(1) \approx f(1)\text{.}\)
- We can continue approximating \(e\) with polynomials of larger degree whose higher derivatives agree with those of \(f\) at 0. This turns out to make the polynomials fit the graph of \(f\) better for more values of \(x\) around 0. For example, let \(P_3(x) = 1+x+\frac{x^2}{2}+\frac{x^3}{6}\text{.}\) Show that \(P_3(0) = f(0)\text{,}\) \(P'_3(0) = f'(0)\text{,}\) \(P''_3(0) = f''(0)\text{,}\) and \(P'''_3(0) = f'''(0)\text{.}\) Use \(P_3(x)\) to approximate \(e\) in a way similar to how you did so with \(P_2(x)\) above.

## Infinite Series

Preview Activity \(\PageIndex{1}\) shows that an approximation to \(e\) using a linear polynomial is 2, an approximation to \(e\) using a quadratic polynomial is \(2.5\text{,}\) and an approximation using a cubic polynomial is 2.6667. If we continue this process we can obtain approximations from quartic (degree 4) and quintic (degree 5) polynomials, giving us the following approximations to \(e\text{:}\)

linear | \(1 + 1\) | \(2\) |
---|---|---|

quadratic | \(1 +1 + \frac{1}{2}\) | \(2.5\) |

cubic | \(1 + 1 + \frac{1}{2} + \frac{1}{6}\) | \(2.\overline{6}\) |

quartic | \(1 + 1 + \frac{1}{2} + \frac{1}{6} + \frac{1}{24}\) | \(2.708\overline{3}\) |

quintic | \(1 + 1 + \frac{1}{2} + \frac{1}{6} + \frac{1}{24} + \frac{1}{120}\) | \(2.71\overline{6}\) |

We see an interesting pattern here. The number \(e\) is being approximated by the sum

for increasing values of \(n\text{.}\)

We can use summation notation as a shorthand^{ 1 } for writing the sum in Equation (\(\PageIndex{1}\)) to get

We can calculate this sum using as large an \(n\) as we want, and the larger \(n\) is the more accurate the approximation (\(\PageIndex{2}\)) is. This suggests that we can write the number \(e\) as the infinite sum

This sum is an example of an *infinite series*. Note that the series (\(\PageIndex{3}\)) is the sum of the terms of the infinite sequence \(\left\{\frac{1}{n!}\right\}\text{.}\) In general, we use the following notation and terminology.

An **infinite series** of real numbers is the sum of the entries in an infinite sequence of real numbers. In other words, an infinite series is sum of the form

where \(a_1\text{,}\) \(a_2\text{,}\) \(\ldots\text{,}\) are real numbers.

We use summation notation to identify a series. If the series adds the entries of a sequence \(\{a_n\}_{n \geq 1}\text{,}\) we will write the series as

or

Each of these notations is simply shorthand for the infinite sum \(a_1 + a_2 + \cdots + a_n + \cdots\text{.}\)

Is it even possible to sum an infinite list of numbers? That doing so is possible in some situations shouldn't come as a surprise. We have already examined the special case of geometric series in the previous section. Moreover, the definite integral is defineed as the limit of a sequence of finite sums, which provides insight into how we'll think of infinite sums generally. As we investigate other infinite sums, there are two key questions we seek to answer: (1) is the sum finite? and (2) if yes, what is its value?

Consider the series

While it is physically impossible to add an infinite collection of numbers, we can, of course, add any finite collection of them. In what follows, we investigate how understanding how to find the \(n\)th partial sum (that is, the sum of the first \(n\) terms) enables us to make sense of the infinite sum.

- Sum the first two numbers in this series. That is, find a numeric value for
\[ \sum_{k=1}^2 \frac{1}{k^2} \nonumber \]
- Next, add the first three numbers in the series.
- Continue adding terms in this series to complete the list below. Carry each sum to at least 8 decimal places.
- \(\displaystyle \displaystyle\sum_{k=1}^{1} \frac{1}{k^2}=1\)
- \(\displaystyle \displaystyle\sum_{k=1}^{2} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{3} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{4} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{5} \frac{1}{k^2}=\phantom{1.46361111}\)
- \(\displaystyle \displaystyle\sum_{k=1}^{6} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{7} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{8} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{9} \frac{1}{k^2}=\)
- \(\displaystyle \displaystyle\sum_{k=1}^{10} \frac{1}{k^2} = \phantom{1.549767731}\)

- The sums in the table in part c form a sequence whose \(n\)th term is \(S_n = \sum_{k=1}^{n} \frac{1}{k^2}\text{.}\) Based on your calculations in the table, do you think the sequence \(\{S_n\}\) converges or diverges? Explain. How do you think this sequence \(\{S_n\}\) is related to the series \(\sum_{k=1}^{\infty} \frac{1}{k^2}\text{?}\)

The example in Activity \(\PageIndex{2}\) illustrates how we define the sum of an infinite series. We construct a new sequence of numbers (called the *sequence of partial sums*) where the \(n\)th term in the sequence consists of the sum of the first \(n\) terms of the series. If this sequence converges, the corresponding infinite series is said to converge, and we say that we can find the sum of the series. More formally, we have the following definition.

The \(n\)**th partial sum** of the series \(\sum_{k=1}^{\infty} a_k\) is the finite sum \(S_n = \sum_{k=1}^{n} a_k\text{.}\)

In other words, the \(n\)th partial sum \(S_n\) of a series is the sum of the first \(n\) terms in the series,

We investigate the behavior of the series by examining the sequence

of its partial sums. If the sequence of partial sums converges to some finite number, we say that the corresponding series *converges*. Otherwise, we say the series *diverges*. From our work in Activity \(\PageIndex{2}\), the series

appears to converge to some number near 1.54977. We formalize the concept of convergence and divergence of an infinite series in the following definition.

The infinite series

**converges** (or is **convergent**) if the sequence \(\{S_n\}\) of partial sums converges, where

If \(\lim_{n \to \infty} S_n = S\text{,}\) then we call \(S\) the sum of the series \(\sum_{k=1}^{\infty} a_k\text{.}\) That is,

If the sequence of partial sums does not converge, then the series

**diverges** (or is **divergent**).

The early terms in a series do not influence whether or not the series converges or diverges. Rather, the convergence or divergence of a series

is determined by what happens to the terms \(a_k\) for very large values of \(k\text{.}\) To see why, suppose that \(m\) is some constant larger than 1. Then

Since \(a_1+a_2+ \cdots + a_m\) is a finite number, the series \(\sum_{k=1}^{\infty} a_k\) will converge if and only if the series \(\sum_{k=m+1}^{\infty} a_k\) converges. Because the starting index of the series doesn't affect whether the series converges or diverges, we will often just write

when we are interested in questions of convergence/divergence as opposed to the exact sum of a series.

In Section 8.2 we encountered the special family of infinite geometric series. Recall that a geometric series has the form \(\sum_{k=0}^{\infty} ar^k\text{,}\) where \(a\) and \(r\) are real numbers (and \(r \ne 1\)). We found that the \(n\)th partial sum \(S_n\) of a geometric series is given by the convenient formula

and thus a geometric series converges if \(|r| \lt 1\text{.}\) Geometric series diverge for all other values of \(r\text{.}\)

It is generally a difficult question to determine if a given nongeometric series converges or diverges. There are several tests we can use that we will consider in the following sections.

## The Divergence Test

The first question we ask about any infinite series is usually “Does the series converge or diverge?” There is a straightforward way to check that certain series diverge, and we explore this test in the next activity.

If the *series* \(\sum a_k\) converges, then an important result necessarily follows regarding the *sequence* \(\{a_n\}\text{.}\) This activity explores this result.

Assume that the series \(\sum_{k=1}^{\infty} a_k\) converges and has sum equal to \(L\text{.}\)

- What is the \(n\)th partial sum \(S_n\) of the series \(\sum_{k=1}^{\infty} a_k\text{?}\)
- What is the \((n-1)\)st partial sum \(S_{n-1}\) of the series \(\sum_{k=1}^{\infty} a_k\text{?}\)
- What is the difference between the \(n\)th partial sum and the \((n-1)\)st partial sum of the series \(\sum_{k=1}^{\infty} a_k\text{?}\)
- Since we are assuming that \(\sum_{k=1}^{\infty} a_k = L\text{,}\) what does that tell us about \(\lim_{n \to \infty} S_n\text{?}\) Why? What does that tell us about \(\lim_{n \to \infty} S_{n-1}\text{?}\) Why?
- Combine the results of the previous two parts of this activity to determine \(\lim_{n \to \infty} a_n = \lim_{n \to \infty} (S_n - S_{n-1})\text{.}\)

The result of Activity \(\PageIndex{3}\) is the following important conditional statement:

If the series \(\sum_{k = 1}^{\infty} a_k\) converges, then the sequence \(\{a_k\}\) of \(k\)th terms converges to 0.

It is logically equivalent to say that if the sequence \(\{a_k\}\) does not converge to 0, then the series \(\sum_{k = 1}^{\infty} a_k\) cannot converge. This statement is called the Divergence Test.

If \(\lim_{k \to \infty} a_k \neq 0\text{,}\) then the series \(\sum a_k\) diverges.

Determine if the Divergence Test applies to the following series. If the test does not apply, explain why. If the test does apply, what does it tell us about the series?

- \(\displaystyle \sum \frac{k}{k+1}\)
- \(\displaystyle \sum (-1)^k\)
- \(\displaystyle \sum \frac{1}{k}\)

*Note well:* be very careful with the Divergence Test. This test only tells us what happens to a series if the terms of the corresponding sequence do not converge to 0. If the sequence of the terms of the series does converge to 0, the Divergence Test does not apply: indeed, as we will soon see, a series whose terms go to zero may either converge or diverge.

## The Integral Test

The Divergence Test settles the questions of divergence or convergence of series \(\sum a_k\) in which \(\lim_{k \to \infty} a_k \neq 0\text{.}\) Determining the convergence or divergence of series \(\sum a_k\) in which \(\lim_{k \to \infty} a_k = 0\) turns out to be more complicated. Often, we have to investigate the sequence of partial sums or apply some other technique.

Next, we consider the **harmonic series** ^{ 2 }

The first 9 partial sums of this series are shown following.

This information alone doesn't seem to be enough to tell us if the series \(\sum_{k=1}^{\infty} \frac{1}{k}\) converges or diverges. The partial sums could eventually level off to some fixed number or continue to grow without bound. Even if we look at larger partial sums, such as \(\sum_{n=1}^{1000} \frac{1}{k} \approx 7.485470861\text{,}\) the result isn't particularly convincing one way or another. The Integral Test is one way to determine whether or not the harmonic series converges, and we explore this test further in the next activity.

Consider the harmonic series \(\sum_{k=1}^{\infty} \frac{1}{k}\text{.}\) Recall that the harmonic series will converge provided that its sequence of partial sums converges. The \(n\)th partial sum \(S_n\) of the series \(\sum_{k=1}^{\infty} \frac{1}{k}\) is

Through this last expression for \(S_n\text{,}\) we can visualize this partial sum as a sum of areas of rectangles with heights \(\frac{1}{m}\) and bases of length 1, as shown in Figure \(\PageIndex{1}\), which uses the 9th partial sum.

The graph of the continuous function \(f\) defined by \(f(x) = \frac{1}{x}\) is overlaid on this plot.

- Explain how this picture represents a particular Riemann sum.
- What is the definite integral that corresponds to the Riemann sum you considered in (a)?
- Which is larger, the definite integral in (b), or the corresponding partial sum \(S_9\) of the series? Why?
- If instead of considering the 9th partial sum, we consider the \(n\)th partial sum, and we let \(n\) go to infinity, we can then compare the series \(\sum_{k=1}^{\infty} \frac{1}{k}\) to the improper integral \(\int_{1}^{\infty} \frac{1}{x} \ dx\text{.}\) Which of these quantities is larger? Why?
- Does the improper integral \(\int_{1}^{\infty} \frac{1}{x} \ dx\) converge or diverge? What does that result, together with your work in (d), tell us about the series \(\sum_{k=1}^{\infty} \frac{1}{k}\text{?}\)

The ideas from Activity \(\PageIndex{5}\) hold more generally. Suppose that \(f\) is a continuous decreasing function and that \(a_k = f(k)\) for each value of \(k\text{.}\) Consider the corresponding series \(\sum_{k=1}^{\infty} a_k\text{.}\) The partial sum

can always be viewed as a left hand Riemann sum of \(f(x)\text{,}\) using rectangles with bases of width 1 and heights given by the values \(a_k\text{.}\) A representative picture is shown at left in Figure \(\PageIndex{2}\). Since \(f\) is a decreasing function, we have that

Taking the limit as \(n\) goes to infinity shows that

Therefore, if the improper integral \(\int_{1}^{\infty} f(x) \ dx\) diverges, so does the series \(\sum_{k=1}^{\infty} a_k\text{.}\)

What's more, if we look at the right hand Riemann sums of \(f\) on \([1,n]\) as shown at right in Figure \(\PageIndex{5}\), we see that

So if \(\int_{1}^{\infty} f(x) \ dx\) converges, then so does \(\sum_{k=2}^{\infty} a_k\text{,}\) which also means that the series \(\sum_{k=1}^{\infty} a_k\) also converges. Our preceding discussion has demonstrated the truth of the Integral Test.

Let \(f\) be a real valued function and assume \(f\) is decreasing and positive for all \(x\) larger than some number \(c\text{.}\) Let \(a_k = f(k)\) for each positive integer \(k\text{.}\)

- If the improper integral \(\int_{c}^{\infty} f(x) \, dx\) converges, then the series \(\sum_{k=1}^{\infty} a_k\) converges.
- If the improper integral \(\int_{c}^{\infty} f(x) \, dx\) diverges, then the series \(\sum_{k=1}^{\infty} a_k\) diverges.

The Integral Test compares a given infinite series to a natural, corresponding improper integral and says that the infinite series and corresponding improper integral both have the same convergence status. In the next activity, we apply the Integral Test to determine the convergence or divergence of a class of important series.

The series \(\sum \frac{1}{k^p}\) are special series called \(p\)-series. We have already seen that the \(p\)-series with \(p=1\) (the harmonic series) diverges. We investigate the behavior of other \(p\)-series in this activity.

- Evaluate the improper integral \(\int_1^{\infty} \frac{1}{x^2} \ dx\text{.}\) Does the series \(\sum_{k=1}^{\infty} \frac{1}{k^2}\) converge or diverge? Explain.
- Evaluate the improper integral \(\int_1^{\infty} \frac{1}{x^p} \ dx\) where \(p \gt 1\text{.}\) For which values of \(p\) can we conclude that the series \(\sum_{k=1}^{\infty} \frac{1}{k^p}\) converges?
- Evaluate the improper integral \(\int_1^{\infty} \frac{1}{x^p} \ dx\) where \(p \lt 1\text{.}\) What does this tell us about the corresponding \(p\)-series \(\sum_{k=1}^{\infty} \frac{1}{k^p}\text{?}\)
- Summarize your work in this activity by completing the following statement.
The \(p\)-series \(\sum_{k=1}^{\infty} \frac{1}{k^p}\) converges if and only if .

## The Limit Comparison Test

The Integral Test allows us to determine the convergence of an entire family of series: the \(p\)-series. However, we have seen that it is often difficult to integrate functions, so the Integral Test is not one that we can use all of the time. In fact, even for a relatively simple series such as \(\sum \frac{k^2+1}{k^4+2k+2}\text{,}\) the Integral Test is not an option. In what follows we develop a test that applies to series of rational functions by comparing their behavior to the behavior of \(p\)-series.

Consider the series \(\sum \frac{k+1}{k^3+2}\text{.}\) Since the convergence or divergence of a series only depends on the behavior of the series for large values of \(k\text{,}\) we might examine the terms of this series more closely as \(k\) gets large.

- By computing the value of \(\frac{k+1}{k^3+2}\) for \(k = 100\) and \(k = 1000\text{,}\) explain why the terms \(\frac{k+1}{k^3+2}\) are essentially \(\frac{k}{k^3}\) when \(k\) is large.
- Let's formalize our observations in (a) a bit more. Let \(a_k = \frac{k+1}{k^3+2}\) and \(b_k = \frac{k}{k^3}\text{.}\) Calculate
\[ \lim_{k \to \infty} \frac{a_k}{b_k}\text{.} \nonumber \]
What does the value of the limit tell you about \(a_k\) and \(b_k\) for large values of \(k\text{?}\) Compare your response from part (a).

- Does the series \(\sum \frac{k}{k^3}\) converge or diverge? Why? What do you think that tells us about the convergence or divergence of the series \(\sum \frac{k+1}{k^3+2}\text{?}\) Explain.

Activity \(\PageIndex{7}\) illustrates how we can compare one series with positive terms to another whose convergence status we know. Suppose we have two series \(\sum a_k\) and \(\sum b_k\) with positive terms and we know the convergence status of the series \(\sum a_k\text{.}\) Recall that the convergence or divergence of a series depends only on the terms of the series for large values of \(k\text{,}\) so if we know that \(a_k\) and \(b_k\) are proportional for large \(k\text{,}\) then the two series \(\sum a_k\) and \(\sum b_k\) should behave the same way. In other words, if there is a positive finite constant \(c\) such that

then \(b_k \approx ca_k\) for large values of \(k\text{.}\) So

Since multiplying by a nonzero constant does not affect the convergence or divergence of a series, it follows that the series \(\sum a_k\) and \(\sum b_k\) either both converge or both diverge. The formal statement of this fact is called the Limit Comparison Test.

Let \(\sum a_k\) and \(\sum b_k\) be series with positive terms. If

for some positive (finite) constant \(c\text{,}\) then \(\sum a_k\) and \(\sum b_k\) either both converge or both diverge.

The Limit Comparison Test shows that if we have a series \(\sum \frac{p(k)}{q(k)}\) of rational functions where \(p(k)\) is a polynomial of degree \(m\) and \(q(k)\) a polynomial of degree \(l\text{,}\) then the series \(\sum \frac{p(k)}{q(k)}\) will behave like the series \(\sum \frac{k^m}{k^l}\text{.}\) So this test allows us to determine the convergence or divergence of series whose terms are rational functions.

Use the Limit Comparison Test to determine the convergence or divergence of the series

by comparing it to the series \(\sum \frac{1}{k^2}\text{.}\)

## The Ratio Test

The Limit Comparison Test works well if we can find a series with known behavior to compare. But such series are not always easy to find. In this section we will examine a test that allows us to examine the behavior of a series by comparing it to a geometric series, without knowing in advance which geometric series we need.

Consider the series defined by

This series is not a geometric series, but this activity will illustrate how we might compare this series to a geometric one. Recall that a series \(\sum a_k\) is geometric if the ratio \(\frac{a_{k+1}}{a_k}\) is always the same. For the series in (\(\PageIndex{4}\)), note that \(a_k = \frac{2^k}{3^k-k}\text{.}\)

- To see if \(\sum \frac{2^k}{3^k-k}\) is comparable to a geometric series, we analyze the ratios of successive terms in the series. Complete Table \(\PageIndex{6}\), listing your calculations to at least 8 decimal places.
Table \(\PageIndex{1}\). Ratios of successive terms in the series \(\sum \frac{2^k}{3^k-k}\) \(k\) \(5\) \(10\) \(20\) \(21\) \(22\) \(23\) \(24\) \(25\) \(\dfrac{a_{k+1}}{a_k}\) - Based on your calculations in Table \(\PageIndex{1}\), what can we say about the ratio \(\frac{a_{k+1}}{a_k}\) if \(k\) is large?
- Do you agree or disagree with the statement: “the series \(\sum \frac{2^k}{3^k-k}\) is approximately geometric when \(k\) is large”? If not, why not? If so, do you think the series \(\sum \frac{2^k}{3^k-k}\) converges or diverges? Explain.

We can generalize the argument in Activity \(\PageIndex{9}\) in the following way. Consider the series \(\sum a_k\text{.}\) If

for large values of \(k\text{,}\) then \(a_{k+1} \approx ra_k\) for large \(k\) and the series \(\sum a_k\) is approximately the geometric series \(\sum ar^k\) for large \(k\text{.}\) Since the geometric series with ratio \(r\) converges only for \(-1 \lt r \lt 1\text{,}\) we see that the series \(\sum a_k\) will converge if

for a value of \(r\) such that \(|r| \lt 1\text{.}\) This result is known as the Ratio Test.

Let \(\sum a_k\) be an infinite series. Suppose

- If \(0 \leq r \lt 1\text{,}\) then the series \(\sum a_k\) converges.
- If \(1 \lt r\text{,}\) then the series \(\sum a_k\) diverges.
- If \(r = 1\text{,}\) then the test is inconclusive.

*Note well:* The Ratio Test looks at the limit of the ratio of consecutive terms of a given series; in so doing, the test is asking, “is this series approximately geometric?” If so, the test uses the limit of the ratio of consecutive terms to determine if the given series converges.

We have now encountered several tests for determining convergence or divergence of series.

- The Divergence Test can be used to show that a series diverges, but never to prove that a series converges.
- We used the Integral Test to determine the convergence status of an entire class of series, the \(p\)-series.
- The Limit Comparison Test works well for series that involve rational functions and which can therefore by compared to \(p\)-series.
- Finally, the Ratio Test allows us to compare our series to a geometric series; it is particularly useful for series that involve \(n\)th powers and factorials.
- Two other tests, the Direct Comparison Test and the Root Test, are discussed in the exercises.

One of the challenges of determining whether a series converges or diverges is finding which test answers that question.

Determine whether each of the following series converges or diverges. Explicitly state which test you use.

- \(\displaystyle \sum \frac{k}{2^k}\)
- \(\displaystyle \sum \frac{k^3+2}{k^2+1}\)
- \(\displaystyle \sum \frac{10^k}{k!}\)
- \(\displaystyle \sum \frac{k^3-2k^2+1}{k^6+4}\)

## Summary

- An infinite series is a sum of the elements in an infinite sequence. In other words, an infinite series is a sum of the form
\[ a_1 + a_2 + \cdots + a_n + \cdots = \sum_{k=1}^{\infty} a_k \nonumber \]
where \(a_k\) is a real number for each positive integer \(k\text{.}\)

- The \(n\)th partial sum \(S_n\) of the series \(\sum_{k=1}^{\infty} a_k\) is the sum of the first \(n\) terms of the series. That is,
\[ S_n = a_1+a_2+ \cdots + a_n = \sum_{k=1}^{n} a_k\text{.} \nonumber \]
- The sequence \(\{S_n\}\) of partial sums of a series \(\sum_{k=1}^{\infty} a_k\) tells us about the convergence or divergence of the series. In particular
- The series \(\sum_{k=1}^{\infty} a_k\) converges if the sequence \(\{S_n\}\) of partial sums converges. In this case we say that the series is the limit of the sequence of partial sums and write
\[ \sum_{k=1}^{\infty} a_k =\lim_{n \to \infty} S_n\text{.} \nonumber \]
- The series \(\sum_{k=1}^{\infty} a_k\) diverges if the sequence \(\{S_n\}\) of partial sums diverges.

- The series \(\sum_{k=1}^{\infty} a_k\) converges if the sequence \(\{S_n\}\) of partial sums converges. In this case we say that the series is the limit of the sequence of partial sums and write