Proof with nonnegative integers

Kasperloeye

New member
Joined
Sep 27, 2009
Messages
4
Hey I'm new on this forum.. and I'm a little stuck.. I need to prove what nonnegative integers n makes the following statement

n² <=n! I know the values.. but I'm a little fuzzy on how to do induction-proofs.. anyone who can give a hand or kick me in the right direction??
 
Here goes:
So Basis should be n=4 since
4²<=4!
16 <=24

SO: For n=k, k²<=k!

but if we take it with n= k+1 it's (k+1)² <=(k+1)!
(k+1)² <= (k+1)(k!)
(k+1) <= k!
but our hypothasis says k^2 <= k!, and because k+1 <= k^2 (for k>=4) then
k+1 <= k^2 <= k!.

right??
 
Top