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
The answer to the question
Answer:
Can't see the picture because old computer but isn't 16 minus 17 = -1 (negative 1)
Step-by-step explanation:
Answer:
A
Step-by-step explanation:
I agree with Katie because number is legs is directly proportional to the number of ants.
1 ant has 6 legs.
So, 2 ants have 6 *2 = 12
3 ants have 6*3 = 18