# Mathematical Induction

1. Apr 15, 2013

### yy205001

1. The problem statement, all variables and given/known data
Prove the theorems using mathematical induction.

$\forall n$ $\in N$, n$\geq 4$ $\rightarrow$n2$\leq n!$

2. Relevant equations

3. The attempt at a solution
First, check the base case which is n=4.
$\Rightarrow$n=4$\geq$4-True

$\Rightarrow$42$\leq$4*3*2*1

$\Rightarrow$16$\leq$24-True

Therefore, P(1) is true.

Now, check for the case n=k+1, to prove P(k)$\rightarrow$P(k+1).
Assume P(k) is true.
$\Rightarrow$k$\geq$4
$\Rightarrow$k2$\leq$k!

$\Rightarrow$k+1$\geq$4+1 -Add 1 on both side
$\Rightarrow$k+1$\geq$5
$\Rightarrow$(k+1)2=k2+2k+1
$\Rightarrow$(k+1)!=(k+1)k!
...

And I stop here can't get further to prove P(k+1) is true.
Any help is appreciated.

2. Apr 15, 2013

### HallsofIvy

Staff Emeritus
Rather than multiply the square note that what you want to prove is that
$(k+1)^2= (k+1)(k+1)\le (k+1)k!$ which, because k+1 is positive, is
the same as proving that $k+1\le k!$. You might want to do another induction to prove that is true first.

3. Apr 15, 2013

### yy205001

Thanks HallsofIvy,
So I should start at proving (n+1)(n+1)≤(n+1)n! $\Rightarrow$ n+1≤n!
First, Check the base case n=4:
$\Rightarrow$(4)+1≤4!
$\Rightarrow$5≤24
So, the base case is true.

Now, Assume P(k) is true, then prove prove P(k+1):
$\Rightarrow$k+1≤k! -is true (Premise)
Also, let n=k+1:
$\Rightarrow$k+1+1≤(k+1)!
$\Rightarrow$(k+1)+1≤(k+1)k!
$\Rightarrow$1+1/(k+1)≤k! [Since k+1 is positive, so the inequality sign won't change]
Since 1+k≤k! is true and k>1/(k+1)
Therefore, P(k+1) is true
P(k)$\rightarrow$P(k+1)
And prove $\forall n$$\in N$n≥4$\rightarrow$n2≤n!

Does this look alright??

4. Apr 16, 2013

### HallsofIvy

Staff Emeritus
No, that follows trivially by dividing both sides by n+1. What I said was that you should show that, for all $n\ge 4$, $n+1\le n!$ (which is, in fact, what you are doing).

You cannot assert this because you do not know if it is true yet. This is what you want to prove.

Strictly speaking what you have done is prove "if P(k+1) is true then P(k) is true". Do it the other way around: if $k+1\le k![/tex] then [itex](k+1)(k+1)\le k!(k+1)= (k+1)!$