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.
You answer would be 27, if I did my maths correct.
You get 27 by doing:
9*4=36
36-9=27
Correct me if I am wrong thank you!
Answer:
4 x 5
Step-by-step explanation:
Answer:
c
Step-by-step explanation:
Answer:
Step-by-step explanation:
it's 3 hmmm it tells you rise over run.. just about where they are asking for the answer.. what do you not get about the question?
