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:
-3
Step-by-step explanation:
coefficent of x enough to understand slope
9514 1404 393
Answer:
see attached
Step-by-step explanation:
I like to use a spreadsheet for repetitive calculations. The distances are computed from the distance formula:
d = √((x2 -x1)^2 +(y2 -y1)^2)
The results are shown in the second attachment. The drawing in the first attachment has the lengths rounded to the nearest tenth.
Answer: 6
Step-by-step explanation: