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:
87 x 54 - 200 divided by 7
solving-4669[3|7] , 4669.428571
answer-32686.7
Step-by-step explanation:
3/7*5/6
cross out 3 and 6
divide by 3
3/3= 1
6/3= 2
1/7*5/2
mutiply the denominators together
7*2= 14
mutiply the numerators together
1*5= 5
Answer:
5/14
<h3><u>
Answer:</u></h3>
<h3><u>
Step-by-step explanation:</u></h3>
<em>There can be many ways to find the number.</em><em> I have found the number with the help of fractions and multiplication. </em><em>Below is the solution to your problem.</em>
- 80 = 20/100
- => 5 x 80 = 20 x 5/100
- => 400
<h3><u>
Conclusion:</u></h3>
<em>Hence, 80 is 20% of 400. </em><em>I hope my method helped you.</em>
Answer: (0,1)
Step-by-step explanation:
The initial value is simply the starting value of the graph, so it is where the graph starts
