Answer:
G = 1, 9.
Step-by-step explanation:
There are two cases to this problem: G is either to the left or right of E. If G is to the left of E, then G = 5 - 4 = 1 and if G is to the right of E, then G = 5 + 4 = 9. Therefore, our answer is G = 1, 9.
Answer:
answer is a
Step-by-step explanation:
answer would be a because a reflection does not change the size or shape of any figure
Its 90% of 4 days I think.
Hope I helped C:
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)
