Chapter 2: Problem 7
For \(n \in \mathbb{N}\), let \(a_{n}:=n^{1 / n}\). Show that \(a_{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 2: Problem 7
For \(n \in \mathbb{N}\), let \(a_{n}:=n^{1 / n}\). Show that \(a_{1}
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(\left(a_{n}\right)\) be a sequence of real numbers and let \(a \in \mathbb{R} .\) Show that \(a_{n} \rightarrow a\) if and only if every subsequence of \(\left(a_{n}\right)\) has a subsequence converging to a. (Hint: Proposition 2.17.)
Suppose \(\alpha\) and \(\beta\) are nonnegative real numbers. Let $$ a_{1}:=\alpha \quad \text { and } \quad a_{n+1}:=\beta+\sqrt{a_{n}} \quad \text { for } n \in \mathbb{N} $$ Show that \(\left(a_{n}\right)\) is convergent. Further, if \(a:=\lim _{n \rightarrow \infty} a_{n}\), then show that \(a=0\) if \(\alpha=0=\beta\), and \(a=(1+2 \beta+\sqrt{1+4 \beta}) / 2\) otherwise. (Hint: Consider the cases \(\sqrt{\alpha}+\beta \leq \alpha\) and \(\sqrt{\alpha}+\beta>\alpha\).)
Suppose \(\alpha\) and \(\beta\) are nonnegative real numbers. Let $$ a_{1}:=\alpha \quad \text { and } \quad a_{n+1}:=\sqrt{\beta+a_{n}} \quad \text { for } n \in \mathbb{N} $$ Show that \(\left(a_{n}\right)\) is convergent. Further, if \(a:=\lim _{n \rightarrow \infty} a_{n}\), then show that \(a=0\) if \(\alpha=0=\beta\), and \(a=(1+\sqrt{1+4 \beta}) / 2\) otherwise. (Hint: Consider the cases \(\sqrt{\alpha+\beta} \leq \alpha\) and \(\sqrt{\alpha+\beta}>\alpha\).)
Show that the sequence \(\left(a_{n}\right)\) is convergent and find its limit if \(\left(a_{n}\right)\) is given by the following. (i) \(a_{1}:=1\) and \(a_{n+1}:=\left(3 a_{n}+2\right) / 6\) for \(n \in \mathbb{N}\). (ii) \(a_{1}:=1\) and \(a_{n+1}:=a_{n} /\left(2 a_{n}+1\right)\) for \(n \in \mathbb{N}\). (iii) \(a_{1}:=1\) and \(a_{n+1}:=2 a_{n} /\left(4 a_{n}+1\right)\) for \(n \in \mathbb{N}\). (iv) \(a_{1}:=2\) and \(a_{n+1}:=\sqrt{1+a_{n}}\) for \(n \in \mathbb{N}\). (v) \(a_{1}:=1\) and \(a_{n+1}:=\sqrt{2+a_{n}}\) for \(n \in \mathbb{N}\). (vi) \(a_{1}:=2\) and \(a_{n+1}:=(1 / 2)+\sqrt{a_{n}}\) for \(n \in \mathbb{N}\). (vii) \(a_{1}:=1\) and \(a_{n+1}:=(1 / 2)+\sqrt{a_{n}}\) for \(n \in \mathbb{N}\).
Let \(A_{n}:=1+\left(1 / 2^{2}\right)+\cdots+\left(1 / n^{2}\right)\) for \(n \in \mathbb{N}\). Show that there is no real number \(\alpha<1\) such that \(\left|A_{n+1}-A_{n}\right| \leq \alpha\left|A_{n}-A_{n-1}\right|\) for all \(n \in \mathbb{N}\) with \(n \geq 2\), but \(\left(A_{n}\right)\) is a Cauchy sequence.
What do you think about this solution?
We value your feedback to improve our textbook solutions.