Chapter 9: Problem 51
Use a graphing utility to graph the first 10 terms of the sequence. $$a_{n}=10(1.5)^{n-1}$$
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 9: Problem 51
Use a graphing utility to graph the first 10 terms of the sequence. $$a_{n}=10(1.5)^{n-1}$$
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
A police department uses computer imaging to create digital photographs of alleged perpetrators from eyewitness accounts. One software package contains 195 hairlines, 99 sets of eyes and eyebrows, 89 noses, 105 mouths, and 74 chins and cheek structures. (a) Find the possible number of different faces that the software could create. (b) An eyewitness can clearly recall the hairline and eyes and eyebrows of a suspect. How many different faces can be produced with this information?
Evaluate \(_{n} C_{r}\) using a graphing utility. \(_{20} C_{4}\)
(a) Compute the following sums of consecutive positive odd integers. \(\begin{aligned}&1+3=\\\&1+3+5=\\\&1+3+5+7=\\\&1+3+5+7+9=\\\&1+3+5+7+9+11=\end{aligned}\) (b) Use the sums in part (a) to make a conjecture about the sums of consecutive positive odd integers. Check your conjecture for the sum $$1+3+5+7+9+11+13=.$$ (c) Verify your conjecture algebraically.
Complete each expression for the apparent \(n\) th term \(a_{n}\) of the sequence. Which expressions are appropriate to represent the cost \(a_{n}\) to buy \(n\) MP3 songs at a cost of \(\$ 1\) per song? Explain. $$\text { (a) } a_{n}=1 \square$$ $$\text { (b) } a_{n}=\frac{ \square 1}{(n-1) !}$$ $$\text { (c) } a_{n}=\sum_{k=1}^{n}$
Determine whether the statement is true or false. Justify your answer. The number of permutations of \(n\) elements can be determined by using the Fundamental Counting Principle.
What do you think about this solution?
We value your feedback to improve our textbook solutions.