# Divergent infinite series $n!e^n/n^n$ - simpler proof of divergence?

$$\sum_{n=1}^\infty \frac{n!e^n}{n^n}$$ Where $$e$$ is Euler's number.

Recently on calculus class we were covering convergence tests and my group got stuck with this infinite series. Our calculus teacher told us that it diverges but he doesn't see any elementary way or simple test to prove it. He told us something about Euler's Gamma function and said that he knows it diverges because of Stirling's formula but this is not quite our level yet.

I tried to think about it myself but I established only that this is some kind of an edge case. We could generalize the problem to series of $$\frac{n!a^n}{n^n}$$. Then, from the ratio test we know that it converges for $$a and diverges for $$a>e$$. For $$a=e$$ the test is inconclusive. I've also tried to compare it with various divergent series, but nothing worked...

Does anybody have any idea for a simple solution?

• It would be sufficient to show that the limit of the expression for $n\rightarrow \infty$ is not $0$, but I have no simple idea yet. – Peter Jan 11 at 11:20
• Maybe you can use the Stirling's approximation – Ixion Jan 11 at 11:27
• Hi and welcome to the M.SE. If you want to add beautifully looking and mathematical text to your questions/answers, you may want to have a look at the Math Jax quick reference: you already did a good job by providing context to your problem. – Daniele Tampieri Jan 11 at 11:27
• @Ixion "he knows it diverges because of Stirling's formula but this is not quite our level yet." – Wojowu Jan 11 at 11:28
• @Wojowu, ouch, thanks... My bad! – Ixion Jan 11 at 11:29

Note $$\frac{(n+1)!e^{n+1}/(n+1)^{n+1}}{n!e^n/n^n}=\frac{(n+1)e}{(n+1)^{n+1}/n^n}=\frac{e}{(n+1)^n/n}=\frac{e}{(1+1/n)^n}>1$$ since $$e>(1+1/n)^n$$ for all $$n$$. It follows that $$\frac{(n+1)!e^{n+1}}{(n+1)^{n+1}}>\frac{n!e^n}{n^n},$$ so the terms of this series are increasing, hence do not tend to zero, thus the series is divergent.
Now, perhaps your teacher meant $$\frac{n^n}{n!e^n}$$, as then the series would still be divergent, but the terms do go to zero. However, there is a trick to make it work -- multiply the terms by $$n$$. By repeating a calculation like above, from $$e<(1+1/n)^{n+1}$$ it follows that the seqence $$n\cdot\frac{n^n}{n!e^n}$$ is increasing, so all its terms are at least as large as the first one, equal to $$1/e$$. Hence $$\frac{n^n}{n!e^n}\geq\frac{1}{en}$$, and by divergence of harmonic series this series diverges too.
• @Skyfall Thank you for sharing his response. What I am doing here is not so much a ratio test (though I see why it looks like it), but rather a simple comparison test, and ratios are used to decide the comparison. Focusing on just the first part, we have terms $a_1, a_2,\dots$. I am taking ratios $a_{n+1}/a_n$, but my conclusion is not based on the fact that this ratio goes to $1$. Instead, we have $a_{n+1}/a_n>1$, from which I conclude $a_{n+1}>a_n>\dots>a_1$. Hence $\sum_{n=1}^ka_n\geq\sum_{n=1}^ka_1=ka_1$ which clearly diverges. Hope this clarifies what's going on in the proof. – Wojowu Jan 12 at 9:55