Answer:
factor the expression 48g^2 -22gh -15h^2
<h2>
(6g-5h)(8g+3h)<======YouAnswer</h2>
Answer:
what are the things at the end.
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)
Answer:
n - 1
Step-by-step explanation:
(n-1)(n-5) / 2(n+3) ×2(n+3) / (n-5)
Kindly check attached picture for simplification
the answer should be 320.4
