The Euler Number `e`
Now let's consider sequence `x_n=(1+1/n)^n` and try to find its limit.
It is not very clear whether this sequence is monotonic or not.
So, to make sure that this sequence is increasing let's rewrite sequence using binom of Newton with `a=1` and `b=1/n`:
`(1+1/n)^n=1+C_n^1 1/n+C_n^2 1/n^2+ C_n^3 1/n^3+...+C_n^k 1/n^k+...+C_n^(n-1)1/n^(n-1)+1/n^n`
Or `(1+1/n)^n=1+n/n+(n(n-1))/2 1/n^2+(n(n-1)(n-2))/6 1/n^3+...+`
`+(n(n-1)...(n-k+1))/(k!) 1/n^k+...+n 1/n^(n-1)+1/n^n=1+1+1/2(1-1/n)+1/6 (1-1/n)(1-2/n)+...+`
Now, if we consider expansion of `x_(n+1)` i.e. increase `n` by 1 then one new `(n+2)` -th (positive) member will be added and each of written `n+1` members will increase, because every factor of the form `1-s/n` will be substituted with greater factor `1-s/(n+1)`.
Therefore, `x_(n+1)>x_n` and sequence is increasing.
Now, let's show that this sequence is bounded from above.
Since every factor inside parenthesis in the expansion of `(1+1/n)^n` is less than 1, i.e. every factor of the form `1-s/n<1` then `x_n=(1+1/n)^n<2+1/(2!)+1/(3!)+...+1/(n!)`.
Next since `n! =1*2*3*...*n>2*2*2...*2=2^(n-1)` then `1/(n!)<1/(2^(n-1))`.
This means that `x_n<2+1/(2!)+1/(3!)+...+1/(n!)<2+1/2+1/(2^2)+...+1/(2^(n-1))`.
`S=1/2+1/2^2+...+1/2^(n-1)` is geometric progression with first member `b_1=1/2` and ratio `q=1/2`. Note that here we have `n-1` summands.
Thus, sequence `x_n` is increasing and bounded from above by 3. According to theorem about monotonic sequence this sequence has finite limit.
This limit is denoted by `e`: `e=lim_(n->oo)(1+1/n)^n`.
It is called Euler's number and is very important for calculus and different applications.
Its decimal representation is `e~~2.718281828459045...`.
Fact. Number `e` is irrational.