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:
Following are the solution to the given question:
Step-by-step explanation:
Please find the complete question in the attached file.
The testing states value is:
therefor the 
Through out the above equation its values Doesn't rejects the H_0 value, and its sample value doesn't support the claim that although the configuration of its dependent variable has been infringed.
Answer:
1.8 × 40 + 32 = 104
if i got it wrong than your teacher is on crack
Answer:
Using tally marks
Step-by-step explanation:
Missing information;
Number of pets are;
3,0,1,4,4,1,2,0,2,2,0,2,0,1,3,1,2,1,1,3
Find;
Ungroups frequency distribution table
Computation:
<u>Number of pets Tally Frequency</u>
0 IIII 4
1 IIIII I 6
2 IIIII 5
3 III 3
4 II 2
