Motivating Questions
How well does the \(n\)th partial sum of a convergent alternating series approximate the actual sum of the series? Why?
What is the difference between converging absolutely and converging conditionally?
How well does the \(n\)th partial sum of a convergent alternating series approximate the actual sum of the series? Why?
What is the difference between converging absolutely and converging conditionally?
When dealing with alternating series, there are a couple significant questions we would like to answer. First, can we approximate what the value of the sum of a convergent alternating series is? If so, how close is our estimate? Second, is there any connection between an alternating series and the related series with the similar series whose terms are all positive? In this section, we confront these questions.
If the series converges, the argument for the Alternating Series Test also provides us with a method to determine how close the \(n\)th partial sum \(S_n\) is to the actual sum of the series. To see how this works, let \(S\) be the sum of a convergent alternating series, so
Recall that the sequence of partial sums oscillates around the sum \(S\) so that
Therefore, the value of the term \(a_{n+1}\) provides an error estimate for how well the partial sum \(S_n\) approximates the actual sum \(S\text{.}\) We summarize this fact in the statement of the Alternating Series Estimation Theorem.
Let \(\{ a_{k} \} \) be a sequence of positive terms that decreases to \(0 \) as \(k \to \infty \text{,}\) so that the alternating series \(\sum_{k=1}^{\infty} (-1)^{k+1}a_k\) converges to a number \(S\text{.}\) If \(S_n = \sum_{k=1}^{n} (-1)^{k+1}a_k\) is the \(n\)th partial sum of the alternating series, then
Determine how well the \(100\)th partial sum \(S_{100}\) of
approximates the sum of the series.
If we let \(S\) be the sum of the series \(\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k}\text{,}\) then we know that
Now
so the 100th partial sum is within 0.0099 of the sum of the series. We have discussed the fact (and will later verify) that
and so \(S \approx 0.693147\) while
We see that the actual difference between \(S\) and \(S_{100}\) is approximately \(0.0049750013\text{,}\) which is indeed less than \(0.0099\text{.}\)
Determine the number of terms it takes to approximate the sum of the convergent alternating series
to within 0.0001.
\(S_{10} \approx 0.9469925924\text{;}\) \(\frac{7}{720} \pi^4 \approx 0.9470328299\text{.}\)
First note that the sequence \(\left\{\frac{1}{k^4}\right\}\) decreases to 0, so the series \(\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k^4}\) converges by the Alternating Series Test. Let \(S\) be the sum \(\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k^4}\) and \(S_n\) the \(n\)th partial sum of the series. We know that
So we only need to determine the value of \(n\) so that
This happens when \((n+1)^4 \lt 10000\) or when \(n+1 \gt 10\text{.}\) So \(n = 10\) will do. A computer algebra system gives \(S_{10} \approx 0.9469925924\) while \(\frac{7}{720} \pi^4 \approx 0.9470328299\text{.}\) These do agree to \(0.0001\text{.}\)
A series such as
whose terms are neither all nonnegative nor alternating is different from any series that we have considered so far. The behavior of such a series can be rather complicated, but there is an important connection between a series with some negative terms and series with all positive terms.
Explain why the series
must have a sum that is less than the series
Explain why the series
must have a sum that is greater than the series
Given that the terms in the series
converge to 0, what do you think the previous two results tell us about the convergence status of this series?
\(1 - \frac{1}{4} - \frac{1}{9} + \frac{1}{16} + \frac{1}{25} + \frac{1}{36} - \frac{1}{49} - \frac{1}{64} - \frac{1}{81} - \frac{1}{100} + \cdots \lt \sum_{k=1}^{\infty} \frac{1}{k^2} \text{.}\)
\(1 - \frac{1}{4} - \frac{1}{9} + \frac{1}{16} + \frac{1}{25} + \frac{1}{36} - \frac{1}{49} - \frac{1}{64} - \frac{1}{81} - \frac{1}{100} + \cdots \gt \sum_{k=1}^{\infty} -\frac{1}{k^2} \text{.}\)
We expect this series to converge to some finite number between \(\sum_{k=1}^{\infty} -\frac{1}{k^2}\) and \(\sum_{k=1}^{\infty} \frac{1}{k^2}\text{.}\)
Each term in the series
is of the form \(\frac{1}{k^2}\) or \(-\frac{1}{k^2}\text{.}\) Since each of these terms is less than or equal to \(\frac{1}{k^2}\) it follows that
Each term in the series
is of the form \(\frac{1}{k^2}\) or \(-\frac{1}{k^2}\text{.}\) Since each of these terms is greater than or equal to \(-\frac{1}{k^2}\) it follows that
We know that \(\sum_{k=1}^{\infty} \frac{1}{k^2}\) is a \(p\)-series with \(p = 2 \gt 1\) and so is a convergent series. Since \(\sum_{k=1}^{\infty} \frac{1}{k^2} = -\sum_{k=1}^{\infty} \frac{1}{k^2}\text{,}\) the series \(\sum_{k=1}^{\infty} -\frac{1}{k^2}\) also converges. Since the terms in the series
converge to 0 and the series itself is bounded between two convergent series, we should expect this series to converge to some finite number between \(\sum_{k=1}^{\infty} -\frac{1}{k^2}\) and \(\sum_{k=1}^{\infty} \frac{1}{k^2}\text{.}\)
As the example in Example7.43 suggests, if a series \(\sum a_k\) has some negative terms but \(\sum |a_k|\) converges, then the original series, \(\sum a_k\text{,}\) must also converge. That is, if \(\sum | a_k |\) converges, then so must \(\sum a_k\text{.}\)
As we just observed, this is the case for the series (7.16), because the corresponding series of the absolute values of its terms is the convergent \(p\)-series \(\sum \frac{1}{k^2}\text{.}\) But there are series, such as the alternating harmonic series \(\sum (-1)^{k+1} \frac{1}{k}\text{,}\) that converge while the corresponding series of absolute values, \(\sum \frac{1}{k}\text{,}\) diverges. We distinguish between these behaviors by introducing the following language.
Consider a series \(\sum a_k\text{.}\)
The series \(\sum a_k\) converges absolutely (or is absolutely convergent) provided that \(\sum | a_k |\) converges.
The series \(\sum a_k\) converges conditionally (or is conditionally convergent) provided that \(\sum | a_k |\) diverges and \(\sum a_k\) converges.
In this terminology, the series(7.16) converges absolutely while the alternating harmonic series converges conditionally. Absolute convergence is a strong condition in that it implies convergence. That is, if the series \(\sum |a_{k}| \) converges, then the series \(\sum a_{k} \) converges as well. The converse is not true, as the alternating harmonic series shows.
If a series \(\sum_{k=1}^{\infty}a_{k} \) converges absolutely, then it converges in the usual sense. That is, if the series \(\sum_{k=1}^{\infty} |a_{k}| \) converges, then \(\sum_{k=1}^{\infty} a_{k} \) converges as well.
Consider the series \(\sum (-1)^k \frac{\ln(k)}{k}\text{.}\)
Does this series converge? Explain.
Does this series converge absolutely? Explain what test you use to determine your answer.
Consider the series \(\sum (-1)^k \frac{\ln(k)}{k^2}\text{.}\)
Does this series converge? Explain.
Does this series converge absolutely? Hint: Use the fact that \(\ln(k) \lt \sqrt{k}\) for large values of \(k\) and then compare to an appropriate \(p\)-series.
\(\sum (-1)^k \frac{\ln(k)}{k}\) converges.
\(\sum (-1)^k \frac{\ln(k)}{k}\) converges conditionally.
\(\sum (-1)^k \frac{\ln(k)}{k^2}\) converges.
\(\sum (-1)^k \frac{\ln(k)}{k^2}\) converges absolutely.
By L'Hopital's Rule we have
Also, \(\frac{d}{dk} \frac{\ln(k)}{k} = \frac{1-\ln(k)}{k^2}\) is negative when \(k \gt e\text{,}\) so the sequence \(\left\{ \frac{\ln(k)}{k} \right\}\) ultimately decreases to 0. Since the first few terms in a series are irrelevant to its convergence or divergence, we conclude that the series \(\sum (-1)^k \frac{\ln(k)}{k}\) converges by the Alternating Series test.
Note that
Since the improper integral diverges, the Integral Test shows that the series \(\sum (-1)^k \frac{\ln(k)}{k}\) diverges. So the series \(\sum (-1)^k \frac{\ln(k)}{k}\) converges conditionally.
By L'Hopital's Rule we have
Also,
is negative when \(k \gt e\text{,}\) so the sequence \(\left\{ \frac{\ln(k)}{k^2} \right\}\) ultimately decreases to 0. Since the first few terms in a series are irrelevant to its convergence or divergence, we conclude that the series \(\sum (-1)^k \frac{\ln(k)}{k^2}\) converges by the Alternating Series test.
Notice that
So \(\frac{1}{\sqrt{k}}\) dominates \(\ln(k)\) and \(\ln(k) \lt \sqrt{k}\) for large \(k\text{.}\) It follows that
for large \(k\text{.}\) Therefore,
for large \(k\text{.}\) Since \(\sum \frac{1}{k^{3/2}}\) is a \(p\)-series with \(p=\frac{3}{2} \gt 1\text{,}\) the series \(\sum \frac{1}{k^{3/2}}\) converges. This forces the series \(\sum \frac{\ln(k)}{k^2}\) to converge as well, by the direct comparison test. So \(\sum (-1)^k \frac{\ln(k)}{k^2}\) converges absolutely.
Conditionally convergent series turn out to be very interesting. If the sequence \(\{a_n\}\) decreases to 0, but the series \(\sum a_k\) diverges, the conditionally convergent series \(\sum (-1)^k a_k\) is right on the borderline of being a divergent series. As a result, any conditionally convergent series converges very slowly. Furthermore, some very strange things can happen with conditionally convergent series, as illustrated in some of the exercises.
We have discussed several tests for convergence/divergence of series in our sections and in exercises. We close this section of the text with a summary of all the tests we have encountered, followed by an example that challenges you to decide which convergence test to apply to several different series.
The geometric series \(\sum ar^k\) with ratio \(r\) converges for \(-1 \lt r \lt 1\) and diverges for \(|r| \geq 1\text{.}\)
The sum of the convergent geometric series \(\displaystyle \sum_{k=0}^{\infty} ar^k\) is \(\frac{a}{1-r}\text{.}\)
If the sequence \(a_n\) does not converge to 0, then the series \(\sum a_k\) diverges.
This is the first test to apply because the conclusion is simple. However, if \(\lim_{n \to \infty} a_n = 0\text{,}\) no conclusion can be drawn.
Let \(f\) be a positive, decreasing function on an interval \([c,\infty)\) and let \(a_k = f(k)\) for each positive integer \(k \geq c\text{.}\)
If \(\int_c^{\infty} f(t) \ dt\) converges, then \(\sum a_k\) converges.
If \(\int_c^{\infty} f(t) \ dt\) diverges, then \(\sum a_k\) diverges.
Use this test when \(f(x)\) is easy to integrate.
(see Ex 4 in Section7.3)
Let \(0 \leq a_k \leq b_k\) for each positive integer \(k\text{.}\)
If \(\sum b_k\) converges, then \(\sum a_k\) converges.
If \(\sum a_k\) diverges, then \(\sum b_k\) diverges.
Use this test when you have a series with known behavior that you can compare to this test can be difficult to apply.
Let \(a_n\) and \(b_n\) be sequences of positive terms. If
for some positive finite number \(L\text{,}\) then the two series \(\sum a_k\) and \(\sum b_k\) either both converge or both diverge.
Easier to apply in general than the comparison test, but you must have a series with known behavior to compare. Useful to apply to series of rational functions.
Let \(a_k \neq 0\) for each \(k\) and suppose
If \(r \lt 1\text{,}\) then the series \(\sum a_k\) converges absolutely.
If \(r \gt 1\text{,}\) then the series \(\sum a_k\) diverges.
If \(r=1\text{,}\) then test is inconclusive.
This test is useful when a series involves factorials and powers.
(see Exercise 2 in Section7.3)
Let \(a_k \geq 0\) for each \(k\) and suppose
If \(r \lt 1\text{,}\) then the series \(\sum a_k\) converges.
If \(r \gt 1\text{,}\) then the series \(\sum a_k\) diverges.
If \(r=1\text{,}\) then test is inconclusive.
In general, the Ratio Test can usually be used in place of the Root Test. However, the Root Test can be quick to use when \(a_k\) involves \(k\)th powers.
If \(a_n\) is a positive, decreasing sequence so that \(\displaystyle \lim_{n \to \infty} a_n = 0\text{,}\) then the alternating series \(\sum (-1)^{k+1} a_k\) converges.
This test applies only to alternating series we assume that the terms \(a_n\) are all positive and that the sequence \(\{a_n\}\) is decreasing.
Let \(S_n = \displaystyle \sum_{k=1}^n (-1)^{k+1} a_k\) be the \(n\)th partial sum of the alternating series \(\displaystyle \sum_{k=1}^{\infty} (-1)^{k+1} a_k\text{.}\) Assume \(a_n \gt 0\) for each positive integer \(n\text{,}\) the sequence \(a_n\) decreases to 0 and \(\displaystyle \lim_{n \to \infty} S_n = S\text{.}\) Then it follows that \(|S - S_n| \lt a_{n+1}\text{.}\)
This bound can be used to determine the accuracy of the partial sum \(S_n\) as an approximation of the sum of a convergent alternating series.
For (a)-(j), use appropriate tests to determine the convergence or divergence of the following series. Throughout, if a series is a convergent geometric series, find its sum.
\(\displaystyle\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k-2}}\)
\(\displaystyle\sum_{k=1}^{\infty} \ \frac{k}{1+2k}\)
\(\displaystyle\sum_{k=0}^{\infty} \ \frac{2k^2+1}{k^3+k+1}\)
\(\displaystyle\sum_{k=0}^{\infty} \ \frac{100^k}{k!}\)
\(\displaystyle\sum_{k=1}^{\infty} \ \frac{2^k}{5^k}\)
\(\displaystyle\sum_{k=1}^{\infty} \ \frac{k^3-1}{k^5+1}\)
\(\displaystyle\sum_{k=2}^{\infty} \ \frac{3^{k-1}}{7^k}\)
\(\displaystyle\sum_{k=2}^{\infty} \ \frac{1}{k^k}\)
\(\displaystyle\sum_{k=1}^{\infty} \ \frac{(-1)^{k+1}}{\sqrt{k+1}}\)
\(\displaystyle\sum_{k=2}^{\infty} \ \frac{1}{k \ln(k)}\)
Determine a value of \(n\) so that the \(n\)th partial sum \(S_n\) of the alternating series \(\displaystyle\sum_{n=2}^{\infty} \frac{(-1)^n}{\ln(n)}\) approximates the sum to within 0.001.
\(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k-2}}\) diverges.
\(\sum_{k=1}^{\infty} \ \frac{k}{1+2k}\) diverges.
\(\sum_{k=0}^{\infty} \ \frac{2k^2+1}{k^3+k+1}\) diverges.
\(\sum_{k=0}^{\infty} \ \frac{100^k}{k!}\) converges.
\(\sum_{k=1}^{\infty} \ \frac{2^k}{5^k}\) is a geometric series with ratio \(\frac{2}{5}\) and sum \(\frac{2}{3}\text{.}\)
\(\sum_{k=1}^{\infty} \ \frac{k^3-1}{k^5+1}\) converges.
\(\sum_{k=2}^{\infty} \ \frac{3^{k-1}}{7^k}\) is a convergent geometric series with \(a = \frac{3}{49}\) and \(r = \frac{3}{7}\) and sum \(\frac{3}{28}\text{.}\)
\(\sum_{k=2}^{\infty} \ \frac{1}{k^k}\) converges.
\(\sum_{k=1}^{\infty} \ \frac{(-1)^{k+1}}{\sqrt{k+1}}\) converges.
\(\sum_{k=2}^{\infty} \ \frac{1}{k \ln(k)}\) diverges.
\(\sum_{k=2}^{\infty} \frac{(-1)^k}{\ln(k)}\) converges very slowly.
For large values of \(k\text{,}\) \(\frac{2}{\sqrt{k-2}}\) looks like \(\frac{2}{\sqrt{k}}\text{.}\) We will use the Limit Comparison Test to compare these two series:
Since this limit is a positive constant, we know that the two series \(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k-2}}\) and \(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k}}\) either both converge or both diverge. Now \(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k}} = 2\sum_{k=3}^{\infty} \ \frac{1}{k^{1/2}}\) is constant times a \(p\)-series with \(p=\frac{1}{2}\text{,}\) so \(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k}}\) diverges. Therefore, \(\sum_{k=3}^{\infty} \ \frac{2}{\sqrt{k-2}}\) diverges as well.
Note that
so the Divergence Test shows that \(\sum_{k=1}^{\infty} \ \frac{k}{1+2k}\) diverges.
For large values of \(k\text{,}\) \(\frac{2k^2+1}{k^3+k+1}\) looks like \(\frac{2}{k}\text{.}\) We will use the Limit Comparison Test to compare these two series:
Since this limit is a positive constant, we know that the two series \(\sum_{k=1}^{\infty} \ \frac{2k^2+1}{k^3+k+1}\) and \(\sum_{k=1}^{\infty} \ \frac{2}{k}\) either both converge or both diverge. Now \(\sum_{k=1}^{\infty} \ \frac{2}{k} = 2\sum_{k=1}^{\infty} \ \frac{1}{k}\) is constant times a \(p\)-series with \(p=1\text{,}\) so \(\sum_{k=1}^{\infty} \ \frac{2}{k}\) diverges. Therefore, \(\sum_{k=0}^{\infty} \ \frac{2k^2+1}{k^3+k+1}\) diverges as well.
Series that involve factorials are good candidates for the Ratio Test:
Since this limit is 0, the Ratio Test tells us that the series \(\sum_{k=0}^{\infty} \ \frac{100^k}{k!}\) converges.
Notice that \(\sum_{k=1}^{\infty} \ \frac{2^k}{5^k} = \sum_{k=1}^{\infty} \ \left(\frac{2}{5}\right)^k\) is a geometric series with ratio \(\frac{2}{5}\text{.}\) Let's write out the first few terms to identify the value of \(a\text{:}\)
So \(a = \frac{2}{5}\text{.}\) Since the ratio of this geometric series is between \(-1\) and 1, the series converges. The sum of the series is
For large values of \(n\text{,}\) \(\frac{k^3-1}{k^5+1}\) looks like \(\frac{k^3}{k^5}=\frac{1}{k^2}\text{.}\) We will use the Limit Comparison Test to compare \(\sum_{k=1}^{\infty} \ \frac{k^3-1}{k^5+1}\) and \(\sum_{k=1}^{\infty} \ \frac{1}{k^2}\text{:}\)
Since this limit is 1, we know that the two series \(\sum_{k=1}^{\infty} \ \frac{k^3-1}{k^5+1}\) and \(\sum_{k=1}^{\infty} \ \frac{1}{k^2}\) either both converge or both diverge. Now \(\sum_{k=1}^{\infty} \ \frac{1}{k^2}\) is a \(p\)-series with \(p=2\text{,}\) so \(\sum_{k=1}^{\infty} \ \frac{1}{k^2}\) converges. Therefore, \(\sum_{k=1}^{\infty} \ \frac{k^3-1}{k^5+1}\) converges as well.
This series looks geometric, but to be sure let's write out the first few terms of this series:
So \(\sum_{k=2}^{\infty} \ \frac{3^{k-1}}{7^k}\) is a geometric series with \(a = \frac{3}{49}\) and \(r = \frac{3}{7}\text{.}\) Since the ratio of this geometric series is between \(-1\) and 1, the series converges. The sum of the series is
\(\sum_{k=2}^{\infty} \ \frac{1}{k^k}\) converges by direct comparison with the series \(\sum_{k=2}^{\infty} \ \frac{1}{k^2}\text{.}\) Note that for all \(k\geq 2\text{,}\) we have \(k^k \geq k^2\text{,}\) so \(\frac{1}{k^k}\leq \frac{1}{k^2}\text{.}\) Since \(\sum_{k=2}^\infty \frac{1}{k^2}\) is a convergent \(p\)-series with \(p=2\text{,}\) then by the direct comparison test, \(\sum_{k=2}^{\infty} \frac{1}{k^k}\) also converges.
This series is an alternating series of the form \(\sum_{k=1}^{\infty} (-1)^{k+1} a_k\) with \(a_k = \frac{1}{\sqrt{k+1}}\text{.}\) Since
and \(\frac{1}{\sqrt{k+1}}\) decreases to 0, the Alternating Series Test shows that \(\sum_{k=1}^{\infty} \ \frac{(-1)^{k+1}}{\sqrt{k+1}}\) converges.
For this example we will use the Integral Test with the substitution \(w = \ln(x)\text{,}\) \(dw = \frac{1}{x} \ dx\text{:}\)
Since \(\int_2^{\infty} \frac{1}{x \ln(x)} \ dx\) diverges, we conclude \(\sum_{k=2}^{\infty} \ \frac{1}{k \ln(k)}\) diverges.
First note that the terms \(\frac{1}{\ln(k)}\) decrease to \(0\text{,}\) so the Alternating Series Test shows that the alternating series \(\sum_{k=2}^{\infty} \frac{(-1)^k}{\ln(k)}\) converges. Let \(S = \sum_{k=2}^{\infty} \frac{(-1)^k}{\ln(k)}\) and let \(S_n\) be the \(n\)th partial sum of this series. Recall that
where \(a_{n+1} = \frac{1}{\ln(n+1)}\text{.}\) If we can find a value of \(n\) so that \(a_{n+1} \lt 0.001\text{,}\) then \(|S_n - S| \lt 0.001\) as desired. Now
So if we choose \(n = e^{1000}\text{,}\) then \(S_n\) approximates the sum of the series to within 0.001. Notice that \(e^{1000} \approx 1.97 \times 10^{434}\) is a very large number. This shows that the series \(\sum_{k=2}^{\infty} \frac{(-1)^k}{\ln(k)}\) converges very slowly.
The difference between the \((n-1)\)th partial sum \(S_{n-1}\) and the \(n\)th partial sum \(S_n\) of a convergent alternating series \(\sum_{k=1}^{\infty} (-1)^ka_k\) is \(|S_n - S_{n-1}| = a_n\text{.}\) Since the partial sums oscillate around the sum \(S\) of the series, it follows that
So the \(n\)th partial sum of a convergent alternating series \(\sum_{k=1}^{\infty} (-1)^ka_k\) approximates the actual sum of the series to within \(a_n\text{.}\)
The convergence of an alternating series may relate to the convergence of the related series whose terms are all positive. Indeed, if an alternating series converges absolutely, then it also converges. However, an alternating series may converge even when the series with all positive terms diverges -- this is called conditional convergence.
Conditionally convergent series converge very slowly. As an example, consider the famous formula^{8}We will derive this formula in upcoming work.
In theory, the partial sums of this series could be used to approximate \(\pi\text{.}\)
Show that the series in (7.17) converges conditionally.
Let \(S_n\) be the \(n\)th partial sum of the series in (7.17). Calculate the error in approximating \(\frac{\pi}{4}\) with \(S_{100}\) and explain why this is not a very good approximation.
Determine the number of terms it would take in the series (7.17) to approximate \(\frac{\pi}{4}\) to 10 decimal places. (The fact that it takes such a large number of terms to obtain even a modest degree of accuracy is why we say that conditionally convergent series converge very slowly.)
We have shown that if \(\sum (-1)^{k+1} a_k\) is a convergent alternating series, then the sum \(S\) of the series lies between any two consecutive partial sums \(S_n\text{.}\) This suggests that the average \(\frac{S_n+S_{n+1}}{2}\) is a better approximation to \(S\) than is \(S_n\text{.}\)
Show that \(\frac{S_n+S_{n+1}}{2} = S_n + \frac{1}{2}(-1)^{n+2} a_{n+1}\text{.}\)
Use this revised approximation in (a) with \(n = 20\) to approximate \(\ln(2)\) given that
Compare this to the approximation using just \(S_{20}\text{.}\) For your convenience, \(S_{20} = \frac{155685007}{232792560}\text{.}\)
Conditionally convergent series exhibit interesting and unexpected behavior. In this exercise we examine the conditionally convergent alternating harmonic series \(\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k}\) and discover that addition is not commutative for conditionally convergent series. We will also encounter Riemann's Theorem concerning rearrangements of conditionally convergent series. Before we begin, we remind ourselves that
a fact which will be verified in a later section.
First we make a quick analysis of the positive and negative terms of the alternating harmonic series.
Show that the series \(\sum_{k=1}^{\infty} \frac{1}{2k}\) diverges.
Show that the series \(\sum_{k=1}^{\infty} \frac{1}{2k+1}\) diverges.
Based on the results of the previous parts of this exercise, what can we say about the sums \(\sum_{k=C}^{\infty} \frac{1}{2k}\) and \(\sum_{k=C}^{\infty} \frac{1}{2k+1}\) for any positive integer \(C\text{?}\) Be specific in your explanation.
Recall addition of real numbers is commutative; that is
for any real numbers \(a\) and \(b\text{.}\) This property is valid for any sum of finitely many terms, but does this property extend when we add infinitely many terms together?
The answer is no, and something even more odd happens. Riemann's Theorem (after the nineteenth-century mathematician Georg Friedrich Bernhard Riemann) states that a conditionally convergent series can be rearranged to converge to any prescribed sum. More specifically, this means that if we choose any real number \(S\text{,}\) we can rearrange the terms of the alternating harmonic series \(\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k}\) so that the sum is \(S\text{.}\) To understand how Riemann's Theorem works, let's assume for the moment that the number \(S\) we want our rearrangement to converge to is positive. Our job is to find a way to order the sum of terms of the alternating harmonic series to converge to \(S\text{.}\)
Explain how we know that, regardless of the value of \(S\text{,}\) we can find a partial sum \(P_1\)
of the positive terms of the alternating harmonic series that equals or exceeds \(S\text{.}\) Let
Explain how we know that, regardless of the value of \(S_1\text{,}\) we can find a partial sum \(N_1\)
so that
Explain how we know that, regardless of the value of \(S_2\text{,}\) we can find a partial sum \(P_2\)
of the remaining positive terms of the alternating harmonic series so that
Explain how we know that, regardless of the value of \(S_3\text{,}\) we can find a partial sum
of the remaining negative terms of the alternating harmonic series so that
Explain why we can continue this process indefinitely and find a sequence \(\{S_n\}\) whose terms are partial sums of a rearrangement of the terms in the alternating harmonic series so that \(\lim_{n \to \infty} S_n = S\text{.}\)