Does the series converge? n/n^n

[limonysal]

Homework Statement

Σ(n!)/(n^n)

Homework Equations

Does the series converge or diverge?

The Attempt at a Solution

My prof. suggested we compare it to n^(n-2)/n^n.

I found that n^(n-2)/n^n was convergent since it was like 1/n^2 which is a p series where p>1. Therefore by the comparison theorem, the original series is convergent.

I'm hoping this is the right answer, but I thought it was too easy for what was deemed a tricky problem, even with the hint.

 

[Dick]

All fine, but what about the comparison part? How did you show n!<n^(n-2)? It's not true for all n...

 

[Curious3141]

Ratio test (where you prove the limit of the ratio of consecutive terms is less than one (in this case, it's 1/e) is MUCH more straightforward, given that you have to prove what Dick said if you use the comparison test.

 

[Curious3141]

And in fact, this series folds very easily under the root test.

General term is n!/(n^n) = a_n.

(a_n)^(1/n) = [(n!)^(1/n)]/n = {[(n)(n-1)...1]^(1/n)}/n < [(n^n)^(1/n)]/n = 1

Sorry that I didn't format with Tex.

 

[limonysal]

Dick: I have no idea. It was suggested and I just went through with it. I just took it as true.

I'm still rather confused because the ratio test is what I should use, but we haven't actually covered that in class.

 

[Dick]

It is true for n>=5, which is enough to allow you to use the comparison test. The easiest proof of the inequality actually looks rather like the ratio test. But if your prof suggested you do that, then maybe a proof isn't needed.

 

[Curious3141]

It is true for n>=5, which is enough to allow you to use the comparison test.

To "see" it is easy. To prove it, not so - it's messy (you have to consider the monotone increasing nature of the functions, sketch curves etc.) You can use induction, but it is inelegant.

The easiest proof of the inequality actually looks rather like the ratio test. But if your prof suggested you do that, then maybe a proof isn't needed.

The easiest proof is the root test (as I've shown). The professor was only making a suggestion, I guess, and a better way can, and should be sought.

 

[Gib Z]

Well, this series converges if $$\sum_{n=1}^{\infty} \frac{\sqrt{2\pi n} \left(\frac{e}{n}\right)^n}{n^n}$$ converges.

 

[limonysal]

i was supposed to do this without the ratio or root test. we just discussed ratio test today in class. I don't really know what the book/class was expecting.

 

[learningphysics]

i was supposed to do this without the ratio or root test. we just discussed ratio test today in class. I don't really know what the book/class was expecting.

Think the idea was to use induction... as Dick pointed out for n = 5, n!<n^(n-2). so using induction... assume n>=5. assume n!<n^(n-2)... prove (n+1)!<(n+1)^[(n+1)-2] ie:

(n+1)! < (n+1)^(n-1)

so start with:

(n+1)! = (n+1)n! < (n+1)[n^(n-2)] < (n+1)[(n+1)^(n-2)] = (n+1)^(n-1)

so using the comparison test your series converges.