Recall that we have defined Euler's number as the limit of the Euler sequence. The proof that the above sum equals that limit is very similar to the proof that the Euler sequence converges in the first place.
First, we use the binomial theorem to expand the expression
From that expansion it is clear that![]()
![]()
![]()
because each term in parenthesis is smaller than one. On the other hand, we also have:![]()
![]()
![]()
for N < n, because each term in parenthesis is greater than zero. But then, taking the limit as n approaches infinity, we have:![]()
![]()
![]()
Hence, taking the limit as N approaches infinity, we have the sum squeezed in between the limit of Euler's sequence, which we know is equal to e. That proves the result.![]()
![]()