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:
Let the cost of orange be X and cost of cherry be y
3x + 9y = 78
8x + 4y = 58
Solving equation using elimination method
multiplying eq 1 with 8 and eq 2 with 3
8(3x + 9y ) = 78(8)
3( 8x + 4y) = 3(58)
24x + 72 y = 624
24x + 12y = 174
subtracting,
60 y = 450
y = 7.5
3x + 9(7.5) = 78
3x + 67.5 = 78
3x = 78 - 67.5
3x = 10.5
x = 3.5
<h2>Box of orange = $3.5 </h2><h2>Box of cherry = $7.5</h2>
Answer:
Step-by-step explanation:
Answer:
x = 11
Step-by-step explanation:
- Vertically opposite angles are equal
- Angles around a point add up to 360°
Therefore, 
