One of the topics of my algebra subject is Proof by Induction. When it comes to proving equalities, whether they are a series, factorial or other types I had no problem doing so. But when it came to doing the same for inequalities I got stuck. I tried to watch videos on its proving process, read the answers I could find in this site, but there's something I'm not grasping as I'm not capable of finishing the proof I'm working on.
That's the following, given: $$ 2^n > n^2 + 4n + 5 \ for \ n > 6 \ where \ n \in \Bbb N $$
First, I compacted the expression to this: $ 2^n > (n + 2)^2 + 1 $
Then, I did the: $ \pmb{Base \ Case}: $ $$ P(7): 2^7 > (7 + 2)^2 + 1 = 128 > 82 $$
Which results to be True.
Then I established the following $\pmb{assumption} $ to be True for $ n = k $: $$ P(k): 2^k > (k+2)^2 + 1 \ where \ n > 6 $$
And went on to $\pmb{prove}$ for $ n = k + 1 $: $$ P(k + 1): 2^{k+1} > ((k+1)+2)^2 + 1 $$
So here started with the $ LHS = 2^{k+1} = 2(2^k)$
Then proceeded with the $ RHS = ((k+1)+2)^2 + 1 = (k+3)^2 + 1 $
But, as all the explanation I got about the Induction principle has been about its generic steps and using equalities, I don't really know how to proceed or what steps to follow to accomplish the proof nor what to do with the expressions I have.
So what I ask for is an explanation of how should I proceed when I encounter an equality like the one I'm stuck with, because If I only get the answer now, later on, I'll be equally stuck.
We have $$2^n>n^2+4n+5$$ and we must prove that $$2^{n+1}>(n+1)^2+4(n+1)+5$$ multiplying our first inequality by $2$ we get $$2^{n+1}>2n^2+8n+10$$ so it remains to prove that $$2n^2+8n+10>(n+1)^2+4(n+1)+5$$ This is true, since we get $$n(n+2)>0$$