Chapter 3: Problem 14
Show that if \(z_{n}:=\left(a^{n}+b^{n}\right)^{1 / n}\) where \(0
/*! 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 3: Problem 14
Show that if \(z_{n}:=\left(a^{n}+b^{n}\right)^{1 / n}\) where \(0
All the tools & learning materials you need for study success - in one app.
Get started for free
Show that if \(x_{n} \geq 0\) for all \(n \in \mathbb{N}\) and \(\lim \left(x_{n}\right)=0\), then \(\lim \left(\sqrt{x_{n}}\right)=0\).
Let \(\sum_{n=1}^{\infty} a(n)\) be such that \((a(n))\) is a decreasing sequence of strictly positive numbers. If \(s(n)\) denotes the \(n\) th partial sum, show (by grouping the terms in \(s\left(2^{n}\right)\) in two different ways) that \(\frac{1}{2}\left(a(1)+2 a(2)+\cdots+2^{n} a\left(2^{n}\right)\right) \leq s\left(2^{n}\right) \leq\left(a(1)+2 a(2)+\cdots+2^{n-1} a\left(2^{n-1}\right)\right)+a\left(2^{n}\right)\) Use these inequalities to show that \(\sum_{n=1}^{\infty} a(n)\) converges if and only if \(\sum_{n=1}^{\infty} 2^{n} a\left(2^{n}\right)\) converges. This result is often called the Cauchy Condensation Test; it is very powerful.
Let \(\sum a_{n}\) be a given series and let \(\sum b_{n}\) be the series in which the terms are the same and in the same order as in \(\sum a_{n}\) except that the terms for which \(a_{n}=0\) have been omitted. Show that \(\sum a_{n}\) converges to \(A\) if and only if \(\sum b_{n}\) converges to \(A\).
Suppose that \(x_{n} \geq 0\) for all \(n \in \mathbb{N}\) and that \(\lim \left((-1)^{n} x_{n}\right)\) exists. Show that \(\left(x_{n}\right)\) converges.
Determine the limits of the following. (a) \(\left((3 n)^{1 / 2 n}\right)\), (b) \(\left((1+1 / 2 n)^{3 n}\right)\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.