Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Prove by induction that $n!<n^n$ for all $n>1$. So far I have (using weak induction):

  1. Base Case: Proved that claim holds for $n=2$
  2. Induction hypothesis: For some arbitrary $n>1, n!<n^n$
  3. Need to show that $n!\cdot(n+1)<(n+1)^{n+1}$
  4. Induction step...

$n! < n^n$ [induction hypothesis]

$(n+1) \cdot n!<n^n(n+1)$ [multiply both sides by $(n+1)$]

$(n+1)!< n^{n+1}+n^n$

This is where I'm stuck. I'm not sure if I went wrong somewhere, or if I'm just approaching it the wrong way. Thanks for any feedback!

share|cite|improve this question
Must you do this by induction? It's obvious otherwise. – Calvin Lin Jan 31 '13 at 0:04

$(n+1)n!<(n^n)(n+1)<((n+1)^n)(n+1)=(n+1)^{(n+1)}$. Try to direct your algebraic manipulations so that the expressions gradually look like the desired result.

share|cite|improve this answer

It suffices to show that $k+1 < \frac {(k+1)^{k+1} } {k^k}$. This is obvious since $k+1 > k$, so $\frac {(k+1)^{k+1} } {k^k} = (k+1) \left( \frac {k+1}{k} \right) ^k > k+1$.

Note, you can show this directly, since $n \geq i$ for $i\leq n$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.