Chapter 9: Problem 27
Use the Comparison Test or Limit Comparison Test to determine whether the following series converge. $$\sum_{k=1}^{\infty} \frac{1}{k^{2}+4}$$
/*! 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 27
Use the Comparison Test or Limit Comparison Test to determine whether the following series converge. $$\sum_{k=1}^{\infty} \frac{1}{k^{2}+4}$$
All the tools & learning materials you need for study success - in one app.
Get started for free
Evaluate the limit of the following sequences. $$a_{n}=\frac{75^{n-1}}{99^{n}}+\frac{5^{n} \sin n}{8^{n}}$$
Two sine series Determine whether the following series converge. a. \(\sum_{k=1}^{\infty} \sin \frac{1}{k}\) b. \(\sum_{k=1}^{\infty} \frac{1}{k} \sin \frac{1}{k}\)
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}\left(a_{n}+2 / a_{n}\right) ; a_{0}=2, n=0,1,2, \dots$$
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?
Consider the series \(\sum_{k=3}^{\infty} \frac{1}{k \ln k(\ln \ln k)^{p}},\) where \(p\) is a real number. a. For what values of \(p\) does this series converge? b. Which of the following series converges faster? Explain. $$ \sum_{k=2}^{\infty} \frac{1}{k(\ln k)^{2}} \text { or } \sum_{k=3}^{\infty} \frac{1}{k \ln k(\ln \ln k)^{2}} ? $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.