Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Possible Duplicate:
Proof the inequality $n! \geq 2^n$ by induction
Prove By Induction that $n!>2^n$

I have to prove the inequality $n! > 2^n$ for all integers $n \geq4$.

I am having trouble with this.

I am assuming that: $n! > 2^n \implies (n+1)! > 2^{n+1}$.

I have proven the base case is true, as $4! > 2^4$.

For the induction step, I get: $(n+1)! = (n+1)n!$

After that, I am not sure what to do.

Thanks.

share|improve this question
3  

marked as duplicate by Ilya, Sasha, David Mitra, mixedmath, Byron Schmuland Feb 20 '12 at 19:39

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

protected by Gerry Myerson Mar 19 '12 at 10:01

This question is protected to prevent "thanks!", "me too!", or spam answers by new users. To answer it, you must have earned at least 10 reputation on this site.

Browse other questions tagged or ask your own question.