Suppose
![a_n](https://tex.z-dn.net/?f=a_n)
is the number of possible combinations for a suitcase with a lock consisting of
![n](https://tex.z-dn.net/?f=n)
wheels. If you added one more wheel onto the lock, there would only be 9 allowed possible digits you can use for the new wheel. This means the number of possible combinations for
![n+1](https://tex.z-dn.net/?f=n%2B1)
wheels, or
![a_{n+1}](https://tex.z-dn.net/?f=a_%7Bn%2B1%7D)
is given recursively by the formula
![a_{n+1}=9a_n](https://tex.z-dn.net/?f=a_%7Bn%2B1%7D%3D9a_n)
starting with
![a_1=10](https://tex.z-dn.net/?f=a_1%3D10)
(because you can start the combination with any one of the ten available digits 0 through 9).
For example, if the combination for a 3-wheel lock is 282, then a 4-wheel lock can be any one of 2820, 2821, 2823, ..., 2829 (nine possibilities depending on the second-to-last digit).
By substitution, you have
![a_{n+1}=9a_n=9^2a_{n-1}=9^3a_{n-2}=\cdots=9^na_1=10\times9^n](https://tex.z-dn.net/?f=a_%7Bn%2B1%7D%3D9a_n%3D9%5E2a_%7Bn-1%7D%3D9%5E3a_%7Bn-2%7D%3D%5Ccdots%3D9%5Ena_1%3D10%5Ctimes9%5En)
This means a lock with 55 wheels will have
![a_{55}=10\times9^{54}](https://tex.z-dn.net/?f=a_%7B55%7D%3D10%5Ctimes9%5E%7B54%7D)
possible combinations (a number with 53 digits).
Answer: -3
Step-by-step explanation:
The answer is b, since that's the only other function there that involves using absolute value
Answer:
8 ft
Step-by-step explanation:
if we made this into a rectangle (pretend you chop off one of the triangles and glue it to the other one to make a long rectangle), the length would be 10+4.5, or 14.5. to find what h is, we can just divide 116 by 14.5. our answer is 8.