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

Click For Summary
SUMMARY

The limit of the sequence defined by the ratio $\frac{2^n}{n!}$ as $n$ approaches infinity is proven to be 0 using the epsilon-delta definition of limits. The key argument involves establishing that for all $\epsilon > 0$, there exists an integer $N$ such that for all $n > N$, the inequality $\left|\frac{2^n}{n!}\right| < \epsilon$ holds true. Specifically, by choosing $N > \max\{3, \frac{4}{\epsilon}\}$, it is shown that $n!$ grows faster than $2^n$, leading to the conclusion that the limit is indeed 0.

PREREQUISITES
  • Epsilon-delta definition of limits
  • Factorial growth rates
  • Basic properties of sequences
  • Understanding of inequalities
NEXT STEPS
  • Study the epsilon-delta definition of limits in more depth
  • Explore the growth rates of factorials versus exponential functions
  • Learn about convergence of sequences and series
  • Investigate advanced limit proofs in calculus
USEFUL FOR

Mathematics students, educators, and anyone interested in understanding limits and sequences, particularly in the context of calculus and analysis.

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
2K
  • · 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