induction
Suppose that and is a predicate, if holds true and , then holds true for all
Let , if , then we know that is true, otherwise if , then for some , therefore , so we know that is true, then applying the same reasonging so is true, thus we can see that after iterations of that is also true.
linear recursive sum
Suppose that is a sequence such that for any we have , where , prove that
We proceed with a proof by induction so let , suppose that , thus by the definition of we know it's equal to , now some algebra: , which is what we needed to show.
Now for the induction step, so suppose that and that holds true (and call it our Induction Hypothesis), we'll now show that .
First recall the very definition of which is that , but from our induction hypothesis, we know that , so therefore .
We'll start by multiplying everything out and then seeing what we get: which is exactly what we set out to prove.
Therefore since the statement holds for , and if when it holds for then it also holds for , then the statement is true for all , as needed.