Answer:
The confidence interval is 27.5 hg less than mu less than 29.1 hg
(A) Yes, because the confidence interval limits are not similar.
Step-by-step explanation:
Confidence interval is given as mean +/- margin of error (E)
mean = 28.3 hg
sd = 6.1 hg
n = 202
degree of freedom = n-1 = 202-1 = 201
confidence level (C) = 95% = 0.95
significance level = 1 - C = 1 - 0.95 = 0.05 = 5%
critical value corresponding to 201 degrees of freedom and 5% significance level is 1.97196
E = t×sd/√n = 1.97196×6.1/√202 = 0.8 hg
Lower limit = mean - E = 28.3 0.8 = 27.5 hg
Upper limit = mean + E = 28.3 + 0.8 = 29.1 hg
95% confidence interval is (27.5, 29.1)
When mean is 28.3, sd = 6.1 and n = 202, the confidence limits are 27.5 and 29.1 which is different from 27.8 and 29.6 which are the confidence limits when mean is 28.7, sd = 1.8 and n = 17
Answer:
Good! thanks
Step-by-step explanation:
Answer:
The number zero (0) is a rational number.
Step-by-step explanation:
The number zero can be written as a ratio of two integers, thus it is indeed a rational number. This statement is TRUE.
ANSWER
The general solution is
, where
is an integer
<u>EXPLANATION</u>
In order to solve the linear congruence;

We need to determine the inverse of
(which is a Bézout coefficient for 33).
To do that we must first use the Euclidean Algorithm to verify the existence of the inverse by showing that;

Now, here we go;



The greatest common divisor is the last remainder before the remainder of zero.
Hence, the
.
We now express this gcd of 1 as a linear combination of 33 and 280.
We can achieve this by making all the non zero remainders the subject and making a backward substitution.


Equation (2) in equation (1) gives,



The above linear combination tells us that
is the inverse of
.
Now we multiply both sides of our congruence relation by
.

This implies that;

.
Since this is modulo, the solution is not unique because any integral addition or subtraction of the modulo (280 in this case) produces an equivalent solution.
Therefore the general solution is,
, where
is an integer
21/100 is in simplest form.