Answer:
15
Step-by-step explanation:
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)
Which pair shows equivalent expressions?
A.2(2/5x + 2)=2 2/5x + 1
B.2(2/5x + 2)=4/5x + 4
C.2(2/5x + 4)=4/5x + 2
D.2(2/5x + 4)=2 2/5x + 8
Solution:
Let us distribute 2 inside the parenthesis.
That is, we use distributive property:
a(b+c)=ab+ac
So, 
Answer:Option (b)
Applying distributive property, a(b+c)=ab+ac
So, Option (B) is correct.
B. D=0.25n + 25
D=total n=number of hours 0.25=price per hour 25=the one time fee
Answer:
An equilateral triangle has 3 lines of symmetry
Hope this helps
Step-by-step explanation:
