Take the 2-minute tour ×
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.

Prove, formally that: $\log_2 n! \ge n$ for all integers $n>3$.

Hint: first prove that $n! ≥2^n$, for all integers $n >3$.

So far what I have:

Base case, $n = 4$,

$4! = 24$

$2^4 = 16$.

Therefore, it is true when $n = 4$.

So how do I proceed from here?

I know I can log the whole equation which will lead to $\log_2 n!$ and $n$. But the linkage seems to be missing. Sorry for the untidiness about the math symbols. I am trying to input them correctly but apparently I am not doing it right.

share|improve this question

2 Answers 2

up vote 3 down vote accepted

For the induction step just note that you can assume $2^{n-1} \le (n-1)!$ as induction hypotheses, giving you (we have $2 \le 3 < n$): $$ 2^n = 2\cdot 2^{n-1} \le 2 \cdot (n-1)! < n \cdot (n-1)! = n! $$ By induction, now $2^n \le n!$ for any $n > 3$. Applying $\log_2$ to both sides (note that $\log_2$ is monotone), gives $$ n \le \log_2 n!, \quad n > 3 $$ as wanted.

share|improve this answer
1  
Rather than giving a complete answer, why not give the OP a push in the right direction as long as that is all for which he/she is asking? –  JavaMan Nov 29 '12 at 16:05
    
Thanks Martini. –  Ray.R.Chua Nov 29 '12 at 23:31

Induction. You just stated the start case for $n=4$ already. The induction step then takes the statement for $n$ to $n+1$. So we have $n! > 2^n$ given. Looking at $n+1$ we get $(n+1)!=n!*(n+1)>n!*2>2^n*2 = 2^{(n+1)}$. The first inequality uses n>3. So in total $(n+1)!>2^{n+1}$ if already $n!>2^n$ and n>3, which then induces the inequality for all n>3.

share|improve this answer
    
Thanks Dirk Dinther –  Ray.R.Chua Nov 29 '12 at 23:32

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.