You can try to show this by induction:
• According to the given closed form, we have
, which agrees with the initial value <em>S</em>₁ = 1.
• Assume the closed form is correct for all <em>n</em> up to <em>n</em> = <em>k</em>. In particular, we assume

and

We want to then use this assumption to show the closed form is correct for <em>n</em> = <em>k</em> + 1, or

From the given recurrence, we know

so that






which is what we needed. QED
Answer:
Step-by-step explanation:
7-x=-2
-x=-2-7
-x=-9
x=9
Ugh, these questions.
21x^3y^4 + 15x^2y^2 - 12xy^3
3xy^2 (7x^2y^2 + 5x - 4y)
Clearing up clutter...
3xy² (7x²y² + 5x - 4y)
That's your answer. Thanks for working my brain. ;)
Answer:
true
Step-by-step explanation:
Answer:
78.962
Step-by-step explanation:
its just moving the decimal