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)
Answer: y = 2x + 5
Step-by-step explanation:
Answer: The resultant would be the sum and the difference between the vectors.
Step by step explanation: 1. The possible resultant is between the sum of the 2 vectors and the difference between the two vectors.
2. The greatest magnitude is when the vectors lie in the same direction and the sum would be the scalar sum of the two vectors. The angle between the two would be zero degree.
Hii!
So I did this and I have A!
A: You cannot get the mean from the graph but you CAN get the third quartile!
B: To find the interquartile range (IQR) we subtract the third and first quartiles:
60-35 = 25
C: An outlier would be much larger than the rest of the data or much smaller than the rest of the data. An outlier would make the "whisker" portion longer and could potentially slightly shift the box.