Use math induction to show that

1) n!>= n^2 for n>=6

2) n!>=n^3 for n>=6

Printable View

- March 15th 2008, 10:29 PMxomichelleybellyMath Induction...PLEASE HELP!!!!!
Use math induction to show that

1) n!>= n^2 for n>=6

2) n!>=n^3 for n>=6 - March 16th 2008, 01:24 AMCaptainBlack
I will assume that you have done the base case and that we assume this is true for some

So we need to show that:

,

well:

and by supposition , so:

So if we can prove that we are done, but is equvalent to . So to compete the proof of the induction step you need to show that:

has no real root greater than or equal to (this is sufficient as for greater than its largest real root the cubic is positive).

This you do by making the substitution , then using Descartes rule of signs to show that this has no positive roots.

(In fact the only real root of is near )

RonL - March 16th 2008, 01:54 AMCaptainBlack
- March 16th 2008, 02:01 AMmr fantastic