Suppose

is the number of possible combinations for a suitcase with a lock consisting of

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

wheels, or

is given recursively by the formula

starting with

(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

This means a lock with 55 wheels will have

possible combinations (a number with 53 digits).
Answer:
35 pounds of tea for 80 cents.
Step-by-step explanation:
Equation::
value + value = value
80x + 60(50-x) = 74*50
80x + 60*50 - 60x = 74*50
20x = 14*50
x = 35 lbs (amt. of 80 cent tea to use)
50-x = 15 lbs (amt. of 60 cent tean to use)
Answer:
h, j2, f, g, j1, i, k, l (ell)
Step-by-step explanation:
The horizontal asymptote is the constant term of the quotient of the numerator and denominator functions. Generally, it it is the coefficient of the ratio of the highest-degree terms (when they have the same degree). It is zero if the denominator has a higher degree (as for function f(x)).
We note there are two functions named j(x). The one appearing second from the top of the list we'll call j1(x); the one third from the bottom we'll call j2(x).
The horizontal asymptotes are ...
- h(x): 16x/(-4x) = -4
- j1(x): 2x^2/x^2 = 2
- i(x): 3x/x = 3
- l(x): 15x/(2x) = 7.5
- g(x): x^2/x^2 = 1
- j2(x): 3x^2/-x^2 = -3
- f(x): 0x^2/(12x^2) = 0
- k(x): 5x^2/x^2 = 5
So, the ordering least-to-greatest is ...
h (-4), j2 (-3), f (0), g (1), j1 (2), i (3), k (5), l (7.5)
Answer:
Step-by-step explanation:
G(3)= 6+9-2=13