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:
1.
-2 = x/4 + 1
Subtract 1 from both sides:
-2 - 1 = x/4 + 1 - 1
-3 = x/4
Multiply both sides by 4:
-3 * 4 = x/4 * 4
-12 = x
2.
3x+5
3.
X= 12 or 18
This could be read two different ways.
0=2/3x-12
12=2/3x
12÷2/3=x
12*3/2=x
18=x
—-OR—-
0=2/3(x-12)
0=2/3x-8
8=2/3x
8÷2/3=x
8*3/2=x
12=x
Answer:
Step-by-step explanation:
Ok but where is the question
The answer to your question is x=-2y+4
