Chapter 5
> 来源: OpenStax《Calculus Volume 2》| 原页: https://openstax.org/books/calculus-volume-2/pages/chapter-5
Skip to Content\Calculus Volume 2
Chapter 5
Calculus Volume 2Chapter 5
------------------------------------------------------------------------
Chapter 5
Checkpoint
5.1
$a_{n} = \frac{(-1)^{n + 1}}{3 + 2n}$
5.2
$a_{n} = 6n - 10$
5.3
The sequence converges, and its limit is $0.$
5.4
The sequence converges, and its limit is $\sqrt{2\text{/}3}.$
5.5
$2$
5.6
$0.$
5.7
The series diverges because the $k\text{th}$ partial sum $S_{k} > k.$
5.8
$10.$
5.9
$5\text{/}7$
5.10
$475\text{/}90$
5.11
$e - 1$
5.12
The series diverges.
5.13
The series diverges.
5.14
The series converges.
5.15
$S_{5} \approx 1.09035,$ $R_{5} < 0.00267$
5.16
The series converges.
5.17
The series diverges.
5.18
The series converges.
5.19
$0.04762$
5.20
The series converges absolutely.
5.21
The series converges.
5.22
The series converges.
5.23
The comparison test because $2^{n}\text{/}\left( {3^{n} + n} \right) < 2^{n}\text{/}3^{n}$ for all positive integers $n.$ The limit comparison test could also be used.
Section 5.1 Exercises
1.
$a_{n} = 0$ if $n$ is odd and $a_{n} = 2$ if $n$ is even
3.
$\left\{ a_{n} \right\} = \left\{ 1,3,6,10,15,21\text{,…} \right\}$
5.
$a_{n} = \frac{n\left( {n + 1} \right)}{2}$
7.
$a_{n} = 4n - 7$
9.
$a_{n} = 3.10^{1 - n} = 30.10^{\text{−}n}$
11.
$a_{n} = 2^{n - 1} - 1$
13.
$a_{n} = \frac{(-1)^{n - 1}}{2n - 1}$
15.
$f(n) = 2^{n}$
17.
$f(n) = n\text{!}\text{/}2^{n - 2}$
19.
Terms oscillate above and below $5\text{/}3$ and appear to converge to $5\text{/}3.$
21.
Terms oscillate above and below $y \approx 1.57...$ and appear to converge to a limit.
23.
$7$
25.
$0$
27.
$0$
29.
$1$
31.
bounded, decreasing for $n \geq 2$
33.
bounded, not monotone
35.
bounded, decreasing
37.
not monotone, not bounded
39.
$a_{n}$ is decreasing and bounded below by $2.$ The limit $a$ must satisfy $a = \sqrt{2a}$ so $a = 2,$ independent of the initial value.
41.
$0$
43.
$0:{\left| {\text{sin}\mspace{2mu} x} \right| \leq |x|}$ and $\left| {\text{sin}\mspace{2mu} x} \right| \leq 1$ so $- \frac{1}{n} \leq a_{n} \leq \frac{1}{n}).$
45.
Graph oscillates and suggests no limit.
47.
$n^{1\text{/}n}\rightarrow 1$ and $2^{1\text{/}n}\rightarrow 1,$ so $a_{n}\rightarrow 0$
49.
Since ${(1 + 1\text{/}n)}^{n}\rightarrow e,$ one has ${(1 - 2\text{/}n)}^{n} \approx {(1 + k)}^{-2k}\rightarrow e^{-2}$ as $k\rightarrow\infty.$
51.
$2^{n} + 3^{n} \leq 2 \cdot 3^{n}$ and $3^{n}\text{/}4^{n}\rightarrow 0$ as $n\rightarrow\infty,$ so $a_{n}\rightarrow 0$ as $n\rightarrow\infty.$
53.
$\frac{a_{n + 1}}{a_{n}} = n\text{!}\text{/}(n + 1)(n + 2)\text{⋯}\ (2n)$ $= \frac{1 \cdot 2 \cdot 3\text{⋯}n}{(n + 1)(n + 2)\text{⋯}\ (2n)} < 1\text{/}2^{n}.$ In particular, $a_{n + 1}\text{/}a_{n} \leq 1\text{/}2,$ so $a_{n}\rightarrow 0$ as $n\rightarrow\infty.$
55.
$x_{n + 1} = x_{n} - \left( {\left( {x_{n} - 1} \right)^{2} - 2} \right)\text{/}2\left( {x_{n} - 1} \right);$ $x = 1 + \sqrt{2},$ $x \approx 2.4142,$ $n = 5$
57.
$x_{n + 1} = x_{n} - x_{n}\left( {\text{ln}\left( x_{n} \right) - 1} \right);$ $x = e,$ $x \approx 2.7183,$ $n = 5$
59.
a\. Without losses, the population would obey $P_{n} = 1.06P_{n - 1}.$ The subtraction of $150$ accounts for fish losses. b. After $12$ months, we have $P_{12} \approx 1494.$
61.
a\. The student owes $\text{\$}9383$ after $12$ months. b. The loan will be paid in full after $139$ months or eleven and a half years.
63.
$b_{1} = 0,$ $x_{1} = 2\text{/}3,$ $b_{2} = 1,$ $x_{2} = 4\text{/}3 - 1 = 1\text{/}3,$ so the pattern repeats, and $1\text{/}3 = 0.010101\text{…}.$
65.
For the starting values $a_{1} = 1,$ $a_{2} = 2\text{,…},$ $a_{1} = 10,$ the corresponding bit averages calculated by the method indicated are $0.5220,$ $0.5000,$ $0.4960,$ $0.4870,$ $0.4860,$ $0.4680,$ $0.5130,$ $0.5210,$ $0.5040,$ and $0.4840.$ Here is an example of ten corresponding averages of strings of $1000$ bits generated by a random number generator: $0.4880,$ $0.4870,$ $0.5150,$ $0.5490,$ $0.5130,$ $0.5180,$ $0.4860,$ $0.5030,$ $0.5050,$ $0.4980.$ There is no real pattern in either type of average. The random-number-generated averages range between $0.4860$ and $0.5490,$ a range of $0.0630,$ whereas the calculated PRNG bit averages range between $0.4680$ and $0.5220,$ a range of $0.0540.$
Section 5.2 Exercises
67.
$\sum\limits_{n = 1}^{\infty}\frac{1}{n}$
69.
$\sum\limits_{n = 1}^{\infty}\frac{(-1)^{n - 1}}{n}$
71.
$1,3,6,10$
73.
$1,1,0,0$
75.
$a_{n} = S_{n} - S_{n - 1} = \frac{1}{n - 1} - \frac{1}{n}.$ Series converges to $S = 1.$
77.
$a_{n} = S_{n} - S_{n - 1} = \sqrt{n} - \sqrt{n - 1} = \frac{1}{\sqrt{n - 1} + \sqrt{n}}.$ Series diverges because partial sums are unbounded.
79.
$S_{1} = 1\text{/}3,$ $S_{2} = 1\text{/}3 + 2\text{/}4 > 1\text{/}3 + 1\text{/}3 = 2\text{/}3,$ $S_{3} = 1\text{/}3 + 2\text{/}4 + 3\text{/}5 > 3 \cdot \left( {1\text{/}3} \right) = 1.$ In general $S_{k} > k\text{/}3.$ Series diverges.
81.
$\begin{array}{l}
{S_{1} = 1\text{/}(2.3) = 1\text{/}6 = 2\text{/}3 - 1\text{/}2,} \\
{S_{2} = 1\text{/}(2.3) + 1\text{/}(3.4) = 2\text{/}12 + 1\text{/}12 = 1\text{/}4 = 3\text{/}4 - 1\text{/}2,} \\
{S_{3} = 1\text{/}(2.3) + 1\text{/}(3.4) + 1\text{/}(4.5) = 10\text{/}60 + 5\text{/}60 + 3\text{/}60 = 3\text{/}10 = 4\text{/}5 - 1\text{/}2,} \\
{S_{4} = 1\text{/}(2.3) + 1\text{/}(3.4) + 1\text{/}(4.5) + 1\text{/}(5.6) = 10\text{/}60 + 5\text{/}60 + 3\text{/}60 + 2\text{/}60 = 1\text{/}3 = 5\text{/}6 - 1\text{/}2.}
\end{array}$
The pattern is $S_{k} = \left( {k + 1} \right)\text{/}\left( {k + 2} \right) - 1\text{/}2$ and the series converges to $1\text{/}2.$
83.
$0$
85.
$-3$
87.
diverges, $\sum\limits_{n = 1001}^{\infty}\frac{1}{n}$
89.
convergent geometric series, $r = 1\text{/}10 < 1$
91.
convergent geometric series, $r = \pi\text{/}e^{2} < 1$
93.
${\sum\limits_{n = 1}^{\infty}{5 \cdot \left( {-1\text{/}5} \right)^{n}}},$ converges to $-5\text{/}6$
95.
${\sum\limits_{n = 1}^{\infty}{100 \cdot \left( {1\text{/}10} \right)^{n}}},$ converges to $100\text{/}9$
97.
$x{\sum\limits_{n = 0}^{\infty}\left( {\text{−}x} \right)^{n}} = {\sum\limits_{n = 1}^{\infty}{(-1)^{n - 1}x^{n}}}$
99.
$\sum\limits_{n = 0}^{\infty}{(-1)^{n}\text{sin}^{2n}(x)}$
101.
$S_{k} = 2 - 2^{1\text{/}{({k + 1})}}\rightarrow 1$ as $k\rightarrow\infty.$
103.
$S_{k} = 1 - \sqrt{k + 1}$ diverges
105.
$\sum\limits_{n = 1}^{\infty}{\text{ln}\mspace{2mu} n - \text{ln}\left( {n + 1} \right),S_{k} = \text{−}\text{ln}\left( {k + 1} \right)}$
107.
$a_{n} = \frac{1}{\text{ln}\mspace{2mu} n} - \frac{1}{\text{ln}(n + 1)}$ and $S_{k} = \frac{1}{\text{ln}(2)} - \frac{1}{\text{ln}(k + 1)}\rightarrow\frac{1}{\text{ln}(2)}$
109.
${\sum\limits_{n = 1}^{\infty}{a_{n} =}}f(1) - f(2)$
111.
$c_{0} + c_{1} + c_{2} + c_{3} + c_{4} = 0$
113.
$\frac{2}{n^{3} - 1} = \frac{1}{n - 1} - \frac{2}{n} + \frac{1}{n + 1},$ $S_{n} = \left( {1 - 1 + 1\text{/}3} \right) + \left( {1\text{/}2 - 2\text{/}3 + 1\text{/}4} \right)$ $+ \left( {1\text{/}3 - 2\text{/}4 + 1\text{/}5} \right) + \left( {1\text{/}4 - 2\text{/}5 + 1\text{/}6} \right) + \text{⋯} = 1\text{/}2$
115.
$t_{k}$ converges to $0.57721\text{…}t_{k}$ is a sum of rectangles of height $1\text{/}k$ over the interval $\lbrack k,k + 1\rbrack$ which lie above the graph of $1\text{/}x.$
117.
$N = 22,$ $S_{N} = 6.1415$
119.
$N = 3,$ $S_{N} = 1.559877597243667...$
121.
a\. The probability of any given ordered sequence of outcomes for $n$ coin flips is $1\text{/}2^{n}.$ b. The probability of coming up heads for the first time on the $n$ th flip is the probability of the sequence $TT\text{…}TH$ which is $1\text{/}2^{n}.$ The probability of coming up heads for the first time on an even flip is $\sum\limits_{n = 1}^{\infty}{1\text{/}2^{2n}}$ or $1\text{/}3.$
123.
$5\text{/}9$
125.
$E = {\sum\limits_{n = 1}^{\infty}{n\text{/}2^{n + 1} = 1}},$ as can be shown using summation by parts
127.
The part of the first dose after $n$ hours is $dr^{n},$ the part of the second dose is $dr^{n - N},$ and, in general, the part remaining of the $m\text{th}$ dose is $dr^{n - mN},$ so
$A(n) = {\sum\limits_{l = 0}^{m}{dr^{n - lN} =}}{\sum\limits_{l = 0}^{m}{dr^{k + {({m - l})}N} = {\sum\limits_{q = 0}^{m}{dr^{k + qN}}} = dr^{k}}}{\sum\limits_{q = 0}^{m}{r^{Nq} =}}dr^{k}\frac{1 - r^{({m + 1})N}}{1 - r^{N}},n = k + mN.$
129.
$S_{N + 1} = a_{N + 1} + S_{N} \geq S_{N}$
131.
Since $S > 1,$ $a_{2} > 0,$ and since $k < 1,$ $S_{2} = 1 + a_{2} < 1 + (S - 1) = S.$ If $S_{n} > S$ for some *n*, then there is a smallest *n*. For this *n*, $S > S_{n - 1},$ so $S_{n} = S_{n - 1} + k(S - S_{n - 1})$ $= kS + (1 - k)S_{n - 1} < S,$ a contradiction. Thus $S_{n} < S$ and $a_{n + 1} > 0$ for all *n*, so $S_{n}$ is increasing and bounded by $S.$ Let $S_{\text{∗}} = \text{lim}\ S_{n}.$ If $S_{\text{∗}} < S,$ then $\delta = k(S - S_{\text{∗}}) > 0,$ but we can find *n* such that $S_{*} - S_{n} < \delta\text{/}2,$ which implies that $S_{n + 1} = S_{n} + k(S - S_{n})$ $> S_{*} + \delta\text{/}2,$ contradicting that $S_{n}$ is increasing to $S_{\text{∗}}.$ Thus $S_{n}\rightarrow S.$
133.
Let $S_{k} = {\sum\limits_{n = 1}^{k}a_{n}}$ and $S_{k}\rightarrow L.$ Then $S_{k}$ eventually becomes arbitrarily close to $L,$ which means that $L - S_{N} = {\sum\limits_{n = N + 1}^{\infty}a_{n}}$ becomes arbitrarily small as $N\rightarrow\infty.$
135.
$L = \left( {1 + \frac{1}{2}} \right){\sum\limits_{n = 1}^{\infty}{1\text{/}2^{n} =}}\frac{3}{2}.$
137.
At stage one a square of area $1\text{/}9$ is removed, at stage $2$ one removes $8$ squares of area $1\text{/}9^{2},$ at stage three one removes $8^{2}$ squares of area $1\text{/}9^{3},$ and so on. The total removed area after $N$ stages is ${\sum\limits_{n = 0}^{N - 1}{8^{N}\text{/}9^{N + 1}}} = \frac{1}{8}\left( {1 - \left( {8\text{/}9} \right)^{N}} \right)\text{/}\left( {1 - 8\text{/}9} \right)\rightarrow 1$
as $N\rightarrow\infty.$ The total perimeter is $4 + 4{\sum\limits_{n = 0}{8^{N}\text{/}3^{N + 1}}}\rightarrow\infty.$
Section 5.3 Exercises
139.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 0.$ Divergence test does not apply.
141.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 2.$ Series diverges.
143.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = \infty$ (does not exist). Series diverges.
145.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 1.$ Series diverges.
147.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n}$ does not exist. Series diverges.
149.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 1\text{/}e^{2}.$ Series diverges.
151.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 0.$ Divergence test does not apply.
153.
Series converges, $p > 1.$
155.
Series converges, $p = 4\text{/}3 > 1.$
157.
Series converges, $p = 2e - \pi > 1.$
159.
Series diverges by comparison with ${\int_{1}^{\infty}\frac{dx}{\left( {x + 5} \right)^{1\text{/}3}}}.$
161.
Series diverges by comparison with ${\int_{1}^{\infty}\frac{x}{1 + x^{2}}}dx.$
163.
Series converges by comparison with ${\int_{1}^{\infty}\frac{2x}{1 + x^{4}}}dx.$
165.
$2^{\text{−}\text{ln}\mspace{2mu} n} = 1\text{/}n^{\text{ln}\mspace{2mu} 2}.$ Since $\text{ln}\mspace{2mu} 2 < 1,$ diverges by $p$-series.
167.
$2^{-2\mspace{2mu}\text{ln}\mspace{2mu} n} = 1\text{/}n^{2\mspace{2mu}\text{ln}\mspace{2mu} 2}.$ Since $2\mspace{2mu}\text{ln}\mspace{2mu} 2 - 1 < 1,$ diverges by $p$-series.
169.
$R_{1000} \leq {\int_{1000}^{\infty}\frac{dt}{t^{2}}} = - \frac{1}{t}|_{1000}^{\infty} = 0.001$
171.
$R_{1000} \leq {\int_{1000}^{\infty}\frac{dt}{1 + t^{2}}} = \text{tan}^{-1}\infty - \text{tan}^{-1}(1000) = \pi\text{/}2 - \text{tan}^{-1}(1000) \approx 0.000999$
173.
$R_{N} < {\int_{N}^{\infty}\frac{dx}{x^{2}}} = 1\text{/}N,N > 10^{4}$
175.
$R_{N} < {\int_{N}^{\infty}\frac{dx}{x^{1.01}}} = 100N^{-0.01},N > 10^{600}$
177.
$R_{N} < {\int_{N}^{\infty}\frac{dx}{1 + x^{2}}} = \pi\text{/}2 - \text{tan}^{-1}(N),N > \text{tan}\left( {\pi\text{/}2 - 10^{-3}} \right) \approx 1000$
179.
$R_{N} < {\int_{N}^{\infty}\frac{dx}{e^{x}}} = e^{\text{−}N},N > 5\mspace{2mu}\text{ln}\mspace{2mu}(10),$ okay if $N = 12;{\sum\limits_{n = 1}^{12}e^{\text{−}n}} = 0.581973....$ Estimate agrees with $1\text{/}\left( {e - 1} \right)$ to five decimal places.
181.
$R_{N} < \int_{N}^{\infty}dx\text{/}x^{4} = 1\text{/}3N^{3},N > \left( 10^{4}/3 \right)^{1\text{/}3},$ okay if $N = 15;$
${\sum\limits_{n = 1}^{15}{1\text{/}n^{4}}} = 1.08226\text{…}.$ Estimate agrees with the sum to three decimal places.
183.
$\text{ln}(2)$
185.
$T = 0.5772...$
187.
The expected number of random insertions to get $B$ to the top is $n + n\text{/}2 + n\text{/}3 + \text{⋯} + n\text{/}\left( {n - 1} \right).$ Then one more insertion puts $B$ back in at random. Thus, the expected number of shuffles to randomize the deck is $n\left( {1 + 1\text{/}2 + \text{⋯} + 1\text{/}n} \right).$
189.
Set $b_{n} = a_{n + N}$ and $g(t) = f\left( {t + N} \right)$ such that $f$ is decreasing on $\lbrack t,\infty).$
191.
The series converges for $p > 1$ by integral test using change of variable.
193.
$N = e^{e^{100}} \approx e^{10^{43}}$ terms are needed.
Section 5.4 Exercises
195.
Converges by comparison with $1\text{/}n^{2}.$
197.
The sum is one half times a harmonic series, which diverges.
199.
$a_{n} = 1\text{/}\left( {n + 1} \right)\left( {n + 2} \right) < 1\text{/}n^{2}.$ Converges by comparison with *p*-series, $p = 2.$
201.
$\text{sin}\left( {1\text{/}n} \right) \leq 1\text{/}n,$ so converges by comparison with *p*-series, $p = 2.$
203.
$\text{sin}\left( {1\text{/}n} \right) \leq 1,$ so converges by comparison with *p*-series, $p = 3\text{/}2.$
205.
Since $\sqrt{n + 1} - \sqrt{n} = 1\text{/}\left( {\sqrt{n + 1/2} + \sqrt{n}} \right) \leq 2\text{/}\sqrt{n},$ series converges by comparison with *p*-series for $p = 1.5.$
207.
Converges by limit comparison with *p*-series for $p > 1.$
209.
Converges by limit comparison with *p*-series, $p = 2.$
211.
Converges by limit comparison with $4^{\text{−}n}.$
213.
Converges by limit comparison with $1\text{/}e^{1.1n}.$
215.
Diverges by limit comparison with harmonic series.
217.
Converges by limit comparison with *p*-series, $p = 3.$
219.
Converges by limit comparison with *p*-series, $p = 2.$
221.
Diverges by limit comparison with $1\text{/}n.$
223.
Converges for $p > 1$ by comparison with a $p$ series for slightly smaller $p.$
225.
Converges for all $p > 0.$
227.
Converges for all $r > 1.$ If $r > 1$ then $r^{n} > 4,$ say, once $n > \text{ln}(2)\text{/}\text{ln}(r)$ and then the series converges by limit comparison with a geometric series with ratio $1\text{/}2.$
229.
The numerator is equal to $1$ when $n$ is odd and $0$ when $n$ is even, so the series can be rewritten $\sum\limits_{n = 1}^{\infty}\frac{1}{2n + 1},$ which diverges by limit comparison with the harmonic series.
231.
$\left( {a - b} \right)^{2} = a^{2} - 2ab + b^{2}$ or $a^{2} + b^{2} \geq 2ab,$ so convergence follows from comparison of $2a_{n}b_{n}$ with $a^{2}{}_{n}{} + b^{2}{}_{n}{}.$ Since the partial sums on the left are bounded by those on the right, the inequality holds for the infinite series.
233.
$\left( {\text{ln}\mspace{2mu} n} \right)^{\text{−}\text{ln}\mspace{2mu} n} = e^{\text{−}\text{ln}{(n)}\text{ln}\mspace{2mu}\text{ln}{(n)}}.$ If $n$ is sufficiently large, then $\text{ln}\mspace{2mu}\text{ln}\mspace{2mu} n > 2,$ so $\left( {\text{ln}\mspace{2mu} n} \right)^{\text{−}\text{ln}\mspace{2mu} n} < 1\text{/}n^{2},$ and the series converges by comparison to a $p - \text{series}\text{.}$
235.
$a_{n}\rightarrow 0,$ so $a^{2}{}_{n} \leq \left| a_{n} \right|$ for large $n.$ Convergence follows from limit comparison. $\sum{1\text{/}n^{2}}$ converges, but $\sum{1\text{/}n}$ does not, so the fact that $\sum\limits_{n = 1}^{\infty}{a^{2}{}_{n}}$ converges does not imply that $\sum\limits_{n = 1}^{\infty}a_{n}$ converges.
237.
No. $\sum\limits_{n = 1}^{\infty}{1\text{/}n}$ diverges. Let $b_{k} = 0$ unless $k = n^{2}$ for some $n.$ Then ${\sum\limits_{k}{b_{k}\text{/}k}} = {\sum{1\text{/}k^{2}}}$ converges.
239.
$\left| {\text{sin}\mspace{2mu} t} \right| \leq |t|,$ so the result follows from the comparison test.
241.
By the comparison test, $x = {\sum\limits_{n = 1}^{\infty}{b_{n}\text{/}2^{n}}} \leq {\sum\limits_{n = 1}^{\infty}{1\text{/}2^{n}}} = 1.$
243.
If $b_{1} = 0,$ then, by comparison, $x \leq {\sum\limits_{n = 2}^{\infty}{1\text{/}2^{n}}} = 1\text{/}2.$
245.
Yes. Keep adding $1\ \text{-kg}$ weights until the balance tips to the side with the weights. If it balances perfectly, with Robert standing on the other side, stop. Otherwise, remove one of the $1\ \text{-kg}$ weights, and add $0.1\ \text{-kg}$ weights one at a time. If it balances after adding some of these, stop. Otherwise if it tips to the weights, remove the last $0.1\ \text{-kg}$ weight. Start adding $0.01\ \text{-kg}$ weights. If it balances, stop. If it tips to the side with the weights, remove the last $0.01\ \text{-kg}$ weight that was added. Continue in this way for the $0.001\ \text{-kg}$ weights, and so on. After a finite number of steps, one has a finite series of the form $A + {\sum\limits_{n = 1}^{N}s_{n}}\text{/}10^{n}$ where $A$ is the number of full kg weights and $d_{n}$ is the number of $1\text{/}10^{n}\ \text{-kg}$ weights that were added. If at some state this series is Robert’s exact weight, the process will stop. Otherwise it represents the $N\text{th}$ partial sum of an infinite series that gives Robert’s exact weight, and the error of this sum is at most $1\text{/}10^{N}.$
247.
a\. $10^{d} - 10^{d - 1} < 10^{d}$ b. $h(d) < 9^{d}$ c. $m(d) = 10^{d - 1} + 1$ d. Group the terms in the deleted harmonic series together by number of digits. $h(d)$ bounds the number of terms, and each term is at most $1\text{/}m(d).$ ${\sum\limits_{d = 1}^{\infty}{h(d)\text{/}m(d)}} \leq {\sum\limits_{d = 1}^{\infty}{9^{d}\text{/}(10)^{d - 1}}} \leq 90.$ One can actually use comparison to estimate the value to smaller than $80.$ The actual value is smaller than $23.$
249.
Continuing the hint gives $S_{N} = \left( {1 + 1\text{/}N^{2}} \right)\left( {1 + 1\text{/}\left( {N - 1} \right)^{2}\text{…}\left( {1 + 1\text{/}4} \right)} \right).$ Then $\text{ln}\left( S_{N} \right) = \text{ln}\left( {1 + 1\text{/}N^{2}} \right) + \text{ln}\left( {1 + 1\text{/}\left( {N - 1} \right)^{2}} \right) + \text{⋯} + \text{ln}\left( {1 + 1\text{/}4} \right).$ Since $\text{ln}\left( {1 + t} \right)$ is bounded by a constant times $t,$ when $0 < t < 1$ one has $\text{ln}\left( S_{N} \right) \leq C{\sum\limits_{n = 1}^{N}\frac{1}{n^{2}}},$ which converges by comparison to the *p*-series for $p = 2.$
Section 5.5 Exercises
251.
Does not converge by divergence test. Terms do not tend to zero.
253.
Converges conditionally by alternating series test, since $\sqrt{n + 3}\text{/}n$ is decreasing. Does not converge absolutely by comparison with *p*-series, $p = 1\text{/}2.$
255.
Converges absolutely by limit comparison to $3^{n}\text{/}4^{n},$ for example.
257.
Diverges by divergence test since $\underset{n\rightarrow\infty}{\text{lim}}|a_{n}| = e.$
259.
Does not converge. Terms do not tend to zero.
261.
$\underset{n\rightarrow\infty}{\text{lim}}\text{cos}^{2}(1\text{/}n) = 1.$ Diverges by divergence test.
263.
Converges by alternating series test.
265.
Converges conditionally by alternating series test. Does not converge absolutely by limit comparison with *p*-series, $p = \pi - e$
267.
Diverges; terms do not tend to zero.
269.
Converges by alternating series test. Does not converge absolutely by limit comparison with harmonic series.
271.
Converges absolutely by limit comparison with *p*-series, $p = 3\text{/}2,$ after applying the hint.
273.
Converges by alternating series test since $n(\text{tan}^{-1}(n + 1)\text{−}\text{tan}^{-1}n)$ is decreasing to zero for large $n.$ Does not converge absolutely by limit comparison with harmonic series after applying hint.
275.
Converges absolutely, since $a_{n} = \frac{1}{n} - \frac{1}{n + 1}$ are terms of a telescoping series.
277.
Terms do not tend to zero. Series diverges by divergence test.
279.
Converges by alternating series test. Does not converge absolutely by limit comparison with harmonic series.
281.
$\text{ln}\left( {N + 1} \right) > 10,$ $N + 1 > e^{10},$ $N \geq 22026;$ $S_{22026} = –0.9743\text{…}$
283.
$2^{N + 1} > 10^{6}$ or $N + 1 > 6\mspace{2mu}\text{ln}(10)\text{/}\text{ln}(2) = 19.93.$ or $N \geq 19;$ $S_{19} = 0.333333969\text{…}$
285.
$\left( {N + 1} \right)^{2} > 10^{6}$ or $N > 999;$ $S_{1000} \approx 0.822466.$
287.
True. $b_{n}$ need not tend to zero since if $c_{n} = b_{n} - \text{lim}\ b_{n},$ then $c_{2n - 1} - c_{2n} = b_{2n - 1} - b_{2n}.$
289.
True. $b_{3n - 1} - b_{3n} \geq 0,$ so convergence of $\sum b_{3n - 2}$ follows from the comparison test.
291.
True. If one converges, then so must the other, implying absolute convergence.
293.
Yes. Take $b_{n} = 1$ if $a_{n} \geq 0$ and $b_{n} = 0$ if $a_{n} < 0.$ Then ${\sum\limits_{n = 1}^{\infty}a_{n}}b_{n} = {\sum\limits_{n:a_{n} \geq 0}a_{n}}$ converges. Similarly, one can show $\sum\limits_{n:a_{n} < 0}a_{n}$ converges. Since both series converge, the series must converge absolutely.
295.
Not decreasing. Does not converge absolutely.
297.
Not alternating. Can be expressed as ${\sum\limits_{n = 1}^{\infty}{(\frac{1}{3n - 2} + \frac{1}{3n - 1} - \frac{1}{3n})}},$ which diverges by comparison with ${\sum\frac{1}{3n - 2}}.$
299.
Let $a^{+}{}_{n} = a_{n}$ if $a_{n} \geq 0$ and $a^{+}{}_{n} = 0$ if $a_{n} < 0.$ Then $a^{+}{}_{n} \leq \left| a_{n} \right|$ for all $n$ so the sequence of partial sums of $a^{+}{}_{n}$ is increasing and bounded above by the sequence of partial sums of $\left| a_{n} \right|,$ which converges; hence, $\sum\limits_{n = 1}^{\infty}{a^{+}{}_{n}}$ converges.
301.
For $N = 5$ one has $\left| R_{N} \middle| b_{6} = \theta^{10}\text{/}10\text{!}. \right.$ When $\theta = 1,$ $R_{5} \leq 1\text{/}10\text{!} \approx 2.75\ \times \ 10^{-7}.$ When $\theta = \pi\text{/}6,$ $R_{5} \leq {(\pi\text{/}6)}^{10}\text{/}10\text{!} \approx 4.26\ \times \ 10^{-10}.$ When $\theta = \pi,$ $R_{5} \leq \pi^{10}\text{/}10\text{!} = 0.0258.$
303.
Let $b_{n} = 1\text{/}(2n - 2)\text{!}.$ Then $R_{N} \leq 1\text{/}(2N)\text{!} < 0.00001$ when $(2N)\text{!} > 10^{5}$ or $N = 5$ and $1 - \frac{1}{2\text{!}} + \frac{1}{4\text{!}} - \frac{1}{6\text{!}} + \frac{1}{8\text{!}} = 0.540325\text{…},$ whereas $\text{cos}\mspace{2mu} 1 = 0.5403023\text{…}$
305.
Let $T = {\sum\frac{1}{n^{2}}}.$ Then $T - S = \frac{1}{2}T,$ so $S = T\text{/}2.$ $\sqrt{6\ \times \ {\sum\limits_{n = 1}^{1000}{1\text{/}n^{2}}}} = 3.140638\text{…};$ $\sqrt{12\ \times \ {\sum\limits_{n = 1}^{1000}{(-1)^{n - 1}\text{/}n^{2}}}} = 3.141591\text{…};$
$\pi = 3.141592\text{…}.$ The alternating series is more accurate for $1000$ terms.
307.
$N = 6,$ $S_{N} = 0.9068$
309.
$\text{ln}(2).$ The $3n\text{th}$ partial sum is the same as that for the alternating harmonic series.
311.
The series jumps rapidly near the endpoints. For $x$ away from the endpoints, the graph looks like $\pi\left( {1\text{/}2 - x} \right).$
313.
Here is a typical result. The top curve consists of partial sums of the harmonic series. The bottom curve plots partial sums of a random harmonic series.
315.
By the alternating series test, $\left| S_{n} - S \middle| \leq b_{n + 1}, \right.$ so one needs $10^{4}$ terms of the alternating harmonic series to estimate $\text{ln}(2)$ to within $0.0001.$ The first $10$ partial sums of the series $\sum\limits_{n = 1}^{\infty}\frac{1}{n2^{n}}$ are (up to four decimals) $0.5000,0.6250,0.6667,0.6823,0.6885,0.6911,0.6923,0.6928,0.6930,0.6931$ and the tenth partial sum is within $0.0001$ of $\text{ln}(2) = 0.6931\text{…}.$
Section 5.6 Exercises
317.
$a_{n + 1}\text{/}a_{n}\rightarrow 0.$ Converges.
319.
$\frac{a_{n + 1}}{a_{n}} = \frac{1}{2}\left( \frac{n + 1}{n} \right)^{2}\rightarrow 1\text{/}2 < 1.$ Converges.
321.
$\frac{a_{n + 1}}{a_{n}}\rightarrow 1\text{/}27 < 1.$ Converges.
323.
$\frac{a_{n + 1}}{a_{n}}\rightarrow 4\text{/}e^{2} < 1.$ Converges.
325.
$\frac{a_{n + 1}}{a_{n}}\rightarrow 1.$ Ratio test is inconclusive.
327.
$\frac{a_{n}}{a_{n + 1}}\rightarrow 1\text{/}e^{2}.$ Converges.
329.
${(a_{k})}^{1\text{/}k}\rightarrow 2 > 1.$ Diverges.
331.
${(a_{n})}^{1\text{/}n}\rightarrow 1\text{/}2 < 1.$ Converges.
333.
$\left( a_{k} \right)^{1\text{/}k}\rightarrow 1\text{/}e < 1.$ Converges.
335.
$a_{n}^{1\text{/}n} = \frac{1}{e} + \frac{1}{n}\rightarrow\frac{1}{e} < 1.$ Converges.
337.
$a_{n}^{1\text{/}n} = \frac{\left( {\text{ln}\left( {1 + \text{ln}\ n} \right)} \right)}{\left( {\text{ln}\ n} \right)}\rightarrow 0$ by L’Hôpital’s rule. Converges.
339.
$\frac{a_{k + 1}}{a_{k}} = \frac{1}{2k + 1}\rightarrow 0.$ Converges by ratio test.
341.
${(a_{n})}^{1\text{/}n}\rightarrow 1\text{/}e.$ Converges by root test.
343.
$a_{k}^{1\text{/}k}\rightarrow\text{ln}(3) > 1.$ Diverges by root test.
345.
$\frac{a_{n + 1}}{a_{n}} =$ $\frac{3^{2n + 1}}{2^{3n^{2} + 3n + 1}}\rightarrow 0.$ Converge.
347.
Converges by root test and limit comparison test since $x_{n}\rightarrow\sqrt{2}.$
349.
Converges absolutely by limit comparison with $p - \text{series,}$ $p = 2.$
351.
$\underset{n\rightarrow\infty}{\text{lim}}a_{n} = 1\text{/}e^{2} \neq 0.$ Series diverges.
353.
Terms do not tend to zero: $a_{k} \geq 1\text{/}2,$ since $\text{sin}^{2}x \leq 1.$
355.
$a_{n} = \frac{2}{(n + 1)(n + 2)},$ which converges by comparison with $p - \text{series}$ for $p = 2.$
357.
$a_{k} = \frac{2^{k}1 \cdot 2\text{⋯}k}{(2k + 1)(2k + 2)\text{⋯}3k} \leq {(2\text{/}3)}^{k}$ converges by comparison with geometric series.
359.
$a_{k} \approx e^{\text{−}\text{ln}\mspace{2mu} k^{2}} = 1\text{/}k^{2}.$ Series converges by limit comparison with $p - \text{series,}$ $p = 2.$
361.
If $b_{k} = c^{1 - k}\text{/}(c - 1)$ and $a_{k} = k,$ then $b_{k + 1} - b_{k} = \text{−}c^{\text{−}k}$ and ${\sum\limits_{n = 1}^{\infty}\frac{k}{c^{k}}} = a_{1}b_{1} + \frac{1}{c - 1}{\sum\limits_{k = 1}^{\infty}c^{\text{−}k}} = \frac{c}{{(c - 1)}^{2}}.$
363.
$6 + 4 + 1 = 11$
365.
$\left| x \middle| \leq 1 \right.$
367.
$\left| x \middle| < \infty \right.$
369.
All real numbers $p$ by the ratio test.
371.
$r < 1\text{/}p$
373.
$0 < r < 1.$ Note that the ratio and root tests are inconclusive. Using the hint, there are $2k$ terms $r^{\sqrt{n}}$ for $k^{2} \leq n < {(k + 1)}^{2},$ and for $r < 1$ each term is at least $r^{k}.$ Thus, ${\sum\limits_{n = 1}^{\infty}r^{\sqrt{n}}} = {\sum\limits_{k = 1}^{\infty}{\sum\limits_{n = k^{2}}^{{(k + 1)}^{2} - 1}r^{\sqrt{n}}}}$ $\geq {\sum\limits_{k = 1}^{\infty}2}kr^{k},$ which converges by the ratio test for $r < 1.$ For $r \geq 1$ the series diverges by the divergence test.
375.
One has $a_{1} = 1,$ $a_{2} = a_{3} = 1\text{/}2\text{,…}\ a_{2n} = a_{2n + 1} = 1\text{/}2^{n}.$ The ratio test does not apply because $a_{n + 1}\text{/}a_{n} = 1$ if $n$ is even. However, $a_{n + 2}\text{/}a_{n} = 1\text{/}2,$ so the series converges according to the previous exercise. Of course, the series is just a duplicated geometric series.
377.
$a_{2n}\text{/}a_{n} = \frac{1}{2} \cdot \frac{n + 1}{n + 1 + x}\ \frac{n + 2}{n + 2 + x}\text{⋯}\frac{2n}{2n + x}.$ The inverse of the $k\text{th}$ factor is $(n + k + x)\text{/}(n + k) > 1 + x\text{/}(2n)$ so the product is less than $\left( {1 + x\text{/}\left( {2n} \right)} \right)^{\text{−}n} \approx e^{\text{−}x\text{/}2}.$ Thus for $x > 0,$ $\frac{a_{2n}}{a_{n}} \leq \frac{1}{2}e^{\text{−}x\text{/}2}.$ The series converges for $x > 0.$
Review Exercises
379.
false
381.
true
383.
unbounded, not monotone, divergent
385.
bounded, monotone, convergent, $0$
387.
unbounded, not monotone, divergent
389.
diverges
391.
converges
393.
converges, but not absolutely
395.
converges absolutely
397.
converges absolutely
399.
$\frac{1}{2}$
401.
$\infty,$ $0,$ $x_{0}$
403.
$S_{10} \approx 383,$ $\underset{n\rightarrow\infty}{\text{lim}}S_{n} = 400$
PreviousNextOrder a print copy
Citation/Attribution
This book may not be used in the training of large language models or otherwise be ingested into large language models or generative AI offerings without OpenStax's permission.
Want to cite, share, or modify this book? This book uses the Creative Commons Attribution-NonCommercial-ShareAlike License and you must attribute OpenStax.
Attribution information
- If you are redistributing all or part of this book in a print format, then you must include on every physical page the following attribution:
Access for free at https://openstax.org/books/calculus-volume-2/pages/1-introduction
- If you are redistributing all or part of this book in a digital format, then you must include on every digital page view the following attribution:
Access for free at https://openstax.org/books/calculus-volume-2/pages/1-introduction
Citation information
- Use the information below to generate a citation. We recommend using a citation tool such as this one.
- Authors: Gilbert Strang, Edwin “Jed” Herman
- Publisher/website: OpenStax
- Book title: Calculus Volume 2
- Publication date: Mar 30, 2016
- Location: Houston, Texas
- Book URL: https://openstax.org/books/calculus-volume-2/pages/1-introduction
- Section URL: https://openstax.org/books/calculus-volume-2/pages/chapter-5
© Jul 15, 2026 OpenStax. Textbook content produced by OpenStax is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike License . The OpenStax name, OpenStax logo, OpenStax book covers, OpenStax CNX name, and OpenStax CNX logo are not subject to the Creative Commons license and may not be reproduced without the prior and express written consent of Rice University.
---