Chapter 7: Problem 31
Show that if \(|r|<1,\) then $$ \sum_{m=1}^{\infty} r^{m}=\frac{r}{1-r} $$
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 7: Problem 31
Show that if \(|r|<1,\) then $$ \sum_{m=1}^{\infty} r^{m}=\frac{r}{1-r} $$
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
Assume \(n\) is a positive integer. Evaluate \(\left(\begin{array}{l}n \\ n\end{array}\right)\).
Evaluate \(\lim _{n \rightarrow \infty} \frac{7 n^{2}-4 n+3}{3 n^{2}+5 n+9}\).
Find the only arithmetic sequence \(a_{1}, a_{2}, a_{3}, \ldots\) such that the infinite sum \(\sum_{k=1}^{\infty} a_{k}\) exists.
Consider the fable from the beginning of Section 3.4. In this fable, one grain of rice is placed on the first square of a chessboard, then two grains on the second square, then four grains on the third square, and so on, doubling the number of grains placed on each square. Find the smallest number \(n\) such that the total number of grains of rice on the first \(n\) squares of the chessboard is more than 30,000,000 .
Write the series using summation notation (starting with \(k=1\) ). Each series is either an arithmetic series or a geometric series. $$ 2+4+6+\cdots+100 $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.