Chapter 2: Problem 7
Is \(.1234567891011121314151617181920212223242526 \cdots\) rational?
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 2: Problem 7
Is \(.1234567891011121314151617181920212223242526 \cdots\) rational?
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
We have seen that it is often a lot harder to find the value of an infinite sum than to show that it exists. Here are some sums that can be handled. $$\text { (a) Calculate } \sum_{n=1}^{\infty}\left(\frac{2}{3}\right)^{n} \text { and } \sum_{n=1}^{\infty}\left(-\frac{2}{3}\right)^{n}$$ $$\begin{aligned} &\text { (b) Prove } \sum_{n=1}^{\infty} \frac{1}{n(n+1)}=1 . \text { Hint: Note that } \sum_{k=1}^{n} \frac{1}{k(k+1)}=\\\ &\sum_{k=1}^{n}\left[\frac{1}{k}-\frac{1}{k+1}\right] \end{aligned}$$ $$\text { (c) Prove that } \sum_{n=1}^{\infty} \frac{n-1}{2^{n+1}}=\frac{1}{2} . \text { Hint: Note that } \frac{k-1}{2^{k+1}}=\frac{k}{2^{k}}-\frac{k+1}{2^{k+1}}$$ (d) Use (c) to calculate \(\sum_{n=1}^{\infty} \frac{n}{2^{n}}\)
Let \(t_{1}=1\) and \(t_{n+1}=\frac{t_{n}^{2}+2}{2 t_{n}}\) for \(n \geq 1 .\) Assume that \(\left(t_{n}\right)\) converges and find the limit.
For points \(x, y\) in \(\mathbb{R}^{k},\) let $$ d_{1}(x, y)=\max \left\\{\left|x_{j}-y_{j}\right|: j=1,2, \ldots, k\right\\} $$ and$$d_{2}(x, y)=\sum_{j=1}^{k}\left|x_{j}-y_{j}\right| $$ (a) Show that \(d_{1}\) and \(d_{2}\) are metrics for \(\mathbb{R}^{k}\). (b) Show that \(d_{1}\) and \(d_{2}\) are complete.
Let \(\left(s_{n}\right)\) be a nondecreasing sequence of positive numbers and define \(\sigma_{n}=\frac{1}{n}\left(s_{1}+s_{2}+\cdots+s_{n}\right) .\) Prove that \(\left(\sigma_{n}\right)\) is a nondecreasing sequence.
Let \(\left(s_{n}\right)\) be a sequence of nonnegative numbers, and for each \(n\) define \(\sigma_{n}=\frac{1}{n}\left(s_{1}+s_{2}+\cdots+s_{n}\right)\). (a) Show that $$\lim \inf s_{n} \leq \lim \inf \sigma_{n} \leq \lim \sup \sigma_{n} \leq \lim \sup s_{n}$$ Hint: For the last inequality, show first that \(M>N\) implies \(\sup \left\\{\sigma_{n}: n>M\right\\} \leq \frac{1}{M}\left(s_{1}+s_{2}+\cdots+s_{N}\right)+\sup \left\\{s_{n}: n>N\right\\}\). (b) Show that if \(\lim s_{n}\) exists, then \(\lim \sigma_{n}\) exists and \(\lim \sigma_{n}=\) \(\lim s_{n}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.