Factorial question

Printable View

Jan 18th 2011, 03:34 AM
crossbone

Factorial question

How do you get $\frac{1}{n!}\leq\frac{1}{2^{n-1}}$ for $n>1$ ?
Jan 18th 2011, 03:46 AM
Prove It

$\displaystyle n \cdot (n-1) \cdot (n-2) \cdot \dots \cdot 3 \cdot 2 > 2 \cdot 2 \cdot 2 \cdot \dots \cdot 2 \cdot 2$ (with $\displaystyle n-1$ terms on each side of the inequality)

$\displaystyle n! > 2^{n-1}$

$\displaystyle \frac{1}{n!} < \frac{1}{2^{n-1}}$ .
Jan 18th 2011, 04:28 AM
crossbone

I can see the proof, but how do you get the first line ie what idea comes prior to that? why not 2.1, 2.4 or pi?

nevermind. I got it.
Jan 18th 2011, 04:08 PM
HallsofIvy

Fpr those who didn't "get it", both n! and $2^{n-1}$ have n- 1 factors (not counting the "1" in n!). Just compare the size of the factors. n! is the product of all numbers from n down to 2 while $2^{n-1}$ has all "2"s. 2= 2 while 3> 2 so 3(2)> 2(2), 4> 2 so 4(3)(2)> 2(2)(2), 5> 2 so 5(4)(3)(2)> 2(2)(2)(2), etc.

All times are GMT -8. The time now is 04:15 PM.