Hey there,
6x + 5 (x-2)
6x + 5x - 10
11x - 10
3x - 5 - x + 9
3x - x - 5 + 9
2x + 4
3a + 5 - 8a + 1
3 (-1) + 5 - 8(-1) + 1
-3 + 5 + 8 + 1
11
Hope this helps :))
<em>~Top♥</em>
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)