Chapter 9: Problem 48
Choose your test Use the test of your choice to determine whether the following series converge. $$\sum_{k=1}^{\infty} \frac{1}{5^{k}-1}$$
/*! 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 9: Problem 48
Choose your test Use the test of your choice to determine whether the following series converge. $$\sum_{k=1}^{\infty} \frac{1}{5^{k}-1}$$
All the tools & learning materials you need for study success - in one app.
Get started for free
Here is a fascinating (unsolved) problem known as the hailstone problem (or the Ulam Conjecture or the Collatz Conjecture). It involves sequences in two different ways. First, choose a positive integer \(N\) and call it \(a_{0} .\) This is the seed of a sequence. The rest of the sequence is generated as follows: For \(n=0,1,2, \ldots\) $$a_{n+1}=\left\\{\begin{array}{ll} a_{n} / 2 & \text { if } a_{n} \text { is even } \\ 3 a_{n}+1 & \text { if } a_{n} \text { is odd. } \end{array}\right.$$ However, if \(a_{n}=1\) for any \(n,\) then the sequence terminates. a. Compute the sequence that results from the seeds \(N=2,3\), \(4, \ldots, 10 .\) You should verify that in all these cases, the sequence eventually terminates. The hailstone conjecture (still unproved) states that for all positive integers \(N,\) the sequence terminates after a finite number of terms. b. Now define the hailstone sequence \(\left\\{H_{k}\right\\},\) which is the number of terms needed for the sequence \(\left\\{a_{n}\right\\}\) to terminate starting with a seed of \(k\). Verify that \(H_{2}=1, H_{3}=7,\) and \(H_{4}=2\). c. Plot as many terms of the hailstone sequence as is feasible. How did the sequence get its name? Does the conjecture appear to be true?
The CORDIC (COordinate Rotation DIgital Calculation) algorithm is used by most calculators to evaluate trigonometric and logarithmic functions. An important number in the CORDIC algorithm, called the aggregate constant, is \(\prod_{n=0}^{\infty} \frac{2^{n}}{\sqrt{1+2^{2 n}}},\) where \(\prod_{n=0}^{N} a_{n}\) represents the product \(a_{0} \cdot a_{1} \cdots a_{N}\). This infinite product is the limit of the sequence $$\left\\{\prod_{n=0}^{0} \frac{2^{n}}{\sqrt{1+2^{2 n}}} \cdot \prod_{n=0}^{1} \frac{2^{n}}{\sqrt{1+2^{2 n}}}, \prod_{n=0}^{2} \frac{2^{n}}{\sqrt{1+2^{2 n}}} \ldots .\right\\}.$$ Estimate the value of the aggregate constant.
Consider the geometric series $$S=\sum_{k=0}^{\infty} r^{k}$$ which has the value \(1 /(1-r)\) provided \(|r|<1 .\) Let \(S_{n}=\sum_{k=0}^{n-1} r^{k}=\frac{1-r^{n}}{1-r}\) be the sum of the first \(n\) terms. The remainder \(R_{n}\) is the error in approximating \(S\) by \(S_{n} .\) Show that $$R_{n}=\left|S-S_{n}\right|=\left|\frac{r^{n}}{1-r}\right|$$
Consider the following sequences defined by a recurrence relation. Use a calculator, analytical methods, and/or graphing to make a conjecture about the value of the limit or determine that the limit does not exist. $$a_{n+1}=\frac{1}{2} a_{n}+2 ; a_{0}=5, n=0,1,2, \dots$$
Determine whether the following series converge absolutely or conditionally, or diverge. $$\sum_{k=1}^{\infty}(-1)^{k} e^{-k}$$
What do you think about this solution?
We value your feedback to improve our textbook solutions.