MATH 141 Calculus 2 • McGill University, Montreal

Corrected exercises: sequences (MATH 141)

This is the corrected exercise set for sequences in MATH 141, Calculus 2, at McGill University, section 11.1 of Stewart. It opens the last third of the course: before series can be summed, their terms and their partial sums are sequences, and every convergence argument of the following chapters leans on the limits proved here. Every number is exact and chosen to be done by hand, and each solution names the theorem it uses, because a limit given without its justification earns almost nothing.

The thread running through the whole set: the limit of a sequence is decided by its TAIL, never by its first terms, and every shortcut needs its permit before it is used. L'Hôpital's rule needs a function of a real variable, so the write-up goes through f(x)f(x). The squeeze theorem needs two bounds with the SAME limit. A form 1∞1^\infty is not 11: take the logarithm. And the equation L=f(L)L = f(L) of a recursion lists candidates only once the limit is known to exist.

The traps named in the solutions: differentiating ana_n with respect to nn, concluding from the divergence of f(x)f(x) that f(n)f(n) diverges, answering ∞−∞=0\infty - \infty = 0, invoking ∣an∣→L|a_n| \to L with L≠0L \ne 0, trusting the first terms of 10nn!\frac{10^n}{n!}, answering 11 to a form 1∞1^\infty, giving the limit of ln⁡an\ln a_n instead of ana_n, taking the lower bound of a decreasing sequence for its limit, and solving L=f(L)L = f(L) before proving that the limit exists.

10 corrected exercises • 100 points • 150 minutes

Revision sheet for this chapter → Every MATH 141 chapter →

Course recap

  • • If lim⁡x→∞f(x)=L\lim_{x\to\infty} f(x) = L and f(n)=anf(n) = a_n, then an→La_n \to L. The converse is false. If an→La_n \to L and gg is continuous at LL, then g(an)→g(L)g(a_n) \to g(L).
  • • Squeeze: bn≤an≤cnb_n \le a_n \le c_n with bn→Lb_n \to L and cn→Lc_n \to L gives an→La_n \to L. And ∣an∣→0  ⟺  an→0|a_n| \to 0 \iff a_n \to 0.
  • • rn→0r^n \to 0 if ∣r∣<1|r| < 1, rn→1r^n \to 1 if r=1r = 1, and {rn}\{r^n\} diverges otherwise.
  • • n1/n→1n^{1/n} \to 1, a1/n→1a^{1/n} \to 1 for a>0a > 0, (1+xn)n→ex\left(1 + \frac{x}{n}\right)^n \to e^x. Growth: ln⁡n≪np≪bn≪n!≪nn\ln n \ll n^p \ll b^n \ll n! \ll n^n (p>0p > 0, b>1b > 1).
  • • Monotone Sequence Theorem: bounded and monotone implies convergent. Monotone by an+1−ana_{n+1} - a_n, by an+1an\frac{a_{n+1}}{a_n}, or by f′(x)f'(x).
  • • Recursion an+1=f(an)a_{n+1} = f(a_n): bounds and monotonicity by induction, then L=f(L)L = f(L) with ff continuous, then reject the candidates the bounds exclude.

Part A: the basics (/50)

Exercise 1: Reading a sequence: its formula, its tail, its limit

A sequence {an}\{a_n\} is a function whose inputs are the positive integers only. It converges to LL when the terms ana_n get as close to LL as we like for ALL nn large enough: the limit is a statement about the TAIL of the sequence, and no finite number of terms can decide it.

Three tools are enough for this exercise: divide by the dominant power of nn; the theorem if ∣an∣→0|a_n| \to 0 then an→0a_n \to 0; and the fact that a sequence converging to LL has ALL its subsequences converging to LL. The figure shows the first terms of cn=(−1)nnn+1c_n = (-1)^n \frac{n}{n+1}, even ranks in blue, odd ranks in orange.

123456789101112131415-1.5-1-0.50.511.5even n: toward 1odd n: toward -1n
  • a) Find a formula for the general term ana_n, starting at n=1n = 1, of the sequence {35, −425, 5125, −6625, 73125, … }\left\{\frac{3}{5},\ -\frac{4}{25},\ \frac{5}{125},\ -\frac{6}{625},\ \frac{7}{3125},\ \dots\right\}, then find its limit.
  • b) Find lim⁡n→∞3n2−n+45n2+2n\lim_{n\to\infty} \frac{3n^2 - n + 4}{5n^2 + 2n} and lim⁡n→∞2n+19n2+n\lim_{n\to\infty} \frac{2n + 1}{\sqrt{9n^2 + n}}.
  • c) Prove that cn=(−1)nnn+1c_n = (-1)^n \frac{n}{n+1} diverges, using its even and odd terms.
  • d) Does dn=(−1)nnd_n = \frac{(-1)^n}{\sqrt{n}} converge? Explain why the argument that works here fails in c).
  • e) A student writes: n2+3n−n→∞−∞=0\sqrt{n^2 + 3n} - n \to \infty - \infty = 0. Find the correct limit.
Show the solution

Answers

  • a) an=(−1)n+1n+25na_n = (-1)^{n+1}\frac{n+2}{5^n}, and an→0a_n \to 0
  • b) 35\frac{3}{5} and 23\frac{2}{3}
  • c) c2k→1c_{2k} \to 1 and c2k+1→−1c_{2k+1} \to -1: two different limits, so {cn}\{c_n\} diverges.
  • d) ∣dn∣=1n→0|d_n| = \frac{1}{\sqrt n} \to 0, so dn→0d_n \to 0; in c) ∣cn∣→1≠0|c_n| \to 1 \neq 0 and the theorem says nothing.
  • e) n2+3n−n→32\sqrt{n^2 + 3n} - n \to \frac{3}{2}

a) Read the pattern in three layers. The signs alternate and the first term is positive: (−1)n+1(-1)^{n+1}. The numerators 3,4,5,6,73, 4, 5, 6, 7 are n+2n + 2. The denominators 5,25,125,625,31255, 25, 125, 625, 3125 are 5n5^n. So an=(−1)n+1n+25na_n = (-1)^{n+1}\frac{n+2}{5^n}; check with n=4n = 4: (−1)5⋅6625=−6625(-1)^5 \cdot \frac{6}{625} = -\frac{6}{625}, as listed. For the limit, the sign prevents any direct computation, so pass to the absolute value: ∣an∣=n+25n|a_n| = \frac{n+2}{5^n}. With f(x)=x+25xf(x) = \frac{x+2}{5^x}, of the form ∞∞\frac{\infty}{\infty}, L'Hôpital's rule gives lim⁡x→∞15xln⁡5=0\lim_{x\to\infty}\frac{1}{5^x \ln 5} = 0, and since f(n)=∣an∣f(n) = |a_n|, ∣an∣→0|a_n| \to 0. By the theorem, an→0a_n \to 0. Writing (−1)n(-1)^n with the wrong starting sign costs the formula mark: always test the formula on the first two listed terms.

b) Divide numerator and denominator by n2n^2, the dominant power: 3−1n+4n25+2n→35\frac{3 - \frac{1}{n} + \frac{4}{n^2}}{5 + \frac{2}{n}} \to \frac{3}{5}, since 1n→0\frac{1}{n} \to 0 and 1n2→0\frac{1}{n^2} \to 0. For the second, the dominant power under the root is n2n^2, so divide by n=n2n = \sqrt{n^2}, legitimate because n>0n > 0: 2+1n9+1n→29=23\frac{2 + \frac{1}{n}}{\sqrt{9 + \frac{1}{n}}} \to \frac{2}{\sqrt 9} = \frac{2}{3}. The trap is to divide the numerator by nn and the root by nn as well, giving 9n2+nn\sqrt{\frac{9n^2 + n}{n}}: the nn goes inside the root as n2n^2.

c) The even terms are c2k=2k2k+1→1c_{2k} = \frac{2k}{2k+1} \to 1 and the odd terms are c2k+1=−2k+12k+2→−1c_{2k+1} = -\frac{2k+1}{2k+2} \to -1 as k→∞k \to \infty, which is exactly what the figure shows: two clouds of dots settling on the two dashed lines. If {cn}\{c_n\} converged to some LL, every subsequence would converge to the same LL, so we would have L=1L = 1 and L=−1L = -1 at once. Contradiction: {cn}\{c_n\} diverges. Note that the sequence is bounded, ∣cn∣<1|c_n| < 1: bounded is not enough to converge.

d) ∣dn∣=1n→0|d_n| = \frac{1}{\sqrt n} \to 0, so dn→0d_n \to 0 by the theorem: the sign alternates, but the terms are crushed toward 00 from both sides. In c), ∣cn∣=nn+1→1|c_n| = \frac{n}{n+1} \to 1, and the theorem does not apply, because it is a statement about the limit 00 ONLY. From ∣an∣→1|a_n| \to 1 one can conclude nothing: 1,1,1,…1, 1, 1, \dots converges to 11, while cnc_n diverges. Invoking the absolute value theorem with a limit other than 00 is a lost mark on every paper that does it.

e) ∞−∞\infty - \infty is an indeterminate form, not 00: both terms grow, and the question is which one grows faster, by how much. Multiply by the conjugate: n2+3n−n=(n2+3n)−n2n2+3n+n=3nn2+3n+n\sqrt{n^2 + 3n} - n = \frac{(n^2 + 3n) - n^2}{\sqrt{n^2 + 3n} + n} = \frac{3n}{\sqrt{n^2 + 3n} + n}. Divide by nn: 31+3n+1→31+1=32\frac{3}{\sqrt{1 + \frac{3}{n}} + 1} \to \frac{3}{1 + 1} = \frac{3}{2}. Sanity check with n=100n = 100: 10300≈101.49\sqrt{10300} \approx 101.49, and 101.49−100=1.49101.49 - 100 = 1.49, close to 1.51.5. The difference of two quantities that tend to infinity can tend to any number, to infinity, or to nothing at all.

Exercise 2: From n to x: when L'Hôpital is allowed, and when the converse fails

The bridge between sequences and MATH 140: if lim⁡x→∞f(x)=L\lim_{x\to\infty} f(x) = L and f(n)=anf(n) = a_n for every integer nn, then lim⁡n→∞an=L\lim_{n\to\infty} a_n = L. L'Hôpital's rule, which needs a derivative, applies to ff, a function of a REAL variable; a sequence is only defined at the integers and has no derivative. The write-up therefore always passes through f(x)f(x). A second theorem does the rest: if an→La_n \to L and gg is continuous at LL, then g(an)→g(L)g(a_n) \to g(L).

The figure shows f(x)=ln⁡xxf(x) = \frac{\ln x}{\sqrt x} and the terms an=ln⁡nna_n = \frac{\ln n}{\sqrt n} sitting on its graph for n≤40n \le 40.

5101520253035400.10.20.30.40.50.60.70.80.9y = ln(x)/√x, through every aₙstill above 0.5 at n = 40x
  • a) Looking at the figure, can you guess lim⁡an\lim a_n? Compute it, with a write-up that passes through f(x)f(x).
  • b) Find lim⁡n→∞n2en\lim_{n\to\infty} \frac{n^2}{e^n}.
  • c) Find lim⁡n→∞n1/n\lim_{n\to\infty} n^{1/n} and lim⁡n→∞(n2+1)1/n\lim_{n\to\infty} (n^2 + 1)^{1/n}.
  • d) Find lim⁡n→∞nsin⁡(1n)\lim_{n\to\infty} n \sin\left(\frac{1}{n}\right) and lim⁡n→∞n2(1−cos⁡1n)\lim_{n\to\infty} n^2\left(1 - \cos\frac{1}{n}\right).
  • e) A student argues: f(x)=sin⁡(πx)f(x) = \sin(\pi x) has no limit as x→∞x \to \infty, so an=sin⁡(πn)a_n = \sin(\pi n) diverges. Decide, and state exactly which direction of the theorem is true.
Show the solution

Answers

  • a) The graph does not show it; lim⁡ln⁡nn=0\lim \frac{\ln n}{\sqrt n} = 0.
  • b) 00
  • c) 11 and 11
  • d) 11 and 12\frac{1}{2}
  • e) False: sin⁡(πn)=0\sin(\pi n) = 0 for every nn, so an→0a_n \to 0. Only if f(x)→Lf(x) \to L then f(n)→Lf(n) \to L holds.

a) The figure does NOT give the answer: the dots rise to about 0.740.74 near n=7n = 7 and are still above 0.50.5 at n=40n = 40, so the first forty terms suggest nothing close to 00. The tail decides, and the tail needs a computation. Let f(x)=ln⁡xxf(x) = \frac{\ln x}{\sqrt x} for x≥1x \ge 1. As x→∞x \to \infty this is of the form ∞∞\frac{\infty}{\infty}, and ff is differentiable, so L'Hôpital's rule applies: lim⁡x→∞1/x1/(2x)=lim⁡x→∞2x=0\lim_{x\to\infty} \frac{1/x}{1/(2\sqrt x)} = \lim_{x\to\infty} \frac{2}{\sqrt x} = 0. Since an=f(n)a_n = f(n) for every nn, lim⁡an=0\lim a_n = 0. The expected write-up has exactly these three moves: define ff, apply the rule to ff, come back to ana_n by the theorem. Writing lim⁡ln⁡nn=lim⁡1/n1/(2n)\lim \frac{\ln n}{\sqrt n} = \lim \frac{1/n}{1/(2\sqrt n)} differentiates with respect to an integer, and a marker takes the method mark away for it.

b) f(x)=x2exf(x) = \frac{x^2}{e^x} is of the form ∞∞\frac{\infty}{\infty}. L'Hôpital once: 2xex\frac{2x}{e^x}, still ∞∞\frac{\infty}{\infty}; twice: 2ex→0\frac{2}{e^x} \to 0. Hence n2en→0\frac{n^2}{e^n} \to 0. Each application must be announced with its form: the rule is only licensed while the form is still ∞∞\frac{\infty}{\infty} or 00\frac{0}{0}, and a student who applies it once more to 2ex\frac{2}{e^x} obtains 0ex\frac{0}{e^x}, a correct number by luck and a wrong method.

c) A variable exponent calls for the logarithm. Let cn=n1/nc_n = n^{1/n}, so ln⁡cn=ln⁡nn\ln c_n = \frac{\ln n}{n}. With f(x)=ln⁡xxf(x) = \frac{\ln x}{x}, L'Hôpital gives 1/x1→0\frac{1/x}{1} \to 0, so ln⁡cn→0\ln c_n \to 0. The exponential is continuous at 00, so cn=eln⁡cn→e0=1c_n = e^{\ln c_n} \to e^0 = 1. The last sentence is the one students forget: finding ln⁡cn→0\ln c_n \to 0 and answering 00 gives the limit of the LOGARITHM, not of the sequence. For (n2+1)1/n(n^2 + 1)^{1/n}, the logarithm is ln⁡(n2+1)n\frac{\ln(n^2 + 1)}{n}; L'Hôpital on ln⁡(x2+1)x\frac{\ln(x^2+1)}{x} gives 2xx2+1→0\frac{2x}{x^2 + 1} \to 0, so the limit is again e0=1e^0 = 1. The base tends to infinity, the exponent tends to 00: this form ∞0\infty^0 is indeterminate, and here the exponent wins.

d) nsin⁡1nn \sin\frac{1}{n} is of the form ∞⋅0\infty \cdot 0. Rewrite it as a quotient with t=1xt = \frac{1}{x}, so t→0+t \to 0^+ as x→∞x \to \infty: xsin⁡1x=sin⁡tt→1x \sin\frac{1}{x} = \frac{\sin t}{t} \to 1, the limit of MATH 140 (or L'Hôpital: cos⁡t1→1\frac{\cos t}{1} \to 1). So nsin⁡1n→1n \sin\frac{1}{n} \to 1. For the second, the same substitution gives 1−cos⁡tt2\frac{1 - \cos t}{t^2}, of the form 00\frac{0}{0}; L'Hôpital gives sin⁡t2t→12\frac{\sin t}{2t} \to \frac{1}{2}. So n2(1−cos⁡1n)→12n^2\left(1 - \cos\frac{1}{n}\right) \to \frac{1}{2}. The substitution t=1xt = \frac{1}{x} turns a limit at infinity into a limit at 00, where the standard limits live.

e) The claim is FALSE. For every integer nn, sin⁡(πn)=0\sin(\pi n) = 0, so {an}\{a_n\} is the constant sequence 0,0,0,…0, 0, 0, \dots and converges to 00. The function sin⁡(πx)\sin(\pi x) does oscillate between −1-1 and 11 forever, but the integers land exactly on its zeros. The theorem goes in ONE direction: if f(x)→Lf(x) \to L then f(n)→Lf(n) \to L. The converse is false, so the divergence of ff proves nothing about the sequence. In practice: when f(x)f(x) has a limit, use it; when it has none, go back to the sequence itself.

Exercise 3: The squeeze theorem: two bounds with the same limit

Squeeze theorem for sequences: if bn≤an≤cnb_n \le a_n \le c_n for all nn beyond some rank, and bn→Lb_n \to L and cn→Lc_n \to L with the SAME LL, then an→La_n \to L. The theorem is useless without that last condition, and most of the work is in choosing bounds that achieve it.

The figure shows an=2+cos⁡nna_n = \frac{2 + \cos n}{n} for n≤20n \le 20, between the curves y=1xy = \frac{1}{x} and y=3xy = \frac{3}{x}.

24681012141618200.511.522.53upper bound 3/nlower bound 1/ndots: (2 + cos n)/nn
  • a) Prove that 2+cos⁡nn→0\frac{2 + \cos n}{n} \to 0.
  • b) Prove that n!nn→0\frac{n!}{n^n} \to 0. Hint: write the quotient as a product of nn fractions.
  • c) Find lim⁡n→∞(2n+7n)1/n\lim_{n\to\infty} (2^n + 7^n)^{1/n}.
  • d) Let ⌊t⌋\lfloor t \rfloor be the greatest integer ≤t\le t. Find lim⁡n→∞⌊n⌋n\lim_{n\to\infty} \frac{\lfloor \sqrt n \rfloor}{\sqrt n}.
  • e) Two students write: since −1≤(−1)nnn+1≤1-1 \le (-1)^n \frac{n}{n+1} \le 1, the squeeze theorem shows the sequence converges; since 0≤sin⁡2nn≤10 \le \frac{\sin^2 n}{n} \le 1, its limit is between 00 and 11. Correct both, then find lim⁡sin⁡2nn\lim \frac{\sin^2 n}{n}.
Show the solution

Answers

  • a) 1n≤an≤3n\frac{1}{n} \le a_n \le \frac{3}{n}, both bounds →0\to 0: an→0a_n \to 0
  • b) 0<n!nn≤1n0 < \frac{n!}{n^n} \le \frac{1}{n}: the limit is 00
  • c) 7≤(2n+7n)1/n≤21/n⋅77 \le (2^n + 7^n)^{1/n} \le 2^{1/n} \cdot 7: the limit is 77
  • d) 1−1n<⌊n⌋n≤11 - \frac{1}{\sqrt n} < \frac{\lfloor \sqrt n \rfloor}{\sqrt n} \le 1: the limit is 11
  • e) Bounds −1-1 and 11 do not share a limit: no conclusion. 0≤sin⁡2nn≤1n0 \le \frac{\sin^2 n}{n} \le \frac{1}{n} gives 00.

a) Since −1≤cos⁡n≤1-1 \le \cos n \le 1, we have 1≤2+cos⁡n≤31 \le 2 + \cos n \le 3, and dividing by n>0n > 0 keeps the inequalities: 1n≤2+cos⁡nn≤3n\frac{1}{n} \le \frac{2 + \cos n}{n} \le \frac{3}{n}. Both bounds tend to 00, so by the squeeze theorem 2+cos⁡nn→0\frac{2 + \cos n}{n} \to 0. The figure shows the whole mechanism: the dots wander because cos⁡n\cos n does, but they are trapped in a funnel whose two walls both go to 00. Never try to compute lim⁡cos⁡n\lim \cos n: it does not exist, and the squeeze theorem is exactly the tool that avoids needing it.

b) n!nn=1⋅2⋅3⋯nn⋅n⋅n⋯n=1n⋅2n⋅3n⋯nn\frac{n!}{n^n} = \frac{1 \cdot 2 \cdot 3 \cdots n}{n \cdot n \cdot n \cdots n} = \frac{1}{n} \cdot \frac{2}{n} \cdot \frac{3}{n} \cdots \frac{n}{n}. Each of the fractions 2n,…,nn\frac{2}{n}, \dots, \frac{n}{n} lies in (0,1](0, 1], so their product is at most 11, and 0<n!nn≤1n0 < \frac{n!}{n^n} \le \frac{1}{n}. Both bounds tend to 00: n!nn→0\frac{n!}{n^n} \to 0. L'Hôpital is powerless here, since n!n! is not a function of a real variable in MATH 141; writing the quotient as a product is THE gesture for factorials.

c) Factor out the dominant term: 2n+7n2^n + 7^n lies between 7n7^n and 7n+7n=2⋅7n7^n + 7^n = 2 \cdot 7^n. Taking nn-th roots, which preserves inequalities between positive numbers: 7≤(2n+7n)1/n≤21/n⋅77 \le (2^n + 7^n)^{1/n} \le 2^{1/n} \cdot 7. Now 21/n=e(ln⁡2)/n→e0=12^{1/n} = e^{(\ln 2)/n} \to e^0 = 1, so the upper bound tends to 77, as does the lower bound. The limit is 77. The smaller base disappears completely: the nn-th root of a sum of exponentials tends to the LARGEST base.

d) By definition, n−1<⌊n⌋≤n\sqrt n - 1 < \lfloor \sqrt n \rfloor \le \sqrt n. Dividing by n>0\sqrt n > 0: 1−1n<⌊n⌋n≤11 - \frac{1}{\sqrt n} < \frac{\lfloor \sqrt n \rfloor}{\sqrt n} \le 1. Both bounds tend to 11, so the limit is 11. The floor function jumps, and its sequence is not monotone (⌊8⌋8=28≈0.71\frac{\lfloor \sqrt 8 \rfloor}{\sqrt 8} = \frac{2}{\sqrt 8} \approx 0.71 while ⌊9⌋9=1\frac{\lfloor \sqrt 9 \rfloor}{\sqrt 9} = 1), but the jumps shrink relative to n\sqrt n, and the squeeze sees only that.

e) In the first argument the bounds are −1-1 and 11: they converge to two DIFFERENT limits, and the squeeze theorem then says nothing, which is just as well since that sequence diverges (Exercise 1 c). The second argument draws a conclusion the theorem does not contain: the squeeze gives a limit only when both bounds share it, and it never says that a limit exists and lies between two bounds. Choose better bounds instead: 0≤sin⁡2n≤10 \le \sin^2 n \le 1 gives 0≤sin⁡2nn≤1n0 \le \frac{\sin^2 n}{n} \le \frac{1}{n}, and both tend to 00, so sin⁡2nn→0\frac{\sin^2 n}{n} \to 0. The rule to remember: a bound that does not tend to the target is not a bound, it is a waste of a line.

Exercise 4: Geometric sequences and the growth ladder: the tail decides

The geometric sequence {rn}\{r^n\} converges exactly when −1<r≤1-1 < r \le 1: to 00 if ∣r∣<1|r| < 1, to 11 if r=1r = 1. For r>1r > 1 it tends to ∞\infty, and for r≤−1r \le -1 it oscillates and diverges. Beyond it, the growth ladder orders the classic sequences: ln⁡n≪np≪bn≪n!≪nn\ln n \ll n^p \ll b^n \ll n! \ll n^n for p>0p > 0 and b>1b > 1, where un≪vnu_n \ll v_n means unvn→0\frac{u_n}{v_n} \to 0.

The figure shows an=10nn!a_n = \frac{10^n}{n!} for n≤30n \le 30. Its first terms are anything but small.

51015202530500100015002000250030003500a₉ = a₁₀, the topaₙ = 10ⁿ/n!n
  • a) Decide the behaviour of (−34)n\left(-\frac{3}{4}\right)^n, (54)n\left(\frac{5}{4}\right)^n, (−1)n(-1)^n and (−54)n\left(-\frac{5}{4}\right)^n.
  • b) Find lim⁡n→∞2n+3n+13n−4\lim_{n\to\infty} \frac{2^n + 3^{n+1}}{3^n - 4} and lim⁡n→∞5n−4n+25n+1+3n\lim_{n\to\infty} \frac{5^n - 4^{n+2}}{5^{n+1} + 3^n}.
  • c) For an=10nn!a_n = \frac{10^n}{n!}, compute an+1an\frac{a_{n+1}}{a_n} and explain the shape of the figure. Then prove that an→0a_n \to 0 by squeezing ana_n under a geometric sequence.
  • d) Prove the two rungs n32n→0\frac{n^3}{2^n} \to 0 and 2nn!→0\frac{2^n}{n!} \to 0.
  • e) Find lim⁡n→∞n1001.01n\lim_{n\to\infty} \frac{n^{100}}{1.01^n}, although a1000a_{1000} is a number with more than 295295 digits.
Show the solution

Answers

  • a) →0\to 0; →∞\to \infty; diverges (oscillates); diverges (oscillates, ∣⋅∣→∞|\cdot| \to \infty)
  • b) 33 and 15\frac{1}{5}
  • c) an+1an=10n+1\frac{a_{n+1}}{a_n} = \frac{10}{n+1}; for n≥10n \ge 10, 0<an≤a10(1011)n−10→00 < a_n \le a_{10}\left(\frac{10}{11}\right)^{n-10} \to 0
  • d) L'Hôpital three times on x32x\frac{x^3}{2^x}; 0<2nn!≤2(23)n−20 < \frac{2^n}{n!} \le 2\left(\frac{2}{3}\right)^{n-2}
  • e) 00

a) ∣−34∣<1\left|-\frac{3}{4}\right| < 1, so (−34)n→0\left(-\frac{3}{4}\right)^n \to 0: the sign alternates, the size shrinks. 54>1\frac{5}{4} > 1, so (54)n→∞\left(\frac{5}{4}\right)^n \to \infty. (−1)n(-1)^n takes the values −1,1,−1,…-1, 1, -1, \dots: its even and odd terms have different limits, so it diverges. (−54)n\left(-\frac{5}{4}\right)^n diverges too, since ∣(−54)n∣→∞\left|\left(-\frac{5}{4}\right)^n\right| \to \infty while the sign alternates: it tends neither to ∞\infty nor to −∞-\infty, and the correct word is diverges, not tends to infinity. The case r=−1r = -1 is the one students misplace: it is inside [−1,1][-1, 1] and yet the sequence diverges.

b) Divide by the dominant exponential, the one with the largest base. In the first, it is 3n3^n: (23)n+31−43n→0+31−0=3\frac{\left(\frac{2}{3}\right)^n + 3}{1 - \frac{4}{3^n}} \to \frac{0 + 3}{1 - 0} = 3, because 3n+1=3⋅3n3^{n+1} = 3 \cdot 3^n. In the second, it is 5n5^n: numerator 5n−16⋅4n5^n - 16 \cdot 4^n, denominator 5⋅5n+3n5 \cdot 5^n + 3^n, so 1−16(45)n5+(35)n→15\frac{1 - 16\left(\frac{4}{5}\right)^n}{5 + \left(\frac{3}{5}\right)^n} \to \frac{1}{5}. The shifted exponents 3n+13^{n+1} and 4n+24^{n+2} are only constants in disguise, 3⋅3n3 \cdot 3^n and 16⋅4n16 \cdot 4^n: rewrite them BEFORE dividing.

c) an+1an=10n+1(n+1)!⋅n!10n=10n+1\frac{a_{n+1}}{a_n} = \frac{10^{n+1}}{(n+1)!} \cdot \frac{n!}{10^n} = \frac{10}{n+1}. This quotient is larger than 11 for n≤8n \le 8, equal to 11 for n=9n = 9 and smaller than 11 for n≥10n \ge 10: the sequence climbs until a9=a10=1099!a_9 = a_{10} = \frac{10^9}{9!}, larger than 27002700, then decreases, which is the hump of the figure. For n≥10n \ge 10, every new factor 10k\frac{10}{k} with k≥11k \ge 11 is at most 1011\frac{10}{11}, so 0<an≤a10(1011)n−100 < a_n \le a_{10}\left(\frac{10}{11}\right)^{n-10}. Since ∣1011∣<1\left|\frac{10}{11}\right| < 1, the upper bound tends to 00, and so does ana_n by the squeeze theorem. Looking at the first nine terms and concluding that the sequence tends to infinity is the error the figure is designed to provoke: the tail decides.

d) With f(x)=x32xf(x) = \frac{x^3}{2^x}, of the form ∞∞\frac{\infty}{\infty}, L'Hôpital three times gives 3x22xln⁡2\frac{3x^2}{2^x \ln 2}, 6x2x(ln⁡2)2\frac{6x}{2^x (\ln 2)^2}, then 62x(ln⁡2)3→0\frac{6}{2^x (\ln 2)^3} \to 0, so n32n→0\frac{n^3}{2^n} \to 0. For 2nn!\frac{2^n}{n!} the method of c) applies: 2nn!=21⋅22⋅23⋯2n≤2⋅1⋅(23)n−2\frac{2^n}{n!} = \frac{2}{1} \cdot \frac{2}{2} \cdot \frac{2}{3} \cdots \frac{2}{n} \le 2 \cdot 1 \cdot \left(\frac{2}{3}\right)^{n-2} for n≥2n \ge 2, and (23)n−2→0\left(\frac{2}{3}\right)^{n-2} \to 0. The two rungs of the ladder need two different tools: L'Hôpital for a power against an exponential, a product and a squeeze as soon as a factorial appears.

e) Take the logarithm: ln⁡an=100ln⁡n−nln⁡1.01=n(100ln⁡nn−ln⁡1.01)\ln a_n = 100 \ln n - n \ln 1.01 = n\left(\frac{100 \ln n}{n} - \ln 1.01\right). By Exercise 2, ln⁡nn→0\frac{\ln n}{n} \to 0, so the bracket tends to −ln⁡1.01-\ln 1.01, a NEGATIVE number since 1.01>11.01 > 1, and ln⁡an→−∞\ln a_n \to -\infty. Hence an=eln⁡an→0a_n = e^{\ln a_n} \to 0. The terms are enormous for a very long time: a1000=103001.011000a_{1000} = \frac{10^{300}}{1.01^{1000}} and 1.011000=e1000ln⁡1.01<e10<310<1051.01^{1000} = e^{1000 \ln 1.01} < e^{10} < 3^{10} < 10^5, because ln⁡1.01<0.01\ln 1.01 < 0.01 (the graph of ln⁡(1+u)\ln(1 + u) lies below its tangent line y=uy = u), so a1000>10295a_{1000} > 10^{295}. Yet the exponential wins in the end. Any exponential with base b>1b > 1, however close to 11, beats any power of nn.

Exercise 5: The limit (1 + x/n)^n, and why 1 to the power infinity is not 1

The sequence (1+xn)n\left(1 + \frac{x}{n}\right)^n has a base that tends to 11 and an exponent that tends to ∞\infty. The form 1∞1^\infty is INDETERMINATE: base and exponent move at the same time, and the limit depends on the race between them. The only safe gesture is to take the logarithm first.

The figure shows xn=(1+1n)nx_n = \left(1 + \frac{1}{n}\right)^n in blue and dn=(1+1n)n+1d_n = \left(1 + \frac{1}{n}\right)^{n+1} in orange, on either side of the line y=ey = e. You may admit that {xn}\{x_n\} is strictly increasing and {dn}\{d_n\} strictly decreasing.

123456789101112131415161.522.533.544.5dₙ = (1 + 1/n)ⁿ⁺¹xₙ = (1 + 1/n)ⁿy = en
  • a) Prove that for every real number xx, (1+xn)n→ex\left(1 + \frac{x}{n}\right)^n \to e^x.
  • b) Find the limits of (1−3n)n\left(1 - \frac{3}{n}\right)^n, (1+2n)5n\left(1 + \frac{2}{n}\right)^{5n} and (nn+1)n\left(\frac{n}{n+1}\right)^n.
  • c) A student writes: 1+1n→11 + \frac{1}{n} \to 1 and 1n=11^n = 1, so (1+1n)n→1\left(1 + \frac{1}{n}\right)^n \to 1. Refute this with the three sequences (1+1n2)n\left(1 + \frac{1}{n^2}\right)^n, (1+1n)n\left(1 + \frac{1}{n}\right)^n and (1+1n)n2\left(1 + \frac{1}{n}\right)^{n^2}.
  • d) Find lim⁡(1−1n2)n\lim \left(1 - \frac{1}{n^2}\right)^n in two ways: by a factorization, then by the logarithm.
  • e) Prove that dn→ed_n \to e as well, and deduce that 2<e<32 < e < 3 from x1x_1 and d5d_5, without a calculator.
Show the solution

Answers

  • a) ln⁡an=ln⁡(1+x/n)1/n→x\ln a_n = \frac{\ln(1 + x/n)}{1/n} \to x, so an→exa_n \to e^x
  • b) e−3e^{-3}, e10e^{10}, e−1e^{-1}
  • c) 11, ee and ∞\infty: the form 1∞1^\infty decides nothing.
  • d) 11
  • e) dn=xn(1+1n)→ed_n = x_n\left(1 + \frac{1}{n}\right) \to e; 2=x1<e<d5=4665615625<32 = x_1 < e < d_5 = \frac{46656}{15625} < 3

a) For x=0x = 0 the sequence is constant, equal to 1=e01 = e^0. Otherwise, for n>∣x∣n > |x| the base is positive and ln⁡an=nln⁡(1+xn)\ln a_n = n \ln\left(1 + \frac{x}{n}\right), of the form ∞⋅0\infty \cdot 0. Pass to a real variable with t=1nt = \frac{1}{n}: consider g(t)=ln⁡(1+xt)tg(t) = \frac{\ln(1 + xt)}{t} as t→0+t \to 0^+, of the form 00\frac{0}{0}. L'Hôpital: x/(1+xt)1→x\frac{x/(1 + xt)}{1} \to x. So ln⁡an→x\ln a_n \to x, and since the exponential is continuous, an=eln⁡an→exa_n = e^{\ln a_n} \to e^x. Every word of that chain is needed: the logarithm turns the variable exponent into a product, the substitution turns the product into a quotient, and continuity brings the answer back from the logarithm.

b) (1−3n)n\left(1 - \frac{3}{n}\right)^n is a) with x=−3x = -3: e−3e^{-3}. Next, (1+2n)5n=[(1+2n)n]5→(e2)5=e10\left(1 + \frac{2}{n}\right)^{5n} = \left[\left(1 + \frac{2}{n}\right)^n\right]^5 \to (e^2)^5 = e^{10}, by continuity of y↦y5y \mapsto y^5. Finally (nn+1)n=1(1+1n)n→1e\left(\frac{n}{n+1}\right)^n = \frac{1}{\left(1 + \frac{1}{n}\right)^n} \to \frac{1}{e}. The exponent must be matched to the denominator inside the bracket before a) is quoted: (1+2n)5n\left(1 + \frac{2}{n}\right)^{5n} is not e2e^2 and not e5e^{5}, and flipping the fraction in the third turns an unfamiliar form into a known one.

c) For un=(1+1n2)nu_n = \left(1 + \frac{1}{n^2}\right)^n: ln⁡un=nln⁡(1+1n2)=1n⋅n2ln⁡(1+1n2)\ln u_n = n \ln\left(1 + \frac{1}{n^2}\right) = \frac{1}{n} \cdot n^2 \ln\left(1 + \frac{1}{n^2}\right). By a) with x=1x = 1 and n2n^2 in place of nn, the second factor tends to 11, so ln⁡un→0⋅1=0\ln u_n \to 0 \cdot 1 = 0 and un→1u_n \to 1. For (1+1n)n\left(1 + \frac{1}{n}\right)^n the limit is ee by a). For wn=(1+1n)n2w_n = \left(1 + \frac{1}{n}\right)^{n^2}: ln⁡wn=n⋅[nln⁡(1+1n)]\ln w_n = n \cdot \left[n \ln\left(1 + \frac{1}{n}\right)\right], and the bracket tends to 11, so ln⁡wn→∞\ln w_n \to \infty and wn→∞w_n \to \infty. Three sequences of the same form 1∞1^\infty, three different answers: 11, ee and ∞\infty. The student's error is to let the base reach its limit while the exponent keeps growing; they move together, and only the logarithm keeps track of both.

d) Factor: 1−1n2=(1−1n)(1+1n)1 - \frac{1}{n^2} = \left(1 - \frac{1}{n}\right)\left(1 + \frac{1}{n}\right), so (1−1n2)n=(1−1n)n(1+1n)n→e−1⋅e=1\left(1 - \frac{1}{n^2}\right)^n = \left(1 - \frac{1}{n}\right)^n \left(1 + \frac{1}{n}\right)^n \to e^{-1} \cdot e = 1, by a) twice and the product of limits. By the logarithm: nln⁡(1−1n2)=1n⋅n2ln⁡(1−1n2)→0⋅(−1)=0n \ln\left(1 - \frac{1}{n^2}\right) = \frac{1}{n} \cdot n^2 \ln\left(1 - \frac{1}{n^2}\right) \to 0 \cdot (-1) = 0, so the limit is e0=1e^0 = 1. Two methods, one answer: when they disagree, one of them has used a limit law on a form that is still indeterminate.

e) dn=(1+1n)n(1+1n)=xn(1+1n)→e⋅1=ed_n = \left(1 + \frac{1}{n}\right)^n \left(1 + \frac{1}{n}\right) = x_n \left(1 + \frac{1}{n}\right) \to e \cdot 1 = e. Since {xn}\{x_n\} is strictly increasing with limit ee, every term is strictly below the limit: x1=2<ex_1 = 2 < e. Since {dn}\{d_n\} is strictly decreasing with limit ee, every term is strictly above it: e<d5=(65)6=4665615625e < d_5 = \left(\frac{6}{5}\right)^6 = \frac{46656}{15625}. And 3⋅15625=46875>466563 \cdot 15625 = 46875 > 46656, so d5<3d_5 < 3. Hence 2<e<32 < e < 3, proved with two integer multiplications. The figure shows the same thing: the two families of dots close in on ee from both sides, and any pair of terms brackets it.

Part B: problems and reasoning (/50)

Exercise 6: Monotone and bounded: convergence before the limit

Monotone Sequence Theorem: every sequence that is bounded and monotone converges. An increasing sequence bounded above converges to its least upper bound, a decreasing one bounded below to its greatest lower bound. The theorem proves that a limit EXISTS without computing it, which is exactly what a recursion or a product needs, and it says nothing about WHICH number the limit is.

Monotonicity is proved in one of three ways: the sign of an+1−ana_{n+1} - a_n, the comparison of an+1an\frac{a_{n+1}}{a_n} with 11 for positive terms, or the sign of f′(x)f'(x) when an=f(n)a_n = f(n).

  • a) Let an=nn2+4a_n = \frac{n}{n^2 + 4}. Compute a1a_1, a2a_2, a3a_3, show with a derivative that the sequence is decreasing from n=2n = 2 on, and conclude.
  • b) Let bn=n!1⋅3⋅5⋯(2n−1)b_n = \frac{n!}{1 \cdot 3 \cdot 5 \cdots (2n - 1)}. Show that bn+1bn≤23\frac{b_{n+1}}{b_n} \le \frac{2}{3} for n≥1n \ge 1, deduce that {bn}\{b_n\} converges, and find its limit.
  • c) Give an example of a bounded sequence that diverges, a monotone sequence that diverges, and a convergent sequence that is not monotone.
  • d) Let pn=(1−122)(1−132)⋯(1−1n2)p_n = \left(1 - \frac{1}{2^2}\right)\left(1 - \frac{1}{3^2}\right)\cdots\left(1 - \frac{1}{n^2}\right) for n≥2n \ge 2. Show that {pn}\{p_n\} converges BEFORE computing anything, then prove that pn=n+12np_n = \frac{n+1}{2n} and find the limit.
  • e) A student writes: pnp_n is decreasing and bounded below by 00, so pn→0p_n \to 0. Explain what is wrong, and what the theorem really gives.
Show the solution

Answers

  • a) 15,14,313\frac{1}{5}, \frac{1}{4}, \frac{3}{13}; f′(x)≤0f'(x) \le 0 for x≥2x \ge 2; decreasing, bounded below by 00, limit 00
  • b) bn+1bn=n+12n+1≤23\frac{b_{n+1}}{b_n} = \frac{n+1}{2n+1} \le \frac{2}{3}; 0<bn≤(23)n−10 < b_n \le \left(\frac{2}{3}\right)^{n-1}, limit 00
  • c) (−1)n(-1)^n; n\sqrt n; (−1)nn\frac{(-1)^n}{n}
  • d) Decreasing and positive, so convergent; pn=n+12n→12p_n = \frac{n+1}{2n} \to \frac{1}{2}
  • e) The bound 00 is a lower bound, not the limit; the limit is the GREATEST lower bound, here 12\frac{1}{2}.

a) a1=15a_1 = \frac{1}{5}, a2=28=14a_2 = \frac{2}{8} = \frac{1}{4}, a3=313a_3 = \frac{3}{13}: the sequence first rises (15<14\frac{1}{5} < \frac{1}{4}), then falls (313<14\frac{3}{13} < \frac{1}{4} since 12<1312 < 13). With f(x)=xx2+4f(x) = \frac{x}{x^2 + 4}, the quotient rule gives f′(x)=(x2+4)−2x2(x2+4)2=4−x2(x2+4)2f'(x) = \frac{(x^2 + 4) - 2x^2}{(x^2 + 4)^2} = \frac{4 - x^2}{(x^2 + 4)^2}, which is ≤0\le 0 for x≥2x \ge 2. So ff decreases on [2,∞)[2, \infty) and an=f(n)a_n = f(n) decreases from n=2n = 2 on. Since an>0a_n > 0, the tail is decreasing and bounded below, and the sequence converges; dividing by n2n^2, an=1/n1+4/n2→0a_n = \frac{1/n}{1 + 4/n^2} \to 0. A sequence only needs to be monotone EVENTUALLY: the theorem looks at the tail, and the first term a1a_1 changes nothing.

b) bn+1bn=(n+1)!n!⋅1⋅3⋯(2n−1)1⋅3⋯(2n−1)(2n+1)=n+12n+1\frac{b_{n+1}}{b_n} = \frac{(n+1)!}{n!} \cdot \frac{1 \cdot 3 \cdots (2n - 1)}{1 \cdot 3 \cdots (2n - 1)(2n + 1)} = \frac{n + 1}{2n + 1}. Now n+12n+1≤23\frac{n+1}{2n+1} \le \frac{2}{3} is equivalent to 3n+3≤4n+23n + 3 \le 4n + 2, that is n≥1n \ge 1. So each term is at most 23\frac{2}{3} of the previous one: the positive sequence is decreasing, bounded below by 00, hence convergent. Better, iterating from b1=1b_1 = 1: 0<bn≤(23)n−10 < b_n \le \left(\frac{2}{3}\right)^{n-1}, and the squeeze theorem gives bn→0b_n \to 0. Here the quotient serves twice: it proves the monotonicity, then it squeezes the sequence under a geometric one, which finds the limit that the theorem alone could not.

c) (−1)n(-1)^n is bounded by 11 and diverges: bounded is not enough. n\sqrt n is increasing and tends to ∞\infty: monotone is not enough. (−1)nn\frac{(-1)^n}{n} converges to 00 (its absolute value 1n→0\frac{1}{n} \to 0) while alternating in sign, so it is not monotone: the theorem gives a SUFFICIENT condition, not a necessary one. Three examples, one per hypothesis, is the answer a marker expects to a question of this kind.

d) Each factor 1−1k21 - \frac{1}{k^2} lies in (0,1)(0, 1), so pn+1=pn(1−1(n+1)2)<pnp_{n+1} = p_n\left(1 - \frac{1}{(n+1)^2}\right) < p_n, and pn>0p_n > 0 as a product of positive numbers: {pn}\{p_n\} is decreasing and bounded below by 00, so it converges, before any computation. To find the limit, factor: 1−1k2=k−1k⋅k+1k1 - \frac{1}{k^2} = \frac{k-1}{k} \cdot \frac{k+1}{k}. Then pn=(12⋅23⋯n−1n)(32⋅43⋯n+1n)=1n⋅n+12p_n = \left(\frac{1}{2} \cdot \frac{2}{3} \cdots \frac{n-1}{n}\right)\left(\frac{3}{2} \cdot \frac{4}{3} \cdots \frac{n+1}{n}\right) = \frac{1}{n} \cdot \frac{n+1}{2}, each product collapsing to its extreme terms. So pn=n+12np_n = \frac{n+1}{2n}, which checks for n=2n = 2: 34=1−14\frac{3}{4} = 1 - \frac{1}{4}, and for n=3n = 3: 34⋅89=23=46\frac{3}{4} \cdot \frac{8}{9} = \frac{2}{3} = \frac{4}{6}. The limit is 12\frac{1}{2}.

e) The theorem says that a decreasing sequence bounded below converges to its GREATEST lower bound, which is in general not the bound you happened to find. Here 00 is a lower bound, but so is every number up to 12\frac{1}{2}, since pn=12+12n>12p_n = \frac{1}{2} + \frac{1}{2n} > \frac{1}{2}; the greatest one is 12\frac{1}{2}, and the figure of the solution shows the dots stopping there, far above 00. What the student may write is: {pn}\{p_n\} converges to some L≥0L \ge 0. The value of LL comes from another argument, here the closed form of d). The same error in the other direction, increasing and bounded above by 55 so the limit is 55, is refuted by 3−1n3 - \frac{1}{n}.

24681012141618200.250.50.751decreasing, with limit 1/2the lower bound 0 is never approachedn

Exercise 7: A recursive sequence: existence first, then L = f(L)

A sequence defined by recursion, an+1=f(an)a_{n+1} = f(a_n), is solved in a fixed order. First prove that the limit EXISTS, usually by showing by induction that the sequence is bounded and monotone. Only then let n→∞n \to \infty in the recursion: since an+1→La_{n+1} \to L as well, and ff is continuous, L=f(L)L = f(L). That equation gives CANDIDATES, and the bounds proved at the first step choose among them.

Here a1=1a_1 = 1 and an+1=6+ana_{n+1} = \sqrt{6 + a_n}. The figure is the cobweb diagram of the recursion: from a1a_1, go up to the curve y=6+xy = \sqrt{6 + x} to read a2a_2, across to the line y=xy = x to carry a2a_2 back to the horizontal axis, and so on.

12341234y = √(6 + x)y = xa₁(3, 3)
  • a) Compute a2a_2 and a3a_3. Prove by induction that 1≤an<31 \le a_n < 3 for every nn.
  • b) Prove that {an}\{a_n\} is increasing, using an+12−an2a_{n+1}^2 - a_n^2.
  • c) Conclude that {an}\{a_n\} converges, and find its limit, justifying every step and rejecting any wrong candidate.
  • d) Same recursion, new start: a1=10a_1 = 10. What changes in a) and b), and what is the limit?
  • e) Two warnings. For b1=1b_1 = 1 and bn+1=2bn+1b_{n+1} = 2b_n + 1, a student solves L=2L+1L = 2L + 1 and answers −1-1. For cn+1=cn2c_{n+1} = c_n^2, the equation L=L2L = L^2 gives 00 or 11. Find what really happens, for c1=12c_1 = \frac{1}{2} and for c1=2c_1 = 2.
Show the solution

Answers

  • a) a2=7a_2 = \sqrt 7, a3=6+7a_3 = \sqrt{6 + \sqrt 7}; 1≤an<31 \le a_n < 3 by induction
  • b) an+12−an2=(3−an)(2+an)>0a_{n+1}^2 - a_n^2 = (3 - a_n)(2 + a_n) > 0
  • c) Increasing and bounded above, so convergent; L=6+LL = \sqrt{6 + L} gives L=3L = 3 (L=−2L = -2 rejected).
  • d) an>3a_n > 3 and decreasing; the limit is still 33.
  • e) bn=2n−1→∞b_n = 2^n - 1 \to \infty; cn→0c_n \to 0 from 12\frac{1}{2}, cn→∞c_n \to \infty from 22.

a) a2=6+1=7a_2 = \sqrt{6 + 1} = \sqrt 7 and a3=6+7a_3 = \sqrt{6 + \sqrt 7}. Induction on P(n)P(n): 1≤an<31 \le a_n < 3. Base: a1=1a_1 = 1, and 1≤1<31 \le 1 < 3. Step: assume 1≤an<31 \le a_n < 3; then 7≤6+an<97 \le 6 + a_n < 9, and since the square root is increasing, 7≤an+1<3\sqrt 7 \le a_{n+1} < 3, and 7>1\sqrt 7 > 1. So P(n+1)P(n + 1) holds, and P(n)P(n) holds for every n≥1n \ge 1. The upper bound 33 is not guessed: it is the point where the curve meets the line y=xy = x on the figure, and the inductive step works precisely because 6+3=3\sqrt{6 + 3} = 3.

b) an+12−an2=(6+an)−an2=−(an2−an−6)=−(an−3)(an+2)=(3−an)(2+an)a_{n+1}^2 - a_n^2 = (6 + a_n) - a_n^2 = -(a_n^2 - a_n - 6) = -(a_n - 3)(a_n + 2) = (3 - a_n)(2 + a_n). By a), 3−an>03 - a_n > 0 and 2+an>02 + a_n > 0, so an+12>an2a_{n+1}^2 > a_n^2, and since both terms are positive, an+1>ana_{n+1} > a_n. The sequence is increasing. The factorization is the heart of the question: its two factors are the two candidates of c), and their signs are decided by the bounds of a).

c) By a) and b), {an}\{a_n\} is increasing and bounded above by 33, so by the Monotone Sequence Theorem it converges to some LL, with 1≤L≤31 \le L \le 3. As n→∞n \to \infty, an+1→La_{n+1} \to L too, and x↦6+xx \mapsto \sqrt{6 + x} is continuous, so L=6+LL = \sqrt{6 + L}. Squaring, L2−L−6=0L^2 - L - 6 = 0, that is (L−3)(L+2)=0(L - 3)(L + 2) = 0: the candidates are 33 and −2-2. Since L≥1L \ge 1, L=−2L = -2 is rejected (it does not even satisfy L=6+LL = \sqrt{6 + L}, as a square root is never negative). So an→3a_n \to 3. The order of the three steps is the whole method: existence, then the equation, then the choice.

d) Now a2=16=4a_2 = \sqrt{16} = 4 and a3=10a_3 = \sqrt{10}. The same induction shows an>3a_n > 3 for all nn: if an>3a_n > 3 then 6+an>96 + a_n > 9 and an+1>3a_{n+1} > 3. The identity of b) then gives an+12−an2=(3−an)(2+an)<0a_{n+1}^2 - a_n^2 = (3 - a_n)(2 + a_n) < 0, so the sequence is DECREASING and bounded below by 33. It converges, the same equation gives the same candidates, and the limit is 33 again. On the cobweb the staircase now comes down from the right. The bound and the direction of monotonicity depend on the start; the candidates do not.

e) For bnb_n: b2=3b_2 = 3, b3=7b_3 = 7, b4=15b_4 = 15, and by induction bn=2n−1b_n = 2^n - 1, since 2(2n−1)+1=2n+1−12(2^n - 1) + 1 = 2^{n+1} - 1. So bn→∞b_n \to \infty. The equation L=2L+1L = 2L + 1 had a solution, −1-1, but the recursion has no finite limit at all: solving L=f(L)L = f(L) BEFORE proving existence gave an answer that is not even positive, although every term is. For cnc_n: from c1=12c_1 = \frac{1}{2}, cn=(12)2n−1→0c_n = \left(\frac{1}{2}\right)^{2^{n-1}} \to 0; from c1=2c_1 = 2, cn=22n−1→∞c_n = 2^{2^{n-1}} \to \infty. The candidates 00 and 11 are the only POSSIBLE finite limits, and whether one is reached depends on the start. The equation lists candidates; it never proves that a limit exists.

Exercise 8: Five statements to correct

Each statement below was written by a student on a MATH 141 assignment, and each is false. Say what is wrong, give a counterexample, and write the correct statement.

  • a) If an=f(n)a_n = f(n) and lim⁡an=L\lim a_n = L, then lim⁡x→∞f(x)=L\lim_{x\to\infty} f(x) = L.
  • b) Every bounded sequence converges.
  • c) If ∣an∣→L|a_n| \to L, then an→La_n \to L or an→−La_n \to -L.
  • d) If an+1−an→0a_{n+1} - a_n \to 0, then {an}\{a_n\} converges.
  • e) If an→0a_n \to 0, then anbn→0a_n b_n \to 0 for any sequence {bn}\{b_n\}.
Show the solution

Answers

  • a) False: sin⁡(πn)→0\sin(\pi n) \to 0 while sin⁡(πx)\sin(\pi x) has no limit. True the other way round.
  • b) False: (−1)n(-1)^n. True for a bounded AND monotone sequence.
  • c) False: ∣(−1)n∣→1|(-1)^n| \to 1 yet (−1)n(-1)^n diverges. True when L=0L = 0.
  • d) False: n+1−n→0\sqrt{n+1} - \sqrt n \to 0 but n→∞\sqrt n \to \infty.
  • e) False: 1n⋅n2=n→∞\frac{1}{n} \cdot n^2 = n \to \infty. True when {bn}\{b_n\} is bounded.

a) FALSE. Take f(x)=sin⁡(πx)f(x) = \sin(\pi x): an=sin⁡(πn)=0a_n = \sin(\pi n) = 0 for every integer nn, so an→0a_n \to 0, while sin⁡(πx)\sin(\pi x) oscillates between −1-1 and 11 and has no limit. The sequence only samples ff at the integers, and the samples can miss everything ff does in between. Correct statement: if lim⁡x→∞f(x)=L\lim_{x\to\infty} f(x) = L, then lim⁡an=L\lim a_n = L. The theorem is the tool that licenses L'Hôpital on sequences, and it works in that direction only.

b) FALSE. (−1)n(-1)^n is bounded by 11, and its even terms tend to 11 while its odd terms tend to −1-1, so it diverges. Correct statement: every bounded MONOTONE sequence converges (Monotone Sequence Theorem). The converse half is true: every convergent sequence is bounded, so an unbounded sequence always diverges.

c) FALSE. an=(−1)na_n = (-1)^n has ∣an∣=1→1|a_n| = 1 \to 1, but ana_n converges neither to 11 nor to −1-1: it keeps jumping between the two. Knowing the size of the terms does not fix their sign. Correct statement: ∣an∣→0|a_n| \to 0 if and only if an→0a_n \to 0, because −∣an∣≤an≤∣an∣-|a_n| \le a_n \le |a_n| and the squeeze theorem applies when both bounds tend to 00, and to 00 only.

d) FALSE. an=na_n = \sqrt n: an+1−an=n+1−n=1n+1+n→0a_{n+1} - a_n = \sqrt{n+1} - \sqrt n = \frac{1}{\sqrt{n+1} + \sqrt n} \to 0, by the conjugate, yet n→∞\sqrt n \to \infty. The steps shrink, but not fast enough to stop the climb; ln⁡n\ln n is another example, with ln⁡(n+1)−ln⁡n=ln⁡(1+1n)→0\ln(n+1) - \ln n = \ln\left(1 + \frac{1}{n}\right) \to 0. Correct statement: if {an}\{a_n\} converges, then an+1−an→0a_{n+1} - a_n \to 0; the implication does not reverse.

e) FALSE. an=1n→0a_n = \frac{1}{n} \to 0 and bn=n2b_n = n^2 give anbn=n→∞a_n b_n = n \to \infty; with bn=5nb_n = 5n the product is the constant 55. The form 0⋅∞0 \cdot \infty is indeterminate. Correct statement: if an→0a_n \to 0 and {bn}\{b_n\} is BOUNDED, say ∣bn∣≤M|b_n| \le M, then anbn→0a_n b_n \to 0, since 0≤∣anbn∣≤M∣an∣→00 \le |a_n b_n| \le M|a_n| \to 0. This is the argument that settles cos⁡nn\frac{\cos n}{n} in one line.

Exercise 9: Compound interest: the sequence that climbs to continuous compounding

A deposit of 10001000 dollars earns interest at the annual rate of 6%6\%. If the interest is compounded nn times a year, each period adds 0.06n\frac{0.06}{n} of the balance, and after one year the balance is An=1000(1+0.06n)nA_n = 1000\left(1 + \frac{0.06}{n}\right)^n dollars. Banks advertise monthly, daily, even continuous compounding: is more always better, and by how much?

The figure shows An−1060A_n - 1060, the interest earned beyond the simple 6060 dollars, for n=1n = 1 to 1212. No calculator: every value must be exact or bracketed by exact numbers.

123456789101112130.511.522.5ceiling: continuous compoundingcompounded n times a yearnAₙ - 1060 (dollars)
  • a) Compute A1A_1, A2A_2 and A4A_4 exactly (to the cent for A4A_4).
  • b) Prove that An→1000e0.06A_n \to 1000e^{0.06} as n→∞n \to \infty, the balance under continuous compounding.
  • c) Prove that {An}\{A_n\} is increasing, by studying g(x)=xln⁡(1+rx)g(x) = x \ln\left(1 + \frac{r}{x}\right) for x>0x > 0 and a fixed rate r>0r > 0.
  • d) Prove that (1+rn)n≤er\left(1 + \frac{r}{n}\right)^n \le e^r for every nn, and deduce that 1061.36<1000e0.06<1063.831061.36 < 1000e^{0.06} < 1063.83. Hint: e−u≥1−ue^{-u} \ge 1 - u.
  • e) Show that after tt years of compounding nn times a year, the balance 1000(1+rn)nt1000\left(1 + \frac{r}{n}\right)^{nt} tends to 1000ert1000e^{rt}. Under continuous compounding at 6%6\%, how long does it take to double the deposit? Use ln⁡2≈0.69\ln 2 \approx 0.69.
Show the solution

Answers

  • a) A1=1060A_1 = 1060, A2=1060.90A_2 = 1060.90, A4=1061.36A_4 = 1061.36 dollars
  • b) An=1000(1+0.06n)n→1000e0.06A_n = 1000\left(1 + \frac{0.06}{n}\right)^n \to 1000e^{0.06}
  • c) g′(x)=h(u)=ln⁡(1+u)−u1+u>0g'(x) = h(u) = \ln(1 + u) - \frac{u}{1 + u} > 0 with u=rxu = \frac{r}{x}: {An}\{A_n\} increases.
  • d) ln⁡(1+u)≤u\ln(1 + u) \le u gives An≤1000e0.06A_n \le 1000e^{0.06}; A4<1000e0.06<10000.94A_4 < 1000e^{0.06} < \frac{1000}{0.94}
  • e) [(1+rn)n]t→ert\left[\left(1 + \frac{r}{n}\right)^n\right]^t \to e^{rt}; doubling time ln⁡20.06=503ln⁡2≈11.5\frac{\ln 2}{0.06} = \frac{50}{3}\ln 2 \approx 11.5 years

a) A1=1000×1.06=1060A_1 = 1000 \times 1.06 = 1060. A2=1000×1.032=1000×1.0609=1060.90A_2 = 1000 \times 1.03^2 = 1000 \times 1.0609 = 1060.90. A4=1000×1.0154A_4 = 1000 \times 1.015^4: first 1.0152=1.0302251.015^2 = 1.030225, then 1.0302252=1.0613635506251.030225^2 = 1.061363550625, so A4=1061.363550625A_4 = 1061.363550625, that is 1061.361061.36 dollars to the cent. Squaring twice is the hand method for a fourth power, and it is how the no-calculator rule is met. On the figure these are the first, second and fourth dots: 00, 0.900.90 and 1.361.36 dollars above 10601060.

b) By the limit (1+xn)n→ex\left(1 + \frac{x}{n}\right)^n \to e^x of Exercise 5, with x=0.06x = 0.06, and by the product of a limit by the constant 10001000: An→1000e0.06A_n \to 1000e^{0.06}. Continuous compounding is not a new formula to memorize, it is the LIMIT of the sequence of compounding schemes. The exact answer is 1000e0.061000e^{0.06} dollars; how large that is, d) settles without a calculator.

c) ln⁡An=ln⁡1000+g(n)\ln A_n = \ln 1000 + g(n) with g(x)=xln⁡(1+rx)g(x) = x \ln\left(1 + \frac{r}{x}\right) and r=0.06r = 0.06. By the product and chain rules, g′(x)=ln⁡(1+rx)+x⋅−r/x21+r/x=ln⁡(1+u)−u1+ug'(x) = \ln\left(1 + \frac{r}{x}\right) + x \cdot \frac{-r/x^2}{1 + r/x} = \ln(1 + u) - \frac{u}{1 + u}, with u=rx>0u = \frac{r}{x} > 0. Let h(u)=ln⁡(1+u)−u1+uh(u) = \ln(1 + u) - \frac{u}{1 + u}. Then h(0)=0h(0) = 0 and h′(u)=11+u−1(1+u)2=u(1+u)2>0h'(u) = \frac{1}{1 + u} - \frac{1}{(1 + u)^2} = \frac{u}{(1 + u)^2} > 0 for u>0u > 0, so h(u)>0h(u) > 0 for u>0u > 0. Hence g′(x)>0g'(x) > 0, gg is increasing, and so is An=1000eg(n)A_n = 1000e^{g(n)}. More frequent compounding always pays more: the figure's dots do climb, and now it is proved for EVERY nn, not only for the twelve drawn.

d) Let k(u)=u−ln⁡(1+u)k(u) = u - \ln(1 + u): k(0)=0k(0) = 0 and k′(u)=1−11+u=u1+u≥0k'(u) = 1 - \frac{1}{1 + u} = \frac{u}{1 + u} \ge 0 for u≥0u \ge 0, so ln⁡(1+u)≤u\ln(1 + u) \le u. With u=rnu = \frac{r}{n}: nln⁡(1+rn)≤rn \ln\left(1 + \frac{r}{n}\right) \le r, so (1+rn)n≤er\left(1 + \frac{r}{n}\right)^n \le e^r. The sequence {An}\{A_n\} is increasing and bounded above by 1000e0.061000e^{0.06}: the Monotone Sequence Theorem confirms that it converges, and b) says to what. Brackets: since the sequence increases strictly to its limit, 1000e0.06>A4>1061.361000e^{0.06} > A_4 > 1061.36. For an upper bound, e−u≥1−ue^{-u} \ge 1 - u (same method, the difference has derivative 1−e−u≥01 - e^{-u} \ge 0) gives e−0.06≥0.94e^{-0.06} \ge 0.94, so e0.06≤10.94e^{0.06} \le \frac{1}{0.94} and 1000e0.06≤10000.94<1063.831000e^{0.06} \le \frac{1000}{0.94} < 1063.83, since 0.94×1063.83=1000.00020.94 \times 1063.83 = 1000.0002. By these brackets, continuous compounding pays at most 1063.83−1061.36=2.471063.83 - 1061.36 = 2.47 dollars more than quarterly compounding: a bank advertising daily compounding as better than continuous is wrong, and one selling continuous compounding as a large gain is exaggerating.

e) (1+rn)nt=[(1+rn)n]t\left(1 + \frac{r}{n}\right)^{nt} = \left[\left(1 + \frac{r}{n}\right)^n\right]^t, and y↦yty \mapsto y^t is continuous at er>0e^r > 0, so the balance tends to 1000(er)t=1000ert1000(e^r)^t = 1000e^{rt}. Doubling under continuous compounding: 1000e0.06t=20001000e^{0.06t} = 2000, so e0.06t=2e^{0.06t} = 2 and t=ln⁡20.06=503ln⁡2t = \frac{\ln 2}{0.06} = \frac{50}{3}\ln 2 years, the exact answer. With ln⁡2≈0.69\ln 2 \approx 0.69, t≈0.690.06=11.5t \approx \frac{0.69}{0.06} = 11.5 years. This is the rule of 7070 used in finance: a rate of rr percent doubles money in about 70r\frac{70}{r} years, because 100ln⁡2≈69100 \ln 2 \approx 69.

Exercise 10: A final exam question: computing the square root of 5 with a guaranteed error

Heron's method, used for two thousand years and still in the square root routine of many processors, computes 5\sqrt 5 with the recursion xn+1=12(xn+5xn)x_{n+1} = \frac{1}{2}\left(x_n + \frac{5}{x_n}\right): if xnx_n is too large, 5xn\frac{5}{x_n} is too small, and their average is a better guess. Start from x1=1x_1 = 1.

This is the shape of a long final exam question: first terms, a bound, monotonicity, the limit, then a guaranteed error, every step justified and without a calculator.

  • a) Compute x2x_2, x3x_3 and x4x_4 as fractions.
  • b) Show that xn>0x_n > 0 for all nn, and that xn+1−5=(xn−5)22xnx_{n+1} - \sqrt 5 = \frac{(x_n - \sqrt 5)^2}{2x_n}. Deduce that xn≥5x_n \ge \sqrt 5 for every n≥2n \ge 2.
  • c) Prove that {xn}\{x_n\} is decreasing from n=2n = 2 on.
  • d) Conclude that {xn}\{x_n\} converges and find its limit, rejecting any wrong candidate.
  • e) Let en=xn−5e_n = x_n - \sqrt 5. Prove that en+1<en24e_{n+1} < \frac{e_n^2}{4} for n≥2n \ge 2 and that e2<1e_2 < 1. Deduce a bound on e4e_4 and on e6e_6, and say how accurate x4=4721x_4 = \frac{47}{21} is guaranteed to be.
Show the solution

Answers

  • a) x2=3x_2 = 3, x3=73x_3 = \frac{7}{3}, x4=4721x_4 = \frac{47}{21}
  • b) xn+1−5=(xn−5)22xn≥0x_{n+1} - \sqrt 5 = \frac{(x_n - \sqrt 5)^2}{2x_n} \ge 0, so xn≥5x_n \ge \sqrt 5 for n≥2n \ge 2
  • c) xn+1−xn=5−xn22xn≤0x_{n+1} - x_n = \frac{5 - x_n^2}{2x_n} \le 0 for n≥2n \ge 2
  • d) Decreasing and bounded below by 5\sqrt 5; L=12(L+5L)L = \frac{1}{2}\left(L + \frac{5}{L}\right) gives L=5L = \sqrt 5 (−5-\sqrt 5 rejected).
  • e) e4<164e_4 < \frac{1}{64}, e6<1230<10−9e_6 < \frac{1}{2^{30}} < 10^{-9}; 4721\frac{47}{21} is within 164\frac{1}{64} of 5\sqrt 5 (in fact within 0.0030.003).

a) x2=12(1+5)=3x_2 = \frac{1}{2}(1 + 5) = 3. x3=12(3+53)=12⋅143=73x_3 = \frac{1}{2}\left(3 + \frac{5}{3}\right) = \frac{1}{2} \cdot \frac{14}{3} = \frac{7}{3}. x4=12(73+157)=12⋅49+4521=4721x_4 = \frac{1}{2}\left(\frac{7}{3} + \frac{15}{7}\right) = \frac{1}{2} \cdot \frac{49 + 45}{21} = \frac{47}{21}. As decimals, 33, 2.332.33, 2.2382.238: the start x1=1x_1 = 1 is far below 5\sqrt 5, the first step overshoots, and from then on the terms come down. The figure of the solution shows that path on the cobweb diagram.

b) By induction, if xn>0x_n > 0 then xn+1x_{n+1} is half a sum of two positive numbers, so xn+1>0x_{n+1} > 0; and x1=1>0x_1 = 1 > 0. Next, put everything over 2xn2x_n: xn+1−5=xn2+5−25 xn2xn=(xn−5)22xnx_{n+1} - \sqrt 5 = \frac{x_n^2 + 5 - 2\sqrt 5\, x_n}{2x_n} = \frac{(x_n - \sqrt 5)^2}{2x_n}. A square over a positive number is ≥0\ge 0, so xn+1≥5x_{n+1} \ge \sqrt 5 for every n≥1n \ge 1, that is xn≥5x_n \ge \sqrt 5 for every n≥2n \ge 2. The bound starts at n=2n = 2, not n=1n = 1, and saying so is part of the answer: x1=1<5x_1 = 1 < \sqrt 5.

c) xn+1−xn=12(5xn−xn)=5−xn22xnx_{n+1} - x_n = \frac{1}{2}\left(\frac{5}{x_n} - x_n\right) = \frac{5 - x_n^2}{2x_n}. For n≥2n \ge 2, xn≥5x_n \ge \sqrt 5 gives xn2≥5x_n^2 \ge 5, so the numerator is ≤0\le 0 while the denominator is positive: xn+1≤xnx_{n+1} \le x_n. The sequence is decreasing from n=2n = 2 on. The bound of b) is exactly what decides the sign here: prove the bound first, the monotonicity follows.

d) From n=2n = 2 on, {xn}\{x_n\} is decreasing and bounded below by 5\sqrt 5, so it converges to some L≥5L \ge \sqrt 5, by the Monotone Sequence Theorem applied to the tail. Since L≠0L \ne 0, the function x↦12(x+5x)x \mapsto \frac{1}{2}\left(x + \frac{5}{x}\right) is continuous at LL, and letting n→∞n \to \infty in the recursion gives L=12(L+5L)L = \frac{1}{2}\left(L + \frac{5}{L}\right), so 2L2=L2+52L^2 = L^2 + 5 and L2=5L^2 = 5. The candidates are ±5\pm\sqrt 5; L≥5>0L \ge \sqrt 5 > 0 rejects −5-\sqrt 5. Hence xn→5x_n \to \sqrt 5. Starting from x1=−1x_1 = -1 would have produced −5-\sqrt 5: the candidates come from the equation, the choice comes from the bounds.

e) By b), en+1=en22xne_{n+1} = \frac{e_n^2}{2x_n}. For n≥2n \ge 2, xn≥5>2x_n \ge \sqrt 5 > 2 (since 5>45 > 4), so 2xn>42x_n > 4 and en+1<en24e_{n+1} < \frac{e_n^2}{4}. Also e2=3−5<1e_2 = 3 - \sqrt 5 < 1, since 5>2\sqrt 5 > 2. Then e3<14e_3 < \frac{1}{4}, e4<(1/4)24=164e_4 < \frac{(1/4)^2}{4} = \frac{1}{64}, e5<(1/64)24=1214e_5 < \frac{(1/64)^2}{4} = \frac{1}{2^{14}} and e6<(2−14)24=1230<10−9e_6 < \frac{(2^{-14})^2}{4} = \frac{1}{2^{30}} < 10^{-9}, since 230=10737418242^{30} = 1073741824. So x4=4721x_4 = \frac{47}{21} is within 164\frac{1}{64} of 5\sqrt 5, guaranteed, and x6x_6 is within 10−910^{-9}. The true error of x4x_4 is even smaller, about 0.0020.002, because the bound e2<1e_2 < 1 was generous. Each step roughly doubles the number of correct digits: this quadratic convergence is why the method is still used.

12341234y = (x + 5/x)/2y = xx₁√5x₂ = 3

See also

Struggling with MATH 141?

I tutor first-year calculus at McGill and Concordia, in English or in French, in Montreal or online. Get in touch for a first session.

Site by Studio Squalli