I'll give the brainiest! HELP
2 answers:
You might be interested in
Answer:
a: z = -1.936
b: 0.0265
d: z < -1.645
Reject H0 if z < -1.645
Step-by-step explanation:
We are given:
H0: µ = 20
HA: µ < 20
n = 60, sample mean: 19.6, σ = 1.6
Since the alternate hypothesis has a < sign in it, it is a left tailed test. The < or > sign in the alternate hypothesis points towards the rejection region.
For a: We need to calculate the test statistic for our situation. This is done with a z-score formula for samples.
For b: we need to use the z-score table to look up the p-value for the score we calculate in part a. The p-value is 0.0265. This means that there is only about a 2.65% chance that the sample values were a result of random chance.
For d: Since the significance level is 0.05, and this is a one tailed test, we have a critical value of z < - 1.645. This means that if the z-score we calculate in part a is less than -1.645, we will reject the null hypothesis
See attached photo for all the calculations!
The total number of gifts = x+y.
The inequality is:
Key chains cost $1, Magnets $0.50
Total Cost = x + 0.5y
Inequality is:
Without graphing you can solve system by using substitution:
This is one solution where the maximum x value is given.
So the most keychains that can be purchased is 16. However, because magnets are cheaper, more can be purchased as long as cost remains under 20.
If you solve both inequalities for "y", you get the upper and lower bounds for how many magnets can be purchased given a quantity of keychains.
This is complete solution which gives all possible combinations.
(Graph is Attached)
The inequality is:
Key chains cost $1, Magnets $0.50
Total Cost = x + 0.5y
Inequality is:
Without graphing you can solve system by using substitution:
This is one solution where the maximum x value is given.
So the most keychains that can be purchased is 16. However, because magnets are cheaper, more can be purchased as long as cost remains under 20.
If you solve both inequalities for "y", you get the upper and lower bounds for how many magnets can be purchased given a quantity of keychains.
This is complete solution which gives all possible combinations.
(Graph is Attached)