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 \(x \in \mathbb{R}\) and \(x>0 .\) Define $$ A_{n}:=1+\frac{x}{1 !}+\frac{x^{2}}{2 !}+\cdots+\frac{x^{n}}{n !} \quad \text { and } \quad B_{n}:=\left(1+\frac{x}{n}\right)^{n} \quad \text { for } n \in \mathbb{N} . $$ Show that \(\left(A_{n}\right)\) and \(\left(B_{n}\right)\) are convergent and have the same limit.
Prove that a sequence \(\left(a_{n}\right)\) in \(\mathbb{R}\) has no convergent subsequence if and only if \(\left|a_{n}\right| \rightarrow \infty\).
Assuming only the algebraic and the order properties of \(\mathbb{R}\), and assuming that every Cauchy sequence in \(\mathbb{R}\) is convergent, establish the Completeness Property of \(\mathbb{R}\). (Hint: Consider \(S \subseteq \mathbb{R}\) and \(a_{n}, \alpha_{n}\) as in the hint for Exercise 2.36. Then \(\alpha_{n}-a_{n} \leq\left(\alpha_{0}-a_{0}\right) / 2^{n}\) for all \(n \in \mathbb{N} .\) )
Given any \(m \in \mathbb{N}\), show that there is a unique nonnegative integer \(k\) such that \(10^{k} \leq m<10^{k+1}\). Use Exercise \(1.35\) repeatedly to show that there are unique integers \(a_{0}, a_{1}, \ldots, a_{k}\) between 0 and 9 such that $$ m=a_{0}+a_{1}(10)+a_{2}\left(10^{2}\right)+\cdots+a_{k}\left(10^{k}\right) $$
Let \(y\) be any real number with \(0 \leq y<1\). Define sequences \(\left(b_{n}\right)\) and \(\left(y_{n}\right)\) iteratively as follows. Let \(y_{1}:=10 y\) and \(b_{1}:=\left[y_{1}\right]\), and for each \(n \in \mathbb{N}\), let \(y_{n+1}:=10\left(y_{n}-b_{n}\right)\) and \(b_{n+1}:=\left[y_{n+1}\right] .\) Show that \(b_{n}\) are integers with \(0 \leq b_{n} \leq 9\) and \(y_{n}\) are real numbers with \(0 \leq y_{n}<10\) for each \(n \in \mathbb{N}\) and moreover, $$ y=\frac{b_{1}}{10}+\frac{b_{2}}{10^{2}}+\cdots+\frac{b_{n}}{10^{n}}+\frac{y_{n+1}}{10^{n+1}} $$ Deduce that \(0 \leq y_{n+1} / 10^{n+1}<1 / 10^{n}\) for each \(n \in \mathbb{N}\), and consequently, $$ y=\lim _{n \rightarrow \infty}\left(\frac{b_{1}}{10}+\frac{b_{2}}{10^{2}}+\cdots+\frac{b_{n}}{10^{n}}\right) $$ [Note: It is customary to call \(b_{1}, b_{2}, \ldots\), the digits of \(y\) and write the above expression as \(y=0 . b_{1} b_{2} \ldots\) and call it the decimal expansion of \(y\).]
What do you think about this solution?
We value your feedback to improve our textbook solutions.