Answer:
x-9=17
Step-by-step explanation:
x=eggs in the fridge
Yes, 23 has an inverse mod 1000 because gcd(23, 1000) = 1 (i.e. they are coprime).
Let <em>x</em> be the inverse. Then <em>x</em> is such that
23<em>x</em> ≡ 1 (mod 1000)
Use the Euclidean algorithm to solve for <em>x</em> :
1000 = 43×23 + 11
23 = 2×11 + 1
→ 1 ≡ 23 - 2×11 (mod 1000)
→ 1 ≡ 23 - 2×(1000 - 43×23) (mod 1000)
→ 1 ≡ 23 - 2×1000 + 86×23 (mod 1000)
→ 1 ≡ 87×23 - 2×1000 ≡ 87×23 (mod 1000)
→ 23⁻¹ ≡ 87 (mod 1000)
Margin of error, e = Z*SD/Sqrt (N), where N = Sample population
Assuming a 95% confidence interval and substituting all the values;
At 95% confidence, Z = 1.96
Therefore,
0.23 = 1.96*1.9/Sqrt (N)
Sqrt (N) = 1.96*1.9/0.23
N = (1.96*1.9/0.23)^2 = 262.16 ≈ 263
Minimum sample size required is 263 students.
Answer:
-4,-2,-1
Step-by-step explanation:
The next term is going to be the previous number divided by two
Answer:
<h3>
The option B) is correct.</h3><h3>
That is the line that makes the sum of the squares of the vertical distances of the data points from the line (the sum of squared residuals) as small as possible is correct answer</h3>
Step-by-step explanation:
Given that " The least-squares regression line "
The least-squares regression line is <u>the line that makes the sum of the squares of the vertical distances of the data points from the line (the sum of squared residuals) as small as possible.</u>
Therefore option B) is correct
