ΘρϵηΠατπ

induction
Suppose that a and P(k):a{𝐓,𝐅} is a predicate, if P(a) holds true and P(k)P(k+1), then P(k) holds true for all ka
Let ka, if k=a, then we know that P(k) is true, otherwise if k>a, then k=a+r for some r1, therefore P(a)P(a+1), so we know that P(a+1) is true, then applying the same reasonging P(a+1)P(a+2) so P(a+2) is true, thus we can see that after r iterations of that P(a+r)=P(k) is also true.
linear recursive sum
Suppose that (xn)n0 is a sequence such that for any k1 we have xk:=axk1+b, where a,b, prove that
xk=ak(x0b1a)+b1a

We proceed with a proof by induction so let k1, suppose that k=1, thus by the definition of x1 we know it's equal to ax0+b, now some algebra: ax0+b=ax0+b(1a1a)=a1x0ba1a+b1a=ak(x0b1a)+b1a, which is what we needed to show.

Now for the induction step, so suppose that k>1 and that xk=ak(x0b1a)+b1a holds true (and call it our Induction Hypothesis), we'll now show that xk+1=ak+1(x0b1a)+b1a.

First recall the very definition of xk+1 which is that xk+1=axk+b, but from our induction hypothesis, we know that xk=ak(x0b1a)+b1a, so therefore xk+1=a[ak(x0b1a)+b1a]+b.

We'll start by multiplying everything out and then seeing what we get: a[ak(x0b1a)+b1a]+b=ak+1(x0b1a)+ab1a+b=ak+1(x0b1a)+ab1a+b(1a1a) =ak+1(x0b1a)+ab+bab1a =ak+1(x0b1a)+b1a which is exactly what we set out to prove.

Therefore since the statement holds for k=1, and if when it holds for k then it also holds for k+1, then the statement is true for all k1, as needed.