Prove the following statement using induction.
If $x > 1$ is a real number, then $(x+1)^n > nx^2+1$ for all $n \ge 3$.

Prove the following statement using induction.
If $x > 1$ is a real number, then $(x+1)^n > nx^2+1$ for all $n \ge 3$.

I leave the base case $n=3$ to you.
Note that you need to prove that $$(x+1)^n>nx^2+1 .$$ Suppose $$(x+1)^k >kx^2+1$$ for some $k \ge 3$. Then $$(x+1)^{k+1}=(x+1)(x+1)^k >(x+1)(kx^2+1)=kx^3+x+kx^2+1.$$ Next, we consider $kx^3+x > x^2 \iff kx^2-x+1>0 \iff 1-4k <0$, which is true.
Therefore, $$(x+1)^{k+1}>kx^3+x+kx^2+1>x^2+kx^2+1=(k+1)x^2+1.$$
The expression $ax^2+bx+c > 0$ when $a >0$ and $b^2-4ac < 0$.
First verify it for $n=3$:
$(x+1)^3 > 3x^2 +1 $
$(x+1)^3 = x^3 + 3x^2 + 3x+1 = x^3+3x +( 3x^2 +1) > 3x^2+1$
$x^3+3x >0$, which is true, since $x>1$.
Suppose it holds for $n$. Now check for $n=n+3$:
$(x+1)^{n+3} > (n+3)x^2 +1 $
$(x+1)^n (x+1)^3 > nx^2+3x^2 +1 $
$\frac{(x+1)^n (x+1)^3}{(x+1)^n } > \frac{nx^2+1}{(x+1)^n } + \frac{3x^2}{(x+1)^n }$
$ (x+1)^3 > \frac{nx^2+1}{(x+1)^n } + \frac{3x^2}{(x+1)^n } $
But, since by hypothesis $(x+1)^n > nx^2 +1 \Rightarrow 1>\frac{nx^2+1}{(x+1)^n }$ and also $3x^2 > \frac{3x^2}{(x+1)^n} $
Thus:
$ (x+1)^3 > 3x^2+1 > \frac{3x^2}{(x+1)^n } + \frac{nx^2+1}{(x+1)^n }$
Which is true, since it is valid for $n=3$
$(x + 1)^{n+1} = (x+1)^n*(x+1) > (nx^2 + 1)(x+1) = nx^3 + nx^2 + x + 1$.
$(n+1)x^2 + 1= nx^2 + x^2 + 1$
Which of those two are larger?