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:
10.50
Step-by-step explanation:
5% of 10 is 0.5
0.5+10=10.50
Answer:
3/10 or 30%
Step-by-step explanation:
the probability of a...
writer = 13/30
painter = 9/30 or 3/10
musician = 6/30 or 1/5
photographers = 2/30 or 1/15
Answer:
true
Step-by-step explanation:
Answer:
55 when y dived and subtracting
Step-by-step explanation:
djiiwwuwb skis wujw que wjsjs what s
