I am trying to prove, by induction, that $2^n > n^2 - 7, \forall n \in \mathbb{N}$.
I am stuck in the inductive step: $n = n+1$.
$$\begin{align*} 2^{n+1} &= 2 \cdot 2^n \\ &> 2 \cdot (n^2 - 7) \tag{By I.H.} \\ &= 2 \cdot (n^2 + 2n + 1 - 10) \\ &= 2(n+1)^2 - 20 \\ &> (n+1)^2 - 17 \end{align*} $$
Which is not what I want, $(n+1)^2 - 7$. I'm not seeing how to reduce the constant to 7, any hints appreciated.
First off, $+1$ for an excellent question.
Second, you have switched signs ($>$ to $<$). You are given that $2^n > n^2-7$,and have to prove it for $n+1$.
To do this, note that: $2^{n+1} = 2 \cdot 2^n > 2(n^2-7) > 2n^2 - 14$.
Note that $2n^2 - 14 - ((n+1)^2 - 7) = (n+2)(n-4) > 0$ if $n \geq 5$.
Hence, it follows that $2^{n+1} > 2n^2 - 14 > (n+1)^2 - 7$ for $n \geq 5$. You can check the rest manually (I leave it to you).
Key point : Don't worry if the RHS doesn't immediately suggest a finish to the argument. In this case, I took the difference between the RHS I got, and the RHS I wanted, and the nature of the difference allowed me to deduce the identity for all but a very small set of small numbers, which was easy to do manually.