Chapter IV · Limits of functions of a positive integral variable

The limit of (1+1/n)n(1 + 1/n)^n

§73 30 min

The sequence (1 + 1/n)ⁿ increases and stays below 3, so it has a limit; that limit is the number e.

Why this matters

(1+1/n)n(1 + 1/n)^n is a tug of war. The base 1+1/n1 + 1/n tends to 11, which pulls towards 1n=11^n = 1; the exponent nn tends to ∞\infty, which pulls towards +∞+\infty. Neither the algebra of limits nor the result on xnx^n settles it, because the base changes with nn. §73 settles it with the monotone theorem: the sequence increases and is bounded, so it converges, and its limit is one of the two most important constants in mathematics, ee. Chapter IX takes this limit as the starting point of the exponential function.

The idea

Compound interest is the classic picture. A pound at 100%100\% interest for a year becomes 22. Paid half-yearly, it becomes (1+12)2=2.25(1 + \tfrac12)^2 = 2.25; monthly, (1+112)12≈2.613(1 + \tfrac1{12})^{12} \approx 2.613; daily, about 2.71462.7146. More frequent compounding always helps, but by less and less. Does the amount grow without bound, or approach a ceiling?

Expanding by the binomial theorem shows what is going on. With nn fixed,

(1+1n)n=∑p=0n(np)1np=1+1+12!(1−1n)+13!(1−1n)(1−2n)+…\left(1 + \frac1n\right)^n = \sum_{p=0}^{n} \binom{n}{p}\frac{1}{n^p} = 1 + 1 + \frac{1}{2!}\left(1 - \frac1n\right) + \frac{1}{3!}\left(1 - \frac1n\right)\left(1 - \frac2n\right) + \dots

The term with index pp is 1p!(1−1n)(1−2n)⋯(1−p−1n)\dfrac{1}{p!}\left(1 - \dfrac1n\right)\left(1 - \dfrac2n\right)\cdots\left(1 - \dfrac{p-1}{n}\right).

Explore The expansion, term by term

Try this. Move nn from 11 up to about 1010, one step at a time, with “mark the terms for n+1n + 1” on. Then switch on the bound 1/2p−11/2^{p-1} and push nn to 6060.

(1+13)3=∑p=031p!(1−1n)⋯(1−p−1n)\left(1 + \tfrac1{3}\right)^{3} = \sum_{p=0}^{3} \frac{1}{p!}\Big(1-\tfrac1{n}\Big)\cdots\Big(1-\tfrac{p-1}{n}\Big)
pterm
  • term p for this n
  • cap 1/p!
  • term p for n + 1
Sum of all 4 terms: (1+1/3)3=2.37037(1 + 1/3)^{3} = 2.37037. For n+1=4n + 1 = 4: 2.4414062.441406, larger, because every term grew and a new one appeared. The caps give ∑p=031/p!=2.666667\sum_{p=0}^{3} 1/p! = 2.666667, which is below 1+1+12+14+⋯<31 + 1 + \tfrac12 + \tfrac14 + \dots < 3. The limit is e=2.718282e = 2.718282; at this nn the gap is 0.34790.3479.
What to notice

Every bar grows when nn increases (each bracket 1−k/n1 - k/n gets closer to 11), and a new bar appears; so the total increases. But no bar ever passes its cap 1/p!1/p!, and the caps are themselves below 1/2p−11/2^{p-1}, which add up to less than 22. So the total stays below 1+2=31 + 2 = 3.

Precise statements

Theorem The number ee Hardy: §73

The sequence ϕ(n)=(1+1/n)n\phi(n) = (1 + 1/n)^n is strictly increasing and satisfies 2≤ϕ(n)<32 \le \phi(n) < 3 for every nn. Hence it tends to a limit

e=lim⁡n→∞(1+1n)n,2<e≤3.e = \lim_{n\to\infty}\left(1 + \frac1n\right)^n, \qquad 2 < e \le 3.

(We shall see in the exercises that in fact e<2.72e < 2.72; the true value is e=2.718 281 828…e = 2.718\,281\,828\ldots)

Proofs

Proof (1+1/n)n(1 + 1/n)^n increases and is less than 33
Strategy

Write the binomial expansion so that each term is visibly an increasing function of nn; then bound each term by 1/p!1/p!, and 1/p!1/p! by 1/2p−11/2^{p-1}, and sum a geometric progression.

Rewrite the binomial coefficients

For 1≤p≤n1 \le p \le n: (np)1np=n(n−1)⋯(n−p+1)p! np=1p!(1−1n)⋯(1−p−1n)\dbinom{n}{p}\dfrac{1}{n^p} = \dfrac{n(n-1)\cdots(n-p+1)}{p!\,n^p} = \dfrac{1}{p!}\left(1 - \dfrac1n\right)\cdots\left(1 - \dfrac{p-1}{n}\right), since each factor (n−k)/n(n - k)/n equals 1−k/n1 - k/n.

Each term increases with nn

For fixed pp and k<pk < p, the factor 1−k/n1 - k/n is positive and increases with nn (strictly, when k≥1k \ge 1). So each term with p≥2p \ge 2 is strictly larger for n+1n + 1 than for nn; the terms p=0,1p = 0, 1 are always 11.

And there are more terms

The expansion for n+1n + 1 has one more term than that for nn, and it is positive. So ϕ(n+1)>ϕ(n)\phi(n+1) > \phi(n): the sequence is strictly increasing. In particular ϕ(n)≥ϕ(1)=2\phi(n) \ge \phi(1) = 2.

Bound by 1/p!1/p!, then by 1/2p−11/2^{p-1}

Each bracket is at most 11, so the pp-th term is at most 1/p!1/p!. And p!=1⋅2⋅3⋯p≥2p−1p! = 1 \cdot 2 \cdot 3 \cdots p \ge 2^{p-1} (each factor after the first is at least 22). Hence

ϕ(n)≤1+1+12!+⋯+1n!≤1+1+12+14+⋯+12n−1=3−12n−1<3.\phi(n) \le 1 + 1 + \frac1{2!} + \dots + \frac1{n!} \le 1 + 1 + \frac12 + \frac14 + \dots + \frac1{2^{n-1}} = 3 - \frac{1}{2^{n-1}} < 3.

Conclude

By Cor. 2 of §69, an increasing sequence bounded by 33 tends to a limit e≤3e \le 3. Since the sequence is strictly increasing, e>ϕ(n)e > \phi(n) for every nn (Hardy’s remark in §69), in particular e>ϕ(1)=2e > \phi(1) = 2.

Notice what the proof did not do. It never found n0(δ)n_0(\delta), and it never identified ee with anything else. The monotone theorem guarantees the limit exists; ee is then defined as that limit. How fast the sequence approaches ee is a separate question, and the answer is: slowly.

Explore How slowly (1+1/n)n(1 + 1/n)^n approaches ee

Try this. Find the smallest n0n_0 for δ=0.1\delta = 0.1 and then for δ=0.01\delta = 0.01 (show more terms when you need them, and use “Zoom in on the band”).

ϕ(n)=(1+1n)n\phi(n) = \left(1+\frac1n\right)^n , candidate limit l=2.718l = 2.718
nφ(n)
  • band l ± δ
  • l
  • n₀ (drag)
  • n ≥ n₀, good
  • n ≥ n₀, bad
12 terms with n ≥ n₀ fall outside the band: n = 1, 2, 3, 4, 5, ….
What to notice

You need n0=13n_0 = 13 for δ=0.1\delta = 0.1 and n0=135n_0 = 135 for δ=0.01\delta = 0.01: ten times the accuracy costs about ten times as many terms, since e−(1+1/n)ne - (1 + 1/n)^n is roughly e/(2n)e/(2n). The series 1+1+1/2!+1/3!+…1 + 1 + 1/2! + 1/3! + \dots, whose terms are the caps in the first explorer, reaches ee far faster.

Worked examples and exercises

Exercise A better upper bound ●●○ Hardy: §73

Improve the bound 33: show that (1+1/n)n<2.72(1 + 1/n)^n < 2.72 for every nn, so that e≤2.72e \le 2.72.

Hint
Keep the exact values 1/2!1/2! and 1/3!1/3!, and bound the terms from p=4p = 4 on by a geometric series with ratio 15\tfrac15.

Solution

For p≥4p \ge 4, p!=24⋅5⋅6⋯p≥24⋅5p−4p! = 24 \cdot 5 \cdot 6 \cdots p \ge 24 \cdot 5^{p-4}, so 1/p!≤124(1/5)p−41/p! \le \tfrac{1}{24}(1/5)^{p-4}. Therefore

(1+1n)n≤1+1+12+16+124(1+15+125+… )<2+12+16+124⋅54=2.71875.\left(1 + \frac1n\right)^n \le 1 + 1 + \frac12 + \frac16 + \frac{1}{24}\left(1 + \frac15 + \frac1{25} + \dots\right) < 2 + \frac12 + \frac16 + \frac{1}{24}\cdot\frac54 = 2.71875.

So every term is below 2.71875<2.722.71875 < 2.72, and by Cor. 2 of §69, e≤2.71875e \le 2.71875.

Exercise A lower bound from one term ●○○ Hardy: §73

Show that e>2.59e > 2.59.

Solution

The sequence is strictly increasing, so ee exceeds every term. (1+110)10=1.110=2.5937…>2.59(1 + \tfrac1{10})^{10} = 1.1^{10} = 2.5937\ldots > 2.59. (In the same way (1+1100)100=2.7048…(1 + \tfrac1{100})^{100} = 2.7048\ldots gives e>2.70e > 2.70.)

Exercise A related limit ●○○ Hardy: Math. Tripos 1934, quoted in §73

Find the limit of n−n−1(n+1)nn^{-n-1}(n + 1)^n.

Solution

n−n−1(n+1)n=(n+1)nnn⋅1n=(1+1n)n⋅1nn^{-n-1}(n+1)^n = \dfrac{(n+1)^n}{n^n}\cdot\dfrac1n = \left(1 + \dfrac1n\right)^n \cdot \dfrac1n. The first factor tends to ee and the second to 00, so by Theorem II the product tends to e⋅0=0e \cdot 0 = 0.

Exercise (1−1/n)n→1/e(1 - 1/n)^n \to 1/e ●●○ Hardy: §73

Show that (1−1/n)n→1/e(1 - 1/n)^n \to 1/e.

Hint
1−1n=n−1n=11+1/(n−1)1 - \dfrac1n = \dfrac{n-1}{n} = \dfrac{1}{1 + 1/(n-1)}.

Solution

For n≥2n \ge 2, with m=n−1m = n - 1,

(1−1n)n=1(1+1m)m+1=1(1+1m)m(1+1m).\left(1 - \frac1n\right)^n = \frac{1}{\left(1 + \frac1m\right)^{m+1}} = \frac{1}{\left(1 + \frac1m\right)^{m}\left(1 + \frac1m\right)}.

As n→∞n \to \infty so does mm, and (1+1/m)m→e(1 + 1/m)^m \to e (a shift of the original sequence), while 1+1/m→11 + 1/m \to 1. By Theorems II and III the whole expression tends to 1/(e⋅1)=1/e1/(e \cdot 1) = 1/e.

Exercise The sequence from above ●●● Hardy: §73

Let ψ(n)=(1+1/n)n+1\psi(n) = (1 + 1/n)^{n+1}. Show that ψ(n)→e\psi(n) \to e, and (harder) that ψ(n)\psi(n) decreases, so that (1+1/n)n<e<(1+1/n)n+1(1 + 1/n)^n < e < (1 + 1/n)^{n+1} for every nn.

Hint
For the limit, ψ(n)=ϕ(n)(1+1/n)\psi(n) = \phi(n)(1 + 1/n). For the decrease, show ψ(n−1)/ψ(n)>1\psi(n-1)/\psi(n) > 1 using Bernoulli’s inequality on (1+1n2−1)n\left(1 + \frac{1}{n^2 - 1}\right)^{n}.

Solution

Limit. ψ(n)=(1+1/n)n(1+1/n)→e⋅1=e\psi(n) = (1 + 1/n)^n(1 + 1/n) \to e \cdot 1 = e.

Decrease. For n≥2n \ge 2,

ψ(n−1)ψ(n)=(n/(n−1))n((n+1)/n)n+1=(n2n2−1)nnn+1=(1+1n2−1)nnn+1.\frac{\psi(n-1)}{\psi(n)} = \frac{(n/(n-1))^n}{((n+1)/n)^{n+1}} = \left(\frac{n^2}{n^2 - 1}\right)^n\frac{n}{n+1} = \left(1 + \frac{1}{n^2-1}\right)^n\frac{n}{n+1}.

By Bernoulli, (1+1n2−1)n≥1+nn2−1>1+nn2=1+1n=n+1n\left(1 + \frac{1}{n^2-1}\right)^n \ge 1 + \frac{n}{n^2 - 1} > 1 + \frac{n}{n^2} = 1 + \frac1n = \frac{n+1}{n}. So the ratio exceeds 11 and ψ(n−1)>ψ(n)\psi(n-1) > \psi(n).

Bounds. ψ\psi decreases to ee, so ψ(n)>e\psi(n) > e strictly (it is strictly decreasing, so it is never equal to its limit); and ϕ(n)<e\phi(n) < e as shown above. For n=10n = 10 this traps ee between 2.59372.5937 and 2.85312.8531.

Check yourself

Check yourself Choose one

A student argues: ”1+1/n→11 + 1/n \to 1 and 1n=11^n = 1, so (1+1/n)n→1(1 + 1/n)^n \to 1.” What is wrong?

Why

The rules of Limits of sums, products and quotients cover a fixed number of operations. Here the number of factors grows with nn, so the rule for products does not apply. The opposite argument (“base greater than 11, so it tends to +∞+\infty”) fails for the same reason: the theorem on xnx^n is about a fixed xx.

Check yourself True or false?

(1+1/n)n<e(1 + 1/n)^n < e for every positive integer nn.

Why

True. The sequence is strictly increasing, so each term is less than the next, and the limit of an increasing sequence is at least every term (Cor. 3); hence each term is strictly below ee.

Check yourself Enter a number

What is (1+1/n)n(1 + 1/n)^n for n=2n = 2?

Why

(1+12)2=(32)2=94=2.25(1 + \tfrac12)^2 = (\tfrac32)^2 = \tfrac94 = 2.25. Compare ϕ(1)=2\phi(1) = 2 and ϕ(3)=(43)3=2.370…\phi(3) = (\tfrac43)^3 = 2.370\ldots: increasing, as the theorem says.

Hardy’s language

Summary

Summary
  • In the binomial expansion of (1+1/n)n(1 + 1/n)^n, the pp-th term is 1p!(1−1n)⋯(1−p−1n)\frac1{p!}(1 - \frac1n)\cdots(1 - \frac{p-1}{n}), which grows with nn; there are also more terms. So the sequence increases strictly.
  • Each term is at most 1/p!≤1/2p−11/p! \le 1/2^{p-1}, so the sum is less than 33.
  • By the monotone theorem the sequence has a limit, which defines ee, with 2<e≤32 < e \le 3 (in fact e≈2.71828e \approx 2.71828).
  • "1∞1^\infty" is an indeterminate form: a base tending to 11 raised to a growing power can do anything.