# Limit of the sequence $\{n^n/n!\}$, is this sequence bounded, convergent and eventually monotonic?

I am trying to check whether or not the sequence $$a_{n} =\left\{\frac{n^n}{n!}\right\}_{n=1}^{\infty}$$ is bounded, convergent and ultimately monotonic (there exists an $N$ such that for all $n\geq N$ the sequence is monotonically increasing or decreasing). However, I'm having a lot of trouble finding a solution that sufficiently satisfies me.

My best argument so far is as follows,

$$a_{n} = \frac{n\cdot n\cdot n\cdot \ldots\cdot n}{n(n-1)(n-2)(n-3)\dots(2)(1)} = \frac{n}{n}\cdot \frac{n}{n-1}\cdot \ldots \cdot \frac{n}2\cdot n$$

so $\lim a_{n}\rightarrow \infty$ since $n<a_{n}$ for all $n>1$. Since the sequence is divergent, it follows that the function must be ultimately monotonic.

This feels a little dubious to me, I feel like I can form a much better argument than that, or at the very least a more elegant one. I've tried to assume $\{a_{n}\}$ approaches some limit $L$ so there exists some $N$ such that

$|a_{n} - L| < \epsilon$ whenever $n>N$ and derive a contradiction, but this approach got me nowhere.

Finally, I've also tried to use the fact that $\frac{a_{n+1}}{a_n}\rightarrow e$ to help me, but I couldn't find an argument where that fact would be useful.

• Your argument that $a_n\ge n$ is fine and shows that the sequence is unbounded and therefore not convergent; the only remaining question is whether it’s eventually monotonic. – Brian M. Scott Oct 22 '13 at 2:45
• So we are talking about a sequence here. The question is. What grows faster: Numerator or denominator? Suggestion: Plug in couple of values of n, and see what happens... – imranfat Oct 22 '13 at 2:46
• I suggest you have a look to Stirling's approximation of n!. Using it, you arrive to the fact that n^n/n! is almost equal to Exp[n]/Sqrt[2 Pi n]. – Claude Leibovici Oct 22 '13 at 5:59
• – Martin Sleziak Dec 17 '13 at 15:34

$$\frac{a_{n+1}}{a_n}=\frac{\frac{(n+1)^{n+1}}{(n+1)!}}{\frac{n^n}{n!}}=\frac{(n+1)^{n+1}n!}{n^n(n+1)!}=\frac{(n+1)^{n+1}}{n^n(n+1)}=\left(\frac{n+1}n\right)^n\;.$$
• Using this, I can show that given $\epsilon>0$, there exists an $N$ such that for all $n> N$, $a_{n} (e-\epsilon) <a_{n+1}$, but I can't seem to reduce it further. I think I am missing a well known theorem about the ratio for terms that is preventing me from completing this problem. – JessicaK Oct 22 '13 at 2:59
• @Jessica: You’re trying to be too fancy, I think. $$\left(\frac{n+1}n\right)^n=\left(1+\frac1n\right)^n\;;$$ how does that ratio compare in size with $1$? Remember, all you need to do is show that the sequence is monotonic; the rest is handled by your earlier work, as I said in a comment. – Brian M. Scott Oct 22 '13 at 3:05
To show that $a_n$ is unbounded, we can show that, $a_n > n$ for all $n$. And since $n$ is unbounded by Archimedes, $a_n$ must also be unbounded.
$a_n = \frac{n^n}{n!} = \underbrace{\frac{n}{n} \cdot \frac{n}{n-1} \cdot \frac{n}{n-2} \cdot \frac{n}{n-3}\cdots \frac{n}{2}}_{\text{Since$n \geq 1$, each of these terms are$\geq 1$}} \cdot \frac{n}{1} \geq n$.