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:
60
Step-by-step explanation:
Step 1: Write expression
4 × 3 × 5
Step 2: Multiply
12 × 5
60
Answer:
x = 1
y = 5
Step-by-step explanation:
x + y = 4 __ (1)
2x + y = 3 __ (2)
equation (1) x 2, (2) x 1
2x + 2y = 8
2x + y = 3
0 + y = 5
y= 5 (ANS)
x + y = 4
x + 5 = 4
x = 5 - 4
x = 1 (ANS)
I HOPE MY ANSWER IS CORRECT IF NOT I APOLOGIZE.
First one is y=4x and the second one is y=2x
What prism I think you forgot something