# mathematical induction again

• Jul 30th 2007, 11:15 AM
tottenc
mathematical induction again
I need to use mathematical induction to prove $2^n for all n>=4. The base case is easy, and in the inductive step I get to $2(2^n)<(n+1)n!$ But am I going in the wrong direction, or am I just missing something?
• Jul 30th 2007, 11:41 AM
tukeywilliams
Assume $2^k < k!$ for $k \geq 4$. Then $2^{k+1} < 2k! < (k+1)! = k!(k+1)$. $k+1 > 2$ for $k >1$. Hence $2^{k+1} < (k+1)!$ for $k \geq 4$ and we have proved the inductive step.
• Jul 30th 2007, 11:49 AM
tottenc
Sorry, stupid typo
$2^n$ for all $n>=4$
• Jul 30th 2007, 12:16 PM
Plato
Assume that $N \ge 4\quad \& \quad 2^N < N!$ for the inductive step.

Then $2^{N + 1} = 2\left( {2^N } \right) < \left( {N + 1} \right)\left( {N!} \right) = \left( {N + 1} \right)!$
• Jul 30th 2007, 06:14 PM
tottenc
The answer to these things is always staring me right in the face, and I just can't see it until someone points it out. Thanks again
• Jul 31st 2007, 05:34 AM
topsquark
Quote:

Originally Posted by tottenc
The answer to these things is always staring me right in the face, and I just can't see it until someone points it out. Thanks again

It just takes some practice. ;)

-Dan