I want to prove
$2^n \ge 3n^2 +5$--call this statement $S(n)$--for $n\ge8$
Basis step with $n = 8$, which $\text{LHS} \ge \text{RHS}$, and $S(8)$ is true. Then I proceed to inductive step by assuming $S(k)$ is true and so
$2^k \ge 3k^2 +5 $
Then $S(k+1)$ is
$2^{k+1} \ge 3(k+1)^2 + 5$
I need to prove it so I continue by
$2^{k+1} \ge 3k^2 +5$
$2(2^k) \ge 2(3k^2 +5)$
I'm stuck here...don't know how to continue, please explain to me step by step. I search for whole day already, all give answer without explanation. I can't understand, sorry for the trouble.