Answer:
look up the paper because i had that same paper
Step-by-step explanation:
Answer:
387
Step-by-step explanation:
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:
a) For this case we define the random variable as X ="waiting time during peak hours" and we know that this distribution follows an uniform distribution:

Where a and b represent the limits of the distribution.
b) 
And the height for this case would be 0.125
Step-by-step explanation:
Part a
For this case we define the random variable as X ="waiting time during peak hours" and we know that this distribution follows an uniform distribution:

Where a and b represent the limits of the distribution.
Part b
For this case the density function would be given by:

And the height for this case would be 0.125
And
for other case.
The cumulative distribution function would be given by:



Answer:
The best fit line is 
Step-by-step explanation:
We are given,
The table representing the number of miles run in different weeks is,
Week Miles Run
1 5
2 8
4 13
6 15
8 19
10 20
Using the linear regression calculator, we see that,
<h3>The equation of the line best fit for the data is

.</h3>