# Thread: Don't understand this For which nonnegative integers n is nē < n!? prove your answer?

1. ## Don't understand this For which nonnegative integers n is nē < n!? prove your answer?

This problem been giving me fits;

Q: For which nonnegative integers n is nē < n!? prove your answer?
__________________________________________________ ______________

I know I have to use Basis Step, Inductive Hypothesis and Inductive Step. But when doing the basis step, if you let n > 1, then n^(2) is larger than n!, so how can the Basis hold up? I though Basis is when the LHS is equal to the RHS or it has to be true like 4 > 2.

This is what I am stuck at?

2. Originally Posted by Grillakis
This problem been giving me fits;

Q: For which nonnegative integers n is nē < n!? prove your answer?
__________________________________________________ ______________

I know I have to use Basis Step, Inductive Hypothesis and Inductive Step. But when doing the basis step, if you let n > 1, then n^(2) is larger than n!, so how can the Basis hold up? I though Basis is when the LHS is equal to the RHS or it has to be true like 4 > 2.

This is what I am stuck at?
Consider the function:

$\displaystyle f(k)=k^2(k+1)-(k+1)^2=k^3-2k+1$

$\displaystyle k \in \mathbb{R}$ , then:

$\displaystyle f'(k)=3k^2-2$

Now if $\displaystyle k\ge 1,\ f'(k)>0$ and so $\displaystyle f(k)$ is increasing, and as $\displaystyle f(1)=0,\ f(k)\ge0$ for all $\displaystyle k\ge 1$

Hence for all natural numbers $\displaystyle k\ge 1$ we have:

$\displaystyle f(k)=k^2(k+1)-(k+1)^2 \ge 0$

or:

$\displaystyle k^2(k+1)\ge (k+1)^2 \ \ \ \ \ \ \ \ \ \ \ ...(1)$

Now for the induction step of the proof assume that for some integer $\displaystyle k>1$ that $\displaystyle k^2\le k!$, then:

$\displaystyle k^2(k+1)\le (k+1)!$

but by $\displaystyle (1)$ above:

$\displaystyle (k+1)^2 \le k^2(k+1)\le (k+1)!$

etc...

CB

3. I see...thanks CB