How to Prove Euler's Number Converges?

  • Thread starter Thread starter jetplan
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on proving the convergence of Euler's number, e, defined as e = (1 + 1/n)^n as n approaches infinity. Participants highlight that the sequence is bounded above by 3 and is monotonic increasing, which establishes the existence of a limit. The proof involves using the binomial formula to express (1 + 1/n)^n and demonstrating that it converges by showing that the series ∑ 1/n! converges. The Monotone Convergence Theorem is also referenced to support the conclusion.

PREREQUISITES
  • Understanding of limits and convergence in calculus
  • Familiarity with the binomial theorem
  • Knowledge of series convergence, specifically the series ∑ 1/n!
  • Basic principles of monotonic sequences and the Monotone Convergence Theorem
NEXT STEPS
  • Study the binomial theorem and its applications in calculus
  • Learn about the Monotone Convergence Theorem in detail
  • Explore proofs of convergence for series, particularly the exponential series
  • Investigate the properties of Euler's number and its significance in mathematics
USEFUL FOR

Mathematicians, calculus students, and educators seeking to deepen their understanding of convergence proofs and the properties of Euler's number.

jetplan
Messages
15
Reaction score
0
Hi All,

How do we go about showing the euler's number e converges ?
Recall that

e =(1+1/n)^n as n ->infinity

Some place prove this by showing the sequence is bounded above by 3 and is monotonic increasing, thus a limit exist.

But I forgot how exactly the proof looks like.


Thanks
J
 
Physics news on Phys.org
Here's one way.

Write down (1+1/n)^n using the binomial formula.

You'll see that it equals to

1 + 1 + (1/2!)(1-1/n) + (1/3!) (1-1/n) (1-2/n) + ... + (1/(n-1)!) (1-1/n) (1-2/n) .. (1-(n-1)/n)

From here it's not hard to see that it's monotonic increasing, and it's bounded above by 1 + 1 + 1/2! + 1/3! + ... 1/n!.

In turn, it's not hard to see that the series \sum 1/n! converges, because 1/n! < 2^{-n} for all n>3.
 
Use the fact that
geometric mean<=arithmetic mean
consider n+1 numbers where 1 is one of the numbers and the other n are 1+1/n
 
lurflurf said:
Use the fact that
geometric mean<=arithmetic mean
consider n+1 numbers where 1 is one of the numbers and the other n are 1+1/n

That only proves that it's monotonic.
 
Thanks for the neat proof.

one comment:

since we know that \sum 1/n! converges, we know e converges because
e = 1 + \sum 1/n! where n->infinity
 
Last edited:
jetplan said:
Thanks for the neat proof.

one comment:

since we know that \sum 1/n! converges, we know e converges because
e = 1 + \sum 1/n! where n->infinity

but first you'd have to prove that the original series converges and that its limit is equal to 1 + \sum_{n=1}^{\infty} 1/n! .
 
hamster143 said:
That only proves that it's monotonic.

2<(1+1/n)^n<(1+1/n)^(n+1)<4

By Monotone convergence theorem bounded monotonic series converge.
 
Last edited:
(1+1/n)^(n+1)<4

I don't see it.
 
^
(1+1/n)^(n+1) is decreasing thus
(1+1/n)^(n+1)<(1+1/1)^(1+1)=4
 
  • #10
You repeated use of "e is convergant" is confusing. Numbers do not converge. It makes sense to ask how to show that the limit \lim_{n\to\infty} (1+ 1/n)^n converges or how to show that \sum_{n=0}^\infty 1/n! converges.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 24 ·
Replies
24
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K