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:
x = 8°
y = 21°
Step-by-step explanation:
27 + 3y = 90
3y = 63
y = 21°
x + 8x + 18 = 90
9x = 72
x = 8°
the 10th questions answer is aaa congruence
Well, they're both divisible by 2 (24 ÷ 2 = 12) (90 ÷ 2 = 45)
first pemdas
parentheses exponents multiply divide addition and subtraction
so the answer is 7
