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:
Cos B = 4/5
Step-by-step explanation:
From the question given above, the following data were obtained:
Sine B = 3/5
Cos B =?
Recall:
Sine B = Opposite / Hypothenus
Sine B = 3/5
Therefore,
Opposite = 3
Hypothenus = 5
Next, we shall determine the Adjacent. This can be obtained as follow:
Opposite = 3
Hypothenus = 5
Adjacent =?
Hypo² = Adj² + Opp²
5² = Adj² + 3²
25 = Adj² + 9
Collect like terms
Adj² = 25 – 9
Adj² = 16
Take the square root of both side
Adj = √16
Adjacent = 4
Finally, we shall determine Cos B. This can be obtained as follow:
Hypothenus = 5
Adjacent = 4
Cos B =?
Cos B = Adjacent / Hypothenus
Cos B = 4/5
Answer:
the 1st one
Step-by-step explanation:
I passes it in the quiz
