QUESTION:
The code for a lock consists of 5 digits (0-9). The last number cannot be 0 or 1. How many different codes are possible.
ANSWER:
Since in this particular scenario, the order of the numbers matter, we can use the Permutation Formula:–
- P(n,r) = n!/(n−r)! where n is the number of numbers in the set and r is the subset.
Since there are 10 digits to choose from, we can assume that n = 10.
Similarly, since there are 5 numbers that need to be chosen out of the ten, we can assume that r = 5.
Now, plug these values into the formula and solve:
= 10!(10−5)!
= 10!5!
= 10⋅9⋅8⋅7⋅6
= 30240.
Answer:
60h
Step-by-step explanation:
180/3: Divide 180 by 3 to get the rate of change.
Answer:
Line up the numbers on the right - do not align the decimal points.
Starting on the right, multiply each digit in the top number by each digit in the bottom number, just as with whole numbers.
Add the products.
Step-by-step explanation:
Answer:
he will have saved 45$
Step-by-step explanation:
if you take 2 from every 5 and 5 x 15 = 150, you would do 2 x 15 and get 30. So, the answer is 30$
