Hey all, I would really appreciate some help with this proof. For all k in the Natural Numbers, k^2 + 1 > k Could we possibly use induction or contradiction for this proof? Thanks!
Follow Math Help Forum on Facebook and Google+
Originally Posted by jstarks44444 Hey all, I would really appreciate some help with this proof. For all k in the Natural Numbers, k^2 + 1 > k You have that $\displaystyle k\ge 1$ so $\displaystyle k^2\ge k$. But we have shown that $\displaystyle k^2+1>k^2$.
View Tag Cloud