Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Determine the result of


I would like to use the sandwich rule for limits to find two sequences which define lower and upper bounds to determine the appropriate limit which is obviously $+\infty$.

By now I have an upper bound:

$$\frac{n^{n+1}}{n!}=n\cdot\frac{n}{n}\cdot\frac{n}{n-1}\cdot\ldots\cdot\frac{n}{2}\cdot\frac{n}{1}\leq n\cdot 1\cdot n\cdot\ldots\cdot n\cdot n=n^n\longrightarrow+\infty$$

What would you suggest, which sequence should I use for a lower bound which converges to $+\infty$?

share|cite|improve this question
up vote 4 down vote accepted

As your sequence is positive it suffices to find a lower bound sequence that diverges to infinity:

$$\frac{n^{n+1}}{n!}=n\frac{n\cdot n\cdot\ldots\cdot n}{1\cdot 2\cdot\ldots\cdot n}\geq n\frac{n\cdot n\cdot\ldots\cdot n}{n\cdot n\cdot\ldots\cdot n}=n\xrightarrow [n\to\infty]{} \infty$$

share|cite|improve this answer
What would you do if it was (n^n)/n! – Adam Rubinson Nov 5 '12 at 13:56
I'd take out $\,\dfrac{n}{1}\,$ from the fraction: $$\frac{n^n}{n!}\geq \frac{n}{1}\frac{n\cdot...\cdot n}{n\cdot\ldots\cdot n}=n....$$ – DonAntonio Nov 5 '12 at 14:05
lol! And if it were (n)^(n-k) / n! (for some fixed k) ? – Adam Rubinson Nov 5 '12 at 17:09

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.