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).
Step-by-step explanation:
oh, come on. you can just use common sense.
a local minimum is a point where the curve goes down to, and then turns around and starts to go up again. that point in the middle, where it turns around and does not go down any further, is the minimum.
for the maximum the same thing applies, just in the other direction (the curve goes up and turns around to go back down again).
a)
the local minimum values (y) are
-2, -1
b)
the values of x where it had these minimum values are
-1, +3
Answer:
B.p^15/q^9
Step-by-step explanation:
p(p^-7•q^3)^-2•q^-3
answer: B. p^15/q^9
Answer:

Step-by-step explanation:

To get
you needed to divide the numerator and denominator by 3.