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:
Pythagorean Theorem:
a^2 + b^2 = c^2
6^2 + b^2 = 12^2
36 + b^2 = 144
b^2 = 108
b = 10.4
Let me know if this helps!
Answer:
v= 17
Step-by-step explanation:
Start with the given equation.
19v – 18 = 16 + 17v
Move -18 to the other side, and swap it's sign.
19v = 16 + 18 + 17v
Move 17v to the other side and swap it's sign.
19v - 17v = 16 + 18
Combine like terms.
2v = 34
Divide by 2v.
v = 17
Answer:
Example = ( 12, 1 )
Step-by-step explanation:
There are many possible solutions to this equation, and all you would have to do to determine the ordered pair, is satisfy the following criteria -

Take a look at a graph of the line y = 1 / 6x - 1. Any ordered pair that lies on this line is a solution to the equation. The " criteria " is that the ordered pair must lie on this line. Let me give you an example, ( 12, 1 ).
<u><em>Hope that helps!</em></u>
Answer:
y=3x=4x
Step-by-step explanation:
4x-50