That’s the correct answer
Answer:
40320 different ways
Step-by-step explanation:
That problem is a permutation one
We have eight people to occupy one position in a team, without any constraint at all
So
Total number of events = P(8)
P (8) = 8!
P (8) = 8*7*6*5*4*3*2*1
P (8) = 40320 different ways
Answer:
A
Step-by-step explanation:
To translate a graph right you -3 from x. To translate a graph up you +4.
A couple are 5, 7, 17, 19, 23...
Answer:
Kindly check explanation
Step-by-step explanation:
Given the following :
Sample mean(x) = 23500
Sample standard deviation (sd) = 3900
Sample size (n) = 20
Population mean (m) = 20,000
Null hypothesis : m = 20000
H1: m > 20000
To obtain the z-score :
(population mean - sample mean) / (sample standard deviation /√sample size)
(x - m) / (sd/√n)
(23500 - 20000) / (3900 / √20)
3500 / (3900 /4.4721359)
3500 / 872.06651
= 4.0134
Get the P value to know if to reject or accept the null:
P(z > 4.0134) = 1 - P(z < 4.0134)
P(z < 4.0134) = 1
1 - P(z < 4.0134) = 1 - 1 =0
Since P value is < alpha, we reject the null.
Hence average is > 20000
