document.write( "Question 527962: Prove by induction that 2^n>=n^2. I was stocked at the induction step when 2^(k+1)>=2k^2 \n" ); document.write( "
Algebra.Com's Answer #349102 by richard1234(7193)\"\" \"About 
You can put this solution on YOUR website!
The induction basically claims that if for some k > 1, if\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( ", then\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( ".\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Since , we can construct the inequality\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "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).
\n" ); document.write( "
\n" );