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:
so first you multiply how much she jogged then put the in infront of the number
I think the answer would be C :$:$:$:$:$:$:$:$:&:$
There is no one answer (ordered pair) to this equation and the answer is found by graphing or trying out different values for each variable. Anyway, here are some solutions; (1,0), (4,1), (0,-1/3).