Chapter 8: Problem 37
Evaluate each geometric series or state that it diverges. $$3 \sum_{k=0}^{\infty}(-\pi)^{-k}$$
Short Answer
Step by step solution
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 8: Problem 37
Evaluate each geometric series or state that it diverges. $$3 \sum_{k=0}^{\infty}(-\pi)^{-k}$$
These are the key concepts you need to understand to accurately answer the question.
All the tools & learning materials you need for study success - in one app.
Get started for free
The sequence \(\\{n !\\}\) ultimately grows faster than the sequence \(\left\\{b^{n}\right\\},\) for any \(b>1,\) as \(n \rightarrow \infty .\) However, \(b^{n}\) is generally greater than \(n !\) for small values of \(n\). Use a calculator to determine the smallest value of \(n\) such that \(n !>b^{n}\) for each of the cases \(b=2, b=e,\) and \(b=10\).
Suppose an alternating series \(\sum(-1)^{k} a_{k}\) with terms that are non increasing in magnitude, converges to \(S\) and the sum of the first \(n\) terms of the series is \(S_{n} .\) Suppose also that the difference between the magnitudes of consecutive terms decreases with \(k .\) It can be shown that for \(n \geq 1\) \(\left|S-\left(S_{n}+\frac{(-1)^{n+1} a_{n+1}}{2}\right)\right| \leq \frac{1}{2}\left|a_{n+1}-a_{n+2}\right|\) a. Interpret this inequality and explain why it is a better approximation to \(S\) than \(S_{n}\) b. For the following series, determine how many terms of the series are needed to approximate its exact value with an error less than \(10^{-6}\) using both \(S_{n}\) and the method explained in part (a). (i) \(\sum_{k=1}^{\infty} \frac{(-1)^{k}}{k}\) (ii) \(\sum_{k=2}^{\infty} \frac{(-1)^{k}}{k \ln k}\) (iii) \(\sum_{k=2}^{\infty} \frac{(-1)^{k}}{\sqrt{k}}\)
The famous Fibonacci sequence was proposed by Leonardo Pisano, also known as Fibonacci, in about \(\mathrm{A.D.} 1200\) as a model for the growth of rabbit populations. It is given by the recurrence relation \(f_{n+1}=f_{n}+f_{n-1},\) for \(n=1,2,3, \ldots,\) where \(f_{0}=1, f_{1}=1 .\) Each term of the sequence is the sum of its two predecessors. a. Write out the first ten terms of the sequence. b. Is the sequence bounded? c. Estimate or determine \(\varphi=\lim _{n \rightarrow \infty} \frac{f_{n+1}}{f_{n}},\) the ratio of the successive terms of the sequence. Provide evidence that \(\varphi=(1+\sqrt{5}) / 2,\) a number known as the golden mean. d. Use induction to verify the remarkable result that $$f_{n}=\frac{1}{\sqrt{5}}\left(\varphi^{n}-(-1)^{n} \varphi^{-n}\right).$$
For a positive real number \(p,\) the tower of exponents \(p^{p^{p}}\) continues indefinitely and the expression is ambiguous. The tower could be built from the top as the limit of the sequence \(\left\\{p^{p},\left(p^{p}\right)^{p},\left(\left(p^{p}\right)^{p}\right)^{p}, \ldots .\right\\},\) in which case the sequence is defined recursively as \(a_{n+1}=a_{n}^{p}(\text { building from the top })\) where \(a_{1}=p^{p} .\) The tower could also be built from the bottom as the limit of the sequence \(\left\\{p^{p}, p^{\left(p^{p}\right)}, p^{\left(p^{(i)}\right)}, \ldots .\right\\},\) in which case the sequence is defined recursively as \(a_{n+1}=p^{a_{n}}(\text { building from the bottom })\) where again \(a_{1}=p^{p}\). a. Estimate the value of the tower with \(p=0.5\) by building from the top. That is, use tables to estimate the limit of the sequence defined recursively by (1) with \(p=0.5 .\) Estimate the maximum value of \(p > 0\) for which the sequence has a limit. b. Estimate the value of the tower with \(p=1.2\) by building from the bottom. That is, use tables to estimate the limit of the sequence defined recursively by (2) with \(p=1.2 .\) Estimate the maximum value of \(p > 1\) for which the sequence has a limit.
a. Sketch the function \(f(x)=1 / x\) on the interval \([1, n+1]\) where \(n\) is a
positive integer. Use this graph to verify that $$\ln
(n+1)<1+\frac{1}{2}+\frac{1}{3}+\dots+\frac{1}{n}<1+\ln n.$$
b. Let \(S_{n}\) be the sum of the first \(n\) terms of the harmonic series, so
part (a) says \(\ln (n+1)
What do you think about this solution?
We value your feedback to improve our textbook solutions.