Vertical Asymptotes:
x=0
x=0
Horizontal Asymptotes:
y=0
y=0
No Oblique Asymptotes
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)
9x-7=-7
+7 +7
___________
9x= 0
_ _
9 9
x=0
V = lwh
V = (x + 2)(x + 3)(x)
V = (x)(x^2 + 3x + 2x + 6)
V = (x^3 + 3x^2 + 2x^2 + 6x)
V = x^3 + 5x^2 + 6x
All you do is foil the dimensions together and then combine like terms. Hope this helps!
Answer: 3.499 now 3.079 is correct
