proof of bounds for e


Multiplying and dividing, we have

(1+1n)n=(1+1m)mk=m+1n(1+1k)k(1+1k-1)k-1

As was shown in the parent entry, the quotients in the product can be simplified to give

(1+1n)n=(1+1m)mk=m+1n(1-1k2)k(1+1k-1)

By the inequality for differences of powers,

(1-1k2)k<1-kk2+k-1=(k+1)(k-1)k2+k-1

Hence, we have the following upper bound:

(1+1n)n<(1+1m)mk=m+1nk2+kk2+k-1

By cross mutliplying, it is easy to see that

k2+kk2+k-1k2k2-1

and, hence,

(1+1n)n<(1+1m)mk=m+1nk2k2-1.

Factoring the rational function in the product, terms cancel and we have

k=m+1nk2(k+1)(k-1)=n(m+1)(n+1)m=nn+1(1+1m)

Combining,

(1+1n)n<nn+1(1+1m)m+1
Title proof of bounds for e
Canonical name ProofOfBoundsForE
Date of creation 2013-03-22 15:48:51
Last modified on 2013-03-22 15:48:51
Owner rspuzio (6075)
Last modified by rspuzio (6075)
Numerical id 4
Author rspuzio (6075)
Entry type Proof
Classification msc 33B99