I want to prove that $n! \geq n^3$, for all $n \geq 6$. I tried with induction, but it doesn't seem to help as it gets even more complicated.
Asked
Active
Viewed 441 times
2 Answers
4
Hint: For $n\geq 6$, $$ n!\ge n(n-1)(n-2)(n-3)\geq 3n(n-1)(n-2) $$ and $$ 3n(n-1)(n-2)-n^3=2n^3-9n^2+6n\geq \ldots>0. $$
yurnero
- 10,505
-
1How is this a hint? Nice answer anyway :) – String Nov 18 '16 at 14:01
-
@String True. Lemme remove a few details. :p – yurnero Nov 18 '16 at 14:04
0
Alternate argument (sometimes it's helpful to see these things can be done different ways) -
It's straightforward to verify that for $n \geq 6$, the inequality
$$ (n-1)! \geq 7 \geq 3 + \frac{3}{n} + \frac{1}{n^2}$$
holds. Then rearrange to obtain
$$ n \cdot n! \geq 3n^2 + 3n + 1.$$
After checking for the base case that $k! > k^3$, assume it holds for the case $n$. Now add the two inequalities.
Nitin
- 2,948