Series: $\Sigma n!/n^n$ - Why Does it Converge?

  • Thread starter Thread starter badirishluck
  • Start date Start date
  • Tags Tags
    Series
Click For Summary

Homework Help Overview

The discussion revolves around the convergence of the series $\Sigma n!/n^n$, specifically examining the growth rates of factorials compared to exponential functions.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the application of the Ratio test and question the initial assumption that factorials grow faster than exponential functions. There is a discussion on the growth rates of $n!$ and $n^n$ and how they compare.

Discussion Status

The discussion is active, with participants providing insights into the growth rates of factorials versus exponentials. Some participants suggest reconsidering the original poster's assumptions about growth rates, while others clarify the differences in growth between the two forms.

Contextual Notes

There is an underlying assumption that the original poster's understanding of factorial growth may be incorrect, leading to confusion about the series' convergence. The discussion is framed within the context of a homework problem, which may impose certain constraints on the exploration of these concepts.

badirishluck
Messages
6
Reaction score
0

Homework Statement


\Sigman!/n^n

index n=1 to infinity


Homework Equations





The Attempt at a Solution


Using the Ratio test (limit as n goes to infinity of a_{n+1}/a_{n})
and found that the series converges.

However, I thought that factorials grew faster than exponential functions. Therefore, it would diverge, right?

Could someone explain why? Did I just do something wrong?
 
Physics news on Phys.org
Exponents of the form n^n grows much faster than factorials of the form (n!) because the factorial is a multiplication of n terms, the majority of which are less than n, and the power is a multiplication of n terms, all of which are equal to n.
 
Factorials don't grow faster than exponentials of the sort you're working with. Just think about it: n! = 1 * 2 * 3 * ... * n. You have n factors, of which the largest is n.
n^n = n * n * n * ... * n. Here you have n factors, all of which are n. Clearly this exponental is larger than the factorial above.
 
Exponentials with a fixed base, like e^n or 2^n, grow more slowly than n!.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K