Chapter 10: Problem 5
If Laura invests \(\$ 100\) at \(6 \%\) interest compounded quarterly, how many months must she wait for her money to double? (She cannot withdraw the money before the quarter is up.)
/*! 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 10: Problem 5
If Laura invests \(\$ 100\) at \(6 \%\) interest compounded quarterly, how many months must she wait for her money to double? (She cannot withdraw the money before the quarter is up.)
All the tools & learning materials you need for study success - in one app.
Get started for free
The number of bacteria in a culture is 1000 (approximately), and this number increases \(250 \%\) every two hours. Use a recurrence relation to determine the number of bacteria present after one day.
A particle moves horizontally to the right. For \(n \in \mathbf{Z}^{+}\), the distance the particle travels in the \((n+1)\) st second is equal to twice the distance it travels during the \(n\)th second. If \(x_{n}, n \geq 0\), denotes the position of the particle at the start of the \((n+1)\) st second, find and solve a recurrence relation for \(x_{n}\), where \(x_{0}=1\) and \(x_{1}=5\).
In each of the following, \(f: \mathbf{Z}^{+} \rightarrow \mathbf{R}\). Solve for \(f(n)\) relative to the given set \(S\), and determine the appropriate "big- Oh" form for \(f\) on \(S\). a) \(f(1)=0\) \(f(n)=2 f(n / 5)+3, \quad n=5,25,125, \ldots\) \(s=\left\\{5^{5} \mid i \in \mathbf{N}\right\\}\) b) \(f(1)=1\) \(f(n)=f(n / 2)+2, \quad n=2,4,8, \ldots\)
For \(n\) distinct objects, let \(a(n, r)\) denote the number of ways we can select, without repetition, \(r\) of the \(n\) objects when \(0 \leq r \leq n\). Here \(a(n, r)=0\) when \(r>n\). Use the recurrence relation \(a(n, r)=a(n-1, r-1)+a(n-1, r)\), where \(n \geq 1\) and \(r \geq 1\), to show that \(f(x)=(1+x)^{n}\) generates \(a(n, r), r \geq 0\).
For \(n \geq 0\), draw \(n\) ovals in the plane so that each oval intersects each of the others in exactly two points and no three ovals are coincident. If \(a_{n}\) denotes the number of regions in the plane that results from these \(n\) ovals, find and solve a recurrence relation for \(a_{n}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.