<< Chapter < Page Chapter >> Page >
The theorem of the definition of e is introduced and proven.

Part (4) of [link] raises an interesting point. Suppose we have a sequence { a n } , like { n } , that is diverging to infinity, and suppose we have another sequence { b n } , like { 1 / n } , that is converging to 0. What can be said about the sequence { a n b n } ? The base a n is blowing up, while the exponent b n is going to 0. In other words, there are two competing processes going on.If a n is blowing up, then its powers ought to be blowing up as well. On the other hand, anything to the 0 power should be 1, so that,as the exponents of the elements of a sequence converge to 0, the sequence ought to converge to 1.This competition between the convergence of the base to infinity and the convergence of the exponent to 0 makes it subtle, if not impossibly difficult, to tell what the combination does.For the special case of part (4) of [link] , the answer was 1, indicating that, in that case at least, the exponents going to 0 seem to be more important thanthe base going to infinity. One can think up all kinds of such examples: { ( 2 n ) 1 / n } , { ( n ! ) 1 / n } , { ( n ! ) 1 / n 2 } , and so on. We will see later that all sorts of things can happen.

Of course there is the reverse situation. Suppose { a n } is a sequence of numbers that decreases to 1, and suppose { b n } is a sequence of numbers that diverges to infinity. What can we say about the sequence { a n b n } ? The base is tending to 1, so that one might expect that the whole sequence also would be converging to 1.On the other hand the exponents are blowing up, so that one might think that the whole sequence should blow up as well.Again, there are lots of examples, and they don't all work the same way. Here is perhaps the most famous such example.

Definition of e .

For n 1 , define a n = ( 1 + 1 / n ) n . Then the sequence { a n } is nondecreasing and bounded above, whence it is convergent.(We will denote the limit of this special sequence by the letter e . )

To see that { a n } is nondecreasing, it will suffice to prove that a n + 1 / a n 1 for all n . In the computation below, we will use the fact (part (c)of [link] ) that if x > - 1 then ( 1 + x ) n 1 + n x . So,

r c l a n + 1 a n = ( 1 + 1 n + 1 ) n + 1 ( 1 + 1 n ) n = ( n + 2 n + 1 ) n + 1 ( n + 1 n ) n = n + 1 n n + 2 n + 1 ) n + 1 ( n + 1 n ) n + 1 = n + 1 n ( n 2 + 2 n n 2 + 2 n + 1 ) n + 1 = n + 1 n ( 1 - 1 ( n + 1 ) 2 ) n + 1 n + 1 n ( 1 - ( n + 1 ) ( 1 n + 1 ) 2 ) = n + 1 n ( 1 - 1 n + 1 ) = n + 1 n n n + 1 = 1 ,

as desired.

We show next that { a n } is bounded above. This time, we use the binomial theorem, the geometric progression, and [link] .

r c l a n = ( 1 + 1 n ) n = k = 0 n n k ( 1 n ) k < k = 0 n 2 n k 2 k ( 1 n ) k = 2 k = 0 n ( 1 2 ) k = 2 1 - ( 1 2 ) n + 1 1 - 1 2 < 4 ,

as desired.

That the sequence { a n } converges is now a consequence of [link] .

REMARK We have now defined the real number e . Its central role in mathematics is not at all evident yet; at this point we have no definition of exponential function, logarithm,or trigonometric functions. It does follow from the proof above that e is between 2 and 4, and with a little more careful estimates we can show that actually e 3 . For the moment, we will omit any further discussion of its precise value. Later, in [link] , we will show that it is an irrational number.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Analysis of functions of a single variable. OpenStax CNX. Dec 11, 2010 Download for free at http://cnx.org/content/col11249/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Analysis of functions of a single variable' conversation and receive update notifications?

Ask