Answer:
5 units. Since they have the same y coordinate the x coordinate determines the distance from each other. In the case 9-4=5.
Answer:
a. H0:μ1≥μ2
Ha:μ1<μ2
b. t=-3.076
c. Rejection region=[tcalculated<−1.717]
Reject H0
Step-by-step explanation:
a)
As the score for group 1 is lower than group 2,
Null hypothesis: H0:μ1≥μ2
Alternative hypothesis: H1:μ1<μ2
b) t test statistic for equal variances
t=(xbar1-xbar2)-(μ1-μ2)/sqrt[{1/n1+1/n2}*{((n1-1)s1²+(n2-1)s2²)/n1+n2-2}
t=63.3-70.2/sqrt[{1/11+1/13}*{((11-1)3.7²+(13-1)6.6²)/11+13-2}
t=-6.9/sqrt[{0.091+0.077}{136.9+522.72/22}]
t=-3.076
c. α=0.05, df=22
t(0.05,22)=-1.717
The rejection region is t calculated<t critical value
t<-1.717
We can see that the calculated value of t-statistic falls in rejection region and so we reject the null hypothesis at 5% significance level.
Answer:
= desaster
Step-by-step explanation:
My way of prime factorizing is to divide the number you are trying to find by the smallest prime factor. Take your result and divide again by the smallest prime factor of that result. Keep repeating this process until you get a prime number that can't be divided any further. The numbers you divided by and your final prime number are your prime factors. Remember that 1 is not a prime number!
It may help to see this using a factor tree (see image).
2 is the smallest prime number that divides 24, so break 24 down into 2 x 12. Now break down 12. Once again, 2 is the smallest prime number that divides 12. Break 12 down into 2 x 6. Now break down 6. Again, 2 is the smallest prime that divides 6, so break 6 down into 2 x 3. Since 3 is also prime, you've completely prime factorized 24. Your prime factors are circled in blue in the picture. Remember your final factors must all be prime - that's why it's called prime factorization!
Answer:
the answer to this is D) 61.2
