C.) is the correct answer! I’m 100% sure!
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:
20%
that should be the answer to the question
Answer:
it would be Y= -2x+4
Step-by-step explanation:
To begin, we know that the b value is 4, because that is the x-intercept that is information given, so we can atomatically put that in.
Next we need to find the m value, which can be found by knowing the rules of a perpendicular eqution. to change it you must change the 1/2 and flip the equation and change the signs
soooooo 1/2 would change into 2/1 which is 2 and we would addd the negative sign so
Y=-2x+4