How to Prove Limit 2^n/n! Using Epsilon Delta?

Click For Summary

Discussion Overview

The discussion centers on proving the limit $$\lim_{{n}\to{\infty}}\frac{2^n}{n!}=0$$ using the epsilon-delta definition of limits. The focus is on the mathematical reasoning and justification for the choice of parameters in the proof.

Discussion Character

  • Mathematical reasoning

Main Points Raised

  • One participant requests a proof using epsilon-delta, indicating a need for clarity on the approach.
  • Another participant proposes a method involving the inequality $$n! \ge n\cdot 2^{n-2}$$ for $n \ge 3$, suggesting that this can help in bounding the limit.
  • A participant questions the choice of $N$ in the expression $$N > \max\{3,\frac{4}{\epsilon}\}$$ and seeks clarification on its necessity.
  • Clarification is provided that the inclusion of $3$ ensures the validity of the inequality for $n \ge N$.

Areas of Agreement / Disagreement

Participants generally agree on the approach to proving the limit, but there is some uncertainty regarding the choice of $N$ and its implications for the proof.

Contextual Notes

The discussion does not resolve whether the choice of $N$ is optimal or if there are other valid approaches to the proof. The reasoning relies on specific inequalities that may depend on the definitions used.

Dethrone
Messages
716
Reaction score
0
Using epsilon delta, prove
$$\lim_{{n}\to{\infty}}\frac{2^n}{n!}=0$$

Doesn't seem too difficult, but I have forgotten how to do it. Obvious starting point is $\forall \epsilon >0$, $\exists N$ such that whenever $n>N,\left|\frac{2^n}{n!} \right|<\epsilon$.
 
Last edited:
Physics news on Phys.org
Hi Rido12,

Note that if $n \ge 3$, $$n! = n\cdot (n-1)\cdot (n-2)\cdots \cdot 2\ge n\cdot 2\cdot 2 \cdots \cdot 2 = n\cdot 2^{n-2}.$$ Thus, given $\epsilon > 0$, choosing $N > \max\{3,\frac{4}{\epsilon}\}$ will make $$\left|\frac{2^n}{n!}\right| = \frac{2^n}{n!} \le \frac{4}{n} < \epsilon$$ for all $n \ge N$.
 
Hi Euge,

That is actually very smart (Cool). Can you clarify how we got the $3$ in $\max\{3,\frac{4}{\epsilon}\}$? Doesn't $\frac{4}{\epsilon}$ work for all epsilon, or have a missed a case?
 
The max piece was meant to ensure that $ N \ge 3$. So if $ n \ge N$, the inequality $ n! \ge n\cdot 2^{n-2} $ is valid.
 
Euge said:
The max piece was meant to ensure that $ N \ge 3$. So if $ n \ge N$, the inequality $ n! \ge n\cdot 2^{n-2} $ is valid.

That's very true. Thanks for the help, again! :D
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K