Convergence of n!/n^n Sequence

  • Thread starter Thread starter ehrenfest
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving the convergence of the sequence \(\frac{n!}{n^n}\) to 0. Participants are exploring the behavior of this sequence as \(n\) approaches infinity, particularly focusing on the terms involved in the factorial and their relationship to powers of \(n\).

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss rewriting the sequence in a product form to analyze its convergence. There are attempts to isolate terms that tend to zero and to understand how the early terms in the product affect the overall limit. Questions arise about how to rigorously establish the behavior of these terms as \(n\) increases.

Discussion Status

There is ongoing exploration of different approaches to demonstrate convergence. Some participants have provided hints and suggestions for breaking down the sequence, while others are actively working through the implications of their reasoning. No consensus has been reached yet, but productive lines of inquiry are being pursued.

Contextual Notes

Participants are working within the constraints of a homework assignment, which may impose specific requirements on the proof structure and the use of epsilon-delta arguments.

ehrenfest
Messages
2,001
Reaction score
1
[SOLVED] proving a seqeunce converges

Homework Statement


Prove that the sequence \frac{n!}{n^n} converges to 0.

Homework Equations


The Attempt at a Solution


Given \epsilon > 0, how do I find N? We know that the nth term is less than or equal to
\left(\frac{n-1}{n}\right)^{n-1}
but that really does not help.
 
Physics news on Phys.org
… in a fight, always pick off the smallest ones …

Hi ehrenfest! :smile:

Hint: write it (1/n)(2/n)(3/n)…(n/n);

the early bits go down much faster than the later bits; so can you see a way of splitting off some of the early bits, and prove that they tend to zero? :smile:
 
tiny-tim said:
Hi ehrenfest! :smile:

Hint: write it (1/n)(2/n)(3/n)…(n/n);

the early bits go down much faster than the later bits; so can you see a way of splitting off some of the early bits, and prove that they tend to zero? :smile:

Yes, I was trying to do something like that. If I can show that any factor in that product goes to 0, then the whole thing has to because the rest will be less than 1. If I collect the first n/2 ceiling terms, then I get (1/2)^(n/2) if n is even, and that needs to got to zero, doesn't it? I see, thanks. When n is odd we get something similar.
 
That's right! :smile:

(And don't forget, your proof should begin something like "For any epsilon, choose N such that 2^-N …")
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K