State whether each of the following series converges absolutely, conditionally, or not at all.
2. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\frac{\sqrt{n}+1}{\sqrt{n}+3}[/latex]
4. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\frac{\sqrt{n+3}}{n}[/latex]
6. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\frac{{3}^{n}}{n\text{!}}[/latex]
8. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{\left(\frac{n+1}{n}\right)}^{n}[/latex]
9. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{\sin}^{2}n[/latex]
10. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{\cos}^{2}n[/latex]
12. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{\cos}^{2}\left(\frac{1}{n}\right)[/latex]
14. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\text{ln}\left(1+\frac{1}{n}\right)[/latex]
16. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\frac{{n}^{e}}{1+{n}^{\pi }}[/latex]
18. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{n}^{\frac{1}{n}}[/latex]
20. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}n\left(1-\cos\left(\frac{1}{n}\right)\right)[/latex] (Hint: [latex]\cos\left(\frac{1}{n}\right)\approx 1 - \frac{1}{{n}^{2}}[/latex] for large [latex]n.[/latex])
22. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\left(\frac{1}{\sqrt{n}}-\frac{1}{\sqrt{n+1}}\right)[/latex] (Hint: Find common denominator then rationalize numerator.)
24. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}n\left({\tan}^{-1}\left(n+1\right)-{\tan}^{-1}n\right)[/latex] (Hint: Use Mean Value Theorem.)
26. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\left(\frac{1}{n}-\frac{1}{n+1}\right)[/latex]
28. [latex]\displaystyle\sum _{n=1}^{\infty }\frac{\cos\left(n\pi \right)}{{n}^{\frac{1}{n}}}[/latex]
30. [latex]\displaystyle\sum _{n=1}^{\infty }\sin\left(\frac{n\pi}{2}\right)\sin\left(\frac{1}{n}\right)[/latex]
In each of the following problems, use the estimate [latex]|{R}_{N}|\le {b}_{N+1}[/latex] to find a value of [latex]N[/latex] that guarantees that the sum of the first [latex]N[/latex] terms of the alternating series [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}{b}_{n}[/latex] differs from the infinite sum by at most the given error. Calculate the partial sum [latex]{S}_{N}[/latex] for this [latex]N[/latex].
32. [T] [latex]{b}_{n}=\frac{1}{{ln}\left(n\right)}[/latex], [latex]n\ge 2[/latex], error [latex]<{10}^{-1}[/latex]
34. [T] [latex]{b}_{n}=\frac{1}{{2}^{n}}[/latex], error [latex]<{10}^{-6}[/latex]
36. [T] [latex]{b}_{n}=\frac{1}{{n}^{2}}[/latex], error [latex]<{10}^{-6}[/latex]
For the following exercises, indicate whether each of the following statements is true or false. If the statement is false, provide an example in which it is false.
38. If [latex]{b}_{n}\ge 0[/latex] is decreasing, then [latex]\displaystyle\sum _{n=1}^{\infty }\left({b}_{2n - 1}-{b}_{2n}\right)[/latex] converges absolutely.
40. If [latex]{b}_{n}\ge 0[/latex] is decreasing and [latex]\displaystyle\sum _{n=1}^{\infty }\left({b}_{3n - 2}+{b}_{3n - 1}-{b}_{3n}\right)[/latex] converges then [latex]\displaystyle\sum _{n=1}^{\infty }{b}_{3n - 2}[/latex] converges.
42. Let [latex]{a}_{n}^{+}={a}_{n}[/latex] if [latex]{a}_{n}\ge 0[/latex] and [latex]{a}_{n}^{-}=\text{-}{a}_{n}[/latex] if [latex]{a}_{n}<0[/latex]. (Also, [latex]{a}_{n}^{+}=0\text{ if }{a}_{n}<0[/latex] and [latex]{a}_{n}^{-}=0\text{ if }{a}_{n}\ge 0.[/latex]) If [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}[/latex] converges conditionally but not absolutely, then neither [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}^{+}[/latex] nor [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}^{-}[/latex] converge.
43. Suppose that [latex]{a}_{n}[/latex] is a sequence of positive real numbers and that [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}[/latex] converges.
Suppose that [latex]{b}_{n}[/latex] is an arbitrary sequence of ones and minus ones. Does [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}{b}_{n}[/latex] necessarily converge?
44. Suppose that [latex]{a}_{n}[/latex] is a sequence such that [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}{b}_{n}[/latex] converges for every possible sequence [latex]{b}_{n}[/latex] of zeros and ones. Does [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}[/latex] converge absolutely?
The following series do not satisfy the hypotheses of the alternating series test as stated.
In each case, state which hypothesis is not satisfied. State whether the series converges absolutely.
46. [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n+1}\frac{{\cos}^{2}n}{n}[/latex]
48. [latex]1+\frac{1}{2}-\frac{1}{3}+\frac{1}{4}+\frac{1}{5}-\frac{1}{6}+\frac{1}{7}+\frac{1}{8}-\frac{1}{9}+\text{$\cdots$ }[/latex]
50. Suppose that [latex]\displaystyle\sum {a}_{n}[/latex] converges absolutely. Show that the series consisting of the positive terms [latex]{a}_{n}[/latex] also converges.
52. The formula [latex]\cos\theta =1-\frac{{\theta }^{2}}{2\text{!}}+\frac{{\theta }^{4}}{4\text{!}}-\frac{{\theta }^{6}}{6\text{!}}+\text{$\cdots$ }[/latex] will be derived in the next chapter. Use the remainder [latex]|{R}_{N}|\le {b}_{N+1}[/latex] to find a bound for the error in estimating [latex]\cos\theta[/latex] by the fifth partial sum [latex]1-\frac{{\theta }^{2}}{2\text{!}}+\frac{{\theta }^{4}}{4\text{!}}\frac{\text{-}{\theta }^{6}}{6\text{!}}+\frac{{\theta }^{8}}{8\text{!}}[/latex] for [latex]\theta =1[/latex], [latex]\theta =\frac{\pi}{6}[/latex], and [latex]\theta =\pi[/latex].
54. How many terms in [latex]\cos\theta =1-\frac{{\theta }^{2}}{2\text{!}}+\frac{{\theta }^{4}}{4\text{!}}-\frac{{\theta }^{6}}{6\text{!}}+\text{$\cdots$ }[/latex] are needed to approximate [latex]\cos1[/latex] accurate to an error of at most [latex]0.00001\text{?}[/latex]
56. Sometimes the alternating series [latex]\displaystyle\sum _{n=1}^{\infty }{\left(-1\right)}^{n - 1}{b}_{n}[/latex] converges to a certain fraction of an absolutely convergent series [latex]\displaystyle\sum _{n=1}^{\infty }{b}_{n}[/latex] at a faster rate. Given that [latex]\displaystyle\sum _{n=1}^{\infty }\frac{1}{{n}^{2}}=\frac{{\pi }^{2}}{6}[/latex], find [latex]12=1-\frac{1}{{2}^{2}}+\frac{1}{{3}^{2}}-\frac{1}{{4}^{2}}+\text{$\cdots$ }[/latex]. Which of the series [latex]6\displaystyle\sum _{n=1}^{\infty }\frac{1}{{n}^{2}}[/latex] and [latex]S\displaystyle\sum _{n=1}^{\infty }\frac{{\left(-1\right)}^{n - 1}}{{n}^{2}}[/latex] gives a better estimation of [latex]{\pi }^{2}[/latex] using [latex]1000[/latex] terms?
The following alternating series converge to given multiples of [latex]\pi[/latex]. Find the value of [latex]N[/latex] predicted by the remainder estimate such that the [latex]N\text{th}[/latex] partial sum of the series accurately approximates the left-hand side to within the given error. Find the minimum [latex]N[/latex] for which the error bound holds, and give the desired approximate value in each case. Up to [latex]15[/latex] decimals places, [latex]\pi =3.141592653589793\text{$\ldots$ }[/latex].
58. [T] [latex]\frac{\pi }{\sqrt{12}}=\displaystyle\sum _{k=0}^{\infty }\frac{{\left(-3\right)}^{\text{-}k}}{2k+1}[/latex], error [latex]<0.0001[/latex]
60. [T] If [latex]\displaystyle\sum _{n=1}^{N}{\left(-1\right)}^{n - 1}\frac{1}{n}\to \text{ln}2[/latex], what is [latex]1+\frac{1}{3}+\frac{1}{5}-\frac{1}{2}-\frac{1}{4}-\frac{1}{6}+\frac{1}{7}+\frac{1}{9}+\frac{1}{11}-\frac{1}{8}-\frac{1}{10}-\frac{1}{12}+\text{$\cdots$ }\text{?}[/latex]
62. [T] Plot the series [latex]\displaystyle\sum _{n=1}^{100}\frac{\sin\left(2\pi nx\right)}{n}[/latex] for [latex]0\le x<1[/latex] and comment on its behavior
63. [T] Plot the series [latex]\displaystyle\sum _{n=1}^{100}\frac{\cos\left(2\pi nx\right)}{{n}^{2}}[/latex] for [latex]0\le x<1[/latex] and describe its graph.
64. [T] The alternating harmonic series converges because of cancellation among its terms. Its sum is known because the cancellation can be described explicitly. A random harmonic series is one of the form [latex]\displaystyle\sum _{n=1}^{\infty }\frac{{S}_{n}}{n}[/latex], where [latex]{s}_{n}[/latex] is a randomly generated sequence of [latex]\pm 1\text{'s}[/latex] in which the values [latex]\pm 1[/latex] are equally likely to occur. Use a random number generator to produce [latex]1000[/latex] random [latex]\pm 1\text{s}[/latex] and plot the partial sums [latex]{S}_{N}=\displaystyle\sum _{n=1}^{N}\frac{{s}_{n}}{n}[/latex] of your random harmonic sequence for [latex]N=1[/latex] to [latex]1000[/latex]. Compare to a plot of the first [latex]1000[/latex] partial sums of the harmonic series.
66. [T] The Euler transform rewrites [latex]S=\displaystyle\sum _{n=0}^{\infty }{\left(-1\right)}^{n}{b}_{n}[/latex] as [latex]S=\displaystyle\sum _{n=0}^{\infty }{\left(-1\right)}^{n}{2}^{\text{-}n - 1}\displaystyle\sum _{m=0}^{n}\left(\begin{array}{c}n\\ m\end{array}\right){b}_{n-m}[/latex]. For the alternating harmonic series, it takes the form [latex]\text{ln}\left(2\right)=\displaystyle\sum _{n=1}^{\infty }\frac{{\left(-1\right)}^{n - 1}}{n}=\displaystyle\sum _{n=1}^{\infty }\frac{1}{n{2}^{n}}[/latex]. Compute partial sums of [latex]\displaystyle\sum _{n=1}^{\infty }\frac{1}{n{2}^{n}}[/latex] until they approximate [latex]\text{ln}\left(2\right)[/latex] accurate to within [latex]0.0001[/latex]. How many terms are needed? Compare this answer to the number of terms of the alternating harmonic series are needed to estimate [latex]\text{ln}\left(2\right)[/latex].
67. [T] In the text it was stated that a conditionally convergent series can be rearranged to converge to any number. Here is a slightly simpler, but similar, fact. If [latex]{a}_{n}\ge 0[/latex] is such that [latex]{a}_{n}\to 0[/latex] as [latex]n\to \infty[/latex] but [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}[/latex] diverges, then, given any number [latex]A[/latex] there is a sequence [latex]{s}_{n}[/latex] of [latex]\pm 1\text{'s}[/latex] such that [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}{s}_{n}\to A[/latex]. Show this for [latex]A>0[/latex] as follows.
- Recursively define [latex]{s}_{n}[/latex] by [latex]{s}_{n}=1[/latex] if [latex]{S}_{n - 1}=\displaystyle\sum _{k=1}^{n - 1}{a}_{k}{s}_{k}
- Explain why eventually [latex]{S}_{n}\ge A[/latex], and for any [latex]m[/latex] larger than this [latex]n[/latex], [latex]A-{a}_{m}\le {S}_{m}\le A+{a}_{m}[/latex].
- Explain why this implies that [latex]{S}_{n}\to A[/latex] as [latex]n\to \infty[/latex].
Candela Citations
- Calculus Volume 2. Authored by: Gilbert Strang, Edwin (Jed) Herman. Provided by: OpenStax. Located at: https://openstax.org/books/calculus-volume-2/pages/1-introduction. License: CC BY-NC-SA: Attribution-NonCommercial-ShareAlike. License Terms: Access for free at https://openstax.org/books/calculus-volume-2/pages/1-introduction