# Convergence of $\sum n!e^{1/n}$?

$\sum n!e^{1/n}$

I'm not sure how to prove whether this converges or diverges. I have a hunch that it converges, due to the factorial growing more slowly than an nth root, but I can't figure out how to prove it. The factorial keeps getting in the way.

I did try to take the natural log, but again I wasn't sure how to proceed with the ln. Additionally, I feel like there's a better, more elegant solution. How can I determine this series' convergence?

• The terms (spectacularly) don't go to $0$. Automatic divergence. May 10 '16 at 23:27
• $n!$ growing more slowly than the $n$th root? You need to rethink this.
– zhw.
May 10 '16 at 23:29
• My thought process was that this was similar to indeterminate cases like 0*infinity, where we don't know just by looking at it which way it will go. But I see now that I was (for whatever reason) computing this as e-->0, and this is why I thought it might be indeterminate. My mistake, now that it's pointed out I feel rather foolish for not noticing. May 10 '16 at 23:37
• Note: e --> 0 makes no sense
– zhw.
May 10 '16 at 23:39

$e^{x}>1$ for any $x>0$, so $$n!e^{1/n}>n!$$
Hint: $e^{1/n} > 1.\,\,\,\,$