Making a proof
for $n>7$
$$2^n>n^2+4n+5$$
Step 1
For $$n=7$$
$$2^7=128>7^2+4(7)+5=82$$
It is TRUE for $n=7$
Step 2
Inductive Hypotesis: It must be true for $n=k$
$$2^k>k^2+4k+5$$
Step 3
3.1:
$$2^{k+1}>(k+1)^2+4(k+1)+5$$
But, after this it was said that...
It is needed to multiply by $2$ the expression in the induction step 2
3.2:
$$2^{k+1}>2k^2+8k+10$$
Make some transformation (that also do not understand):
3.3:
$$2^{k+1}>(k+1)^2+4(k+1)+5+k^2+2k$$
Making with that the proof by understanding that $k^2+2k>0$ for any $k\ge7$ We can deduce that $2^{k+1}>(k+1)^2+4(k+1)+5$
Questions
a: It is right to go from 2 to 3.1? In which way?
b: How we go from 3.1 to 3.2?
c: How we go from 3.2 to 3.3?
Source: http://esaez.mat.utfsm.cl/iii.pdf, August, 2013, pp.2