ΘρϵηΠατπ

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 k∈ℤ≥a
Let k∈ℤ≥a, if k=a, then we know that P(k) is true, otherwise if k>a, then k=a+r for some r∈ℕ1, 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)n∈ℕ0 is a sequence such that for any k∈ℕ1 we have xk:=axk−1+b, where a,b∈ℝ, prove that
xk=ak(x0−b1−a)+b1−a

We proceed with a proof by induction so let k∈ℕ1, suppose that k=1, thus by the definition of x1 we know it's equal to a⋅x0+b, now some algebra: a⋅x0+b=a⋅x0+b(1−a1−a)=a1⋅x0−ba1−a+b1−a=ak(x0−b1−a)+b1−a, which is what we needed to show.

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

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(x0−b1−a)+b1−a, so therefore xk+1=a[ak(x0−b1−a)+b1−a]+b.

We'll start by multiplying everything out and then seeing what we get: a[ak(x0−b1−a)+b1−a]+b=ak+1(x0−b1−a)+ab1−a+b=ak+1(x0−b1−a)+ab1−a+b(1−a1−a) =ak+1(x0−b1−a)+ab+b−ab1−a =ak+1(x0−b1−a)+b1−a 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 k∈ℕ1, as needed.