How is this evaluated. Is it k(k+1) or is it (k+1)(k+2). This is the problem if anyone wants to try it out.

Prove by induction on n that n!>2^n for all integers n such that n >or= 4

Results 1 to 2 of 2

- Oct 10th 2007, 02:40 PM #1

- Oct 11th 2007, 12:37 AM #2

*Proposition:*for .

*Proof:*We will prove the proposition by induction on a variable .

If , we have or , which is true.

Assume: for

Taking , we have

Multiplying by k+1, we have

or

And since , the minimum value we can have for is 5, so we have

or

By transitivity, we have

Hence, for , QED