Answer: 720 ways
Step-by-step explanation:
Given
A train has 1 main engine and remaining 6 train cars
If the engine is always in the front the remaining train cars can be arranged is

Answer:
H0 : μ = 0.5
H0 : μ > 0.5
Kindly check explanation
Step-by-step explanation:
H0 : μ = 0.5
H0 : μ > 0.5
We perform a right tailed test :
Sample proportion :
Number of games won, x = 142
Number of games, n = 250
phat = x / n = 142 / 250 = 0.568 = 56.8%
Yes, it is consistent
Test statistic :
(phat - p) * √Phat(1-Phat)/n
1 -Phat = 1 -0.568 = 0.432
(0.568 - 0.5) /√(0.568*0.432)/250
0.068 / 0.0313289
= 2.17
The Pvalue using the z test statistic :
Pvalue = 0.015
α = 0.03
Since ;
Pvalue < α ; We reject the null and conclude that teams tend to win more often when they play at home.
Answer:
a) 0.125
b) 7
c) 0.875 hr
d) 1 hr
e) 0.875
Step-by-step explanation:l
Given:
Arrival rate, λ = 7
Service rate, μ = 8
a) probability that no requests for assistance are in the system (system is idle).
Let's first find p.
a) ρ = λ/μ

Probability that the system is idle =
1 - p
= 1 - 0.875
=0.125
probability that no requests for assistance are in the system is 0.125
b) average number of requests that will be waiting for service will be given as:
λ/(μ - λ)
= 7
(c) Average time in minutes before service
= λ/[μ(μ - λ)]
= 0.875 hour
(d) average time at the reference desk in minutes.
Average time in the system js given as: 1/(μ - λ)

= 1 hour
(e) Probability that a new arrival has to wait for service will be:
λ/μ =
= 0.875
It’s A I just took that trust me