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:
$1,920
Step-by-step explanation:
you multiply 12 by 40. then, assuming a typical month is 4 weeks, you multiply that number by 4.
The two variables are time (x) and distance (y)
And the answer is they will meet after 1 mile
The function of the aunt and uncle is y=25x+5
The function of yourself is y2=30x
Since you want to know when you’ll meet, you just resolve y=y2 or 25x+5=30x
Wich will be x=1 so 1 mile
Answer:
of course 34
Step-by-step explanation:
