Chapter 9: Problem 16
Verify that the infinite series diverges. \(\sum_{n=1}^{\infty} \frac{n !}{2^{n}}\)
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 9: Problem 16
Verify that the infinite series diverges. \(\sum_{n=1}^{\infty} \frac{n !}{2^{n}}\)
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
Prove that if the power series \(\sum_{n=0}^{\infty} c_{n} x^{n}\) has a radius of convergence of \(R\), then \(\sum_{n=0}^{\infty} c_{n} x^{2 n}\) has a radius of convergence of \(\sqrt{R}\).
Consider the sequence \(\left\\{a_{n}\right\\}=\left\\{\frac{1}{n} \sum_{k=1}^{n} \frac{1}{1+(k / n)}\right\\}\). (a) Write the first five terms of \(\left\\{a_{n}\right\\}\). (b) Show that \(\lim _{n \rightarrow \infty} a_{n}=\ln 2\) by interpreting \(a_{n}\) as a Riemann sum of a definite integral.
Fibonacci Sequence In a study of the progeny of rabbits, Fibonacci (ca. \(1170-\) ca. 1240 ) encountered the sequence now bearing his name. It is defined recursively by \(a_{n+2}=a_{n}+a_{n+1}, \quad\) where \(\quad a_{1}=1\) and \(a_{2}=1\). (a) Write the first 12 terms of the sequence. (b) Write the first 10 terms of the sequence defined by $$ b_{n}=\frac{a_{n+1}}{a_{n}}, \quad n \geq 1 . $$ (c) Using the definition in part (b), show that $$ b_{n}=1+\frac{1}{b_{n-1}} $$ (d) The golden ratio \(\rho\) can be defined by \(\lim _{n \rightarrow \infty} b_{n}=\rho\). Show that \(\rho=1+1 / \rho\) and solve this equation for \(\rho\).
Consider the sequence \(\left\\{a_{n}\right\\}\) where \(a_{1}=\sqrt{k}, a_{n+1}=\sqrt{k+a_{n}}\), and \(k>0\). (a) Show that \(\left\\{a_{n}\right\\}\) is increasing and bounded. (b) Prove that \(\lim _{n \rightarrow \infty} a_{n}\) exists. (c) Find \(\lim _{n \rightarrow \infty} a_{n^{\prime}}\)
Find all values of \(x\) for which the series converges. For these values of \(x\), write the sum of the series as a function of \(x\). $$ \sum_{n=1}^{\infty}(3 x)^{n} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.