Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
Approximately
revolutions (rounded to the nearest whole number.)
Step-by-step explanation:
Convert the diameter of this wheel to meters:
.
Circumference of this wheel:
.
Distance travelled in one hour:
.
Number of revolutions required for covering that distance:
.
Answer:
5% but not sure
Step-by-step explanation:
80+5+10
If each player will receive 7/8 of a cup, and there are a total of 20 cups of lemonade, then the number of servings that can be made is equal to:
20 cups divided by (7/8 cup per player)
20 / (7/8) = 20 * (8/7) = 160/7 = 22 and 6/7 (round down since we're looking for complete servings)
This means that 22 complete servings can be made.
Answer:
Test statistic = -2.25
P-value = 0.0199
Step-by-step explanation:
We are given the following in the question:
Population mean, μ = 450 gram
Sample mean,
= 441 grams
Sample size, n = 16
Alpha, α = 0.05
Sample variance = 256

First, we design the null and the alternate hypothesis
We use one-tailed t test to perform this hypothesis.
Formula:
Putting all the values, we have
Now,
Degree of freedom =

We can calculate the p-value from the table as:
P-value = 0.0199
Conclusion:
Since the p-value is smaller than the significance level we fail to accept the null hypothesis and reject it.
Thus, there is enough evidence to support the claim that the machine is under filling the bags .