# SOLUTION: Prove by induction that 2^n>=n^2. I was stocked at the induction step when 2^(k+1)>=2k^2

Algebra ->  Algebra  -> Geometry-proofs -> SOLUTION: Prove by induction that 2^n>=n^2. I was stocked at the induction step when 2^(k+1)>=2k^2      Log On

 Ad: Algebra Solved!™: algebra software solves algebra homework problems with step-by-step help! Ad: Algebrator™ solves your algebra problems and provides step-by-step explanations!

 Geometry: Proofs in Geometry Solvers Lessons Answers archive Quiz In Depth

 Question 527962: Prove by induction that 2^n>=n^2. I was stocked at the induction step when 2^(k+1)>=2k^2Answer by richard1234(5390)   (Show Source): You can put this solution on YOUR website!The induction basically claims that if for some k > 1, if , then . Since , we can construct the inequality The inequality is equivalent to It factors to , which is true for sufficiently large k (it doesn't hold for k = 0,1,2 but we can check these cases separately).