MATH 141 Calculus 2 • McGill University, Montreal

Corrected exercises: the integral test and the comparison tests (MATH 141)

This is the corrected exercise set for sections 11.3 and 11.4 of Stewart in MATH 141, Calculus 2, the second calculus course taken at McGill University in science, engineering and management. It covers the integral test, the pp-series, the comparison test, the limit comparison test and the remainder estimate. Every number is chosen to be done by hand, as on the exam, and every solution checks the hypotheses of the test it uses, because that is where the marks are.

The thread running through the set: every test of the chapter judges a series against something whose fate is already known, an improper integral or a benchmark series, and each test is a theorem whose hypotheses are written on the page BEFORE the verdict: positive terms, a function that is continuous, positive and DECREASING, an inequality valid for all n≥Nn \ge N. A comparison decides in one direction only, below a convergent series or above a divergent one. And the integral decides the fate of a series, never its value: the value is only bracketed, by the remainder estimate.

The traps named in the solutions: skipping the decrease, or claiming it for a function that first increases; reading the value of the integral as the sum of the series; comparing in the useless direction; taking the limit comparison against a benchmark that makes the limit 00 or ∞\infty on the wrong side; calling 1n1+1/n\frac{1}{n^{1 + 1/n}} a pp-series; swapping nn and n+1n + 1 in the remainder bounds; and trusting a picture of the first terms to decide convergence.

10 corrected exercises • 100 points • 150 minutes

Revision sheet for this chapter → Every MATH 141 chapter →

Course recap

  • • Integral test: ff continuous, positive, decreasing on [N,∞)[N, \infty) with f(n)=anf(n) = a_n. Then ∑n≥Nan\sum_{n \ge N} a_n and ∫N∞f(x) dx\int_N^{\infty} f(x)\,dx share their fate. The value of the integral is NOT the sum.
  • • pp-series: ∑1np\sum \frac{1}{n^p} converges if and only if p>1p > 1 (the exponent is a constant).
  • • Remainder: Rn=S−snR_n = S - s_n satisfies ∫n+1∞f(x) dx≤Rn≤∫n∞f(x) dx\int_{n+1}^{\infty} f(x)\,dx \le R_n \le \int_n^{\infty} f(x)\,dx.
  • • Comparison, positive terms: an≤bna_n \le b_n and ∑bn\sum b_n converges gives convergence; an≥bna_n \ge b_n and ∑bn\sum b_n diverges gives divergence. The other two directions prove nothing.
  • • Limit comparison, an,bn>0a_n, b_n > 0: anbn→c∈(0,∞)\frac{a_n}{b_n} \to c \in (0, \infty) gives the same fate. Limit 00 with ∑bn\sum b_n convergent: converges. Limit ∞\infty with ∑bn\sum b_n divergent: diverges.
  • • Benchmarks: pp-series, geometric series ∑rn\sum r^n (∣r∣<1|r| < 1), and (ln⁡n)qnp\frac{(\ln n)^q}{n^p}, which follows pp unless p=1p = 1.
  • • MATH 140 limits as t→0t \to 0: sin⁡tt→1\frac{\sin t}{t} \to 1, 1−cos⁡tt2→12\frac{1 - \cos t}{t^2} \to \frac{1}{2}, ln⁡(1+t)t→1\frac{\ln(1 + t)}{t} \to 1, et−1t→1\frac{e^t - 1}{t} \to 1.

Part A: the basics (/50)

Exercise 1: The integral test: three hypotheses, then one integral

The integral test. Suppose ff is continuous, positive and decreasing on [N,∞)[N, \infty) and an=f(n)a_n = f(n) for every integer n≥Nn \ge N. Then ∑n=N∞an\sum_{n=N}^{\infty} a_n and ∫N∞f(x) dx\int_N^{\infty} f(x)\,dx either both converge or both diverge.

The three hypotheses are part of the answer: a verdict that does not check them earns almost nothing, and the one students skip, DECREASING, is the one that fails most often. The figure shows f(x)=ln⁡xxf(x) = \frac{\ln x}{x} and the terms an=ln⁡nna_n = \frac{\ln n}{n} of part b).

1234567891011120.10.20.30.40.5x = epeak 1/ey = ln(x)/xdots: a_n = ln(n)/n
  • a) Decide whether ∑n=1∞ne−n\sum_{n=1}^{\infty} n e^{-n} converges, checking the three hypotheses on f(x)=xe−xf(x) = x e^{-x} with a derivative.
  • b) The function f(x)=ln⁡xxf(x) = \frac{\ln x}{x} is not decreasing on [1,∞)[1, \infty), as the figure shows. Find where it decreases, explain why the integral test still applies, and decide whether ∑n=1∞ln⁡nn\sum_{n=1}^{\infty} \frac{\ln n}{n} converges.
  • c) Decide whether ∑n=1∞arctan⁡n1+n2\sum_{n=1}^{\infty} \frac{\arctan n}{1 + n^2} converges. The numerator INCREASES: prove that ff decreases anyway on [1,∞)[1, \infty), and compute ∫1∞f(x) dx\int_1^{\infty} f(x)\,dx exactly.
  • d) A student reads the integral of a) and writes ∑n=1∞ne−n=2e\sum_{n=1}^{\infty} n e^{-n} = \frac{2}{e}. Show that the sum is STRICTLY greater than 2e\frac{2}{e}, and give an upper bound for it, without a calculator.
  • e) Decide whether ∑n=1∞e1/nn2\sum_{n=1}^{\infty} \frac{e^{1/n}}{n^2} converges, justifying the decrease WITHOUT a derivative, and give the value of the integral used.
Show the solution

Answers

  • a) Converges: f′=(1−x)e−x≤0f' = (1 - x)e^{-x} \le 0 on [1,∞)[1, \infty) and ∫1∞xe−x dx=2e\int_1^{\infty} x e^{-x}\,dx = \frac{2}{e}.
  • b) ff decreases on [e,∞)[e, \infty); test on ∑n≥3\sum_{n \ge 3}: ∫3∞ln⁡xx dx=∞\int_3^{\infty} \frac{\ln x}{x}\,dx = \infty, so the series diverges.
  • c) Converges: f′=1−2xarctan⁡x(1+x2)2<0f' = \frac{1 - 2x\arctan x}{(1 + x^2)^2} < 0 on [1,∞)[1, \infty) and ∫1∞f=3π232\int_1^{\infty} f = \frac{3\pi^2}{32}.
  • d) 2e<∑n=1∞ne−n<3e\frac{2}{e} < \sum_{n=1}^{\infty} n e^{-n} < \frac{3}{e}
  • e) Converges: e1/xe^{1/x} and 1x2\frac{1}{x^2} are positive and decreasing, and ∫1∞e1/xx2 dx=e−1\int_1^{\infty} \frac{e^{1/x}}{x^2}\,dx = e - 1.

a) Let f(x)=xe−xf(x) = x e^{-x}, so that f(n)=ne−n=anf(n) = n e^{-n} = a_n. CONTINUOUS: a product of continuous functions. POSITIVE: x>0x > 0 and e−x>0e^{-x} > 0 on [1,∞)[1, \infty). DECREASING: f′(x)=e−x−xe−x=(1−x)e−xf'(x) = e^{-x} - x e^{-x} = (1 - x)e^{-x}, which is ≤0\le 0 for x≥1x \ge 1. The test applies from N=1N = 1. By parts with u=xu = x, dv=e−x dxdv = e^{-x}\,dx: ∫1txe−x dx=[−xe−x]1t+∫1te−x dx=−te−t+e−1−e−t+e−1\int_1^t x e^{-x}\,dx = \left[-x e^{-x}\right]_1^t + \int_1^t e^{-x}\,dx = -t e^{-t} + e^{-1} - e^{-t} + e^{-1}. As t→∞t \to \infty, te−t=tet→0t e^{-t} = \frac{t}{e^t} \to 0 by L'Hospital's rule and e−t→0e^{-t} \to 0, so the integral converges to 2e\frac{2}{e}. By the integral test, ∑ne−n\sum n e^{-n} CONVERGES. The conclusion names the test and both objects: the integral converges, therefore the series converges.

b) f′(x)=1x⋅x−ln⁡xx2=1−ln⁡xx2f'(x) = \frac{\frac{1}{x}\cdot x - \ln x}{x^2} = \frac{1 - \ln x}{x^2}. It is negative exactly when ln⁡x>1\ln x > 1, that is x>ex > e: ff increases on [1,e][1, e] and decreases on [e,∞)[e, \infty), which is the peak of the figure. The hypothesis only has to hold on SOME [N,∞)[N, \infty): take N=3>eN = 3 > e. Look at the terms: a2=ln⁡22a_2 = \frac{\ln 2}{2} and a4=ln⁡44=2ln⁡24=ln⁡22a_4 = \frac{\ln 4}{4} = \frac{2\ln 2}{4} = \frac{\ln 2}{2} are EQUAL, with a3a_3 larger, so the sequence is not decreasing from n=2n = 2, and the test must start at 33. Removing the finitely many terms a1=0a_1 = 0 and a2a_2 changes the sum but never the convergence. Now, with u=ln⁡xu = \ln x, ∫3tln⁡xx dx=(ln⁡t)22−(ln⁡3)22→∞\int_3^t \frac{\ln x}{x}\,dx = \frac{(\ln t)^2}{2} - \frac{(\ln 3)^2}{2} \to \infty. By the integral test ∑n≥3ln⁡nn\sum_{n \ge 3} \frac{\ln n}{n} diverges, hence so does ∑n≥1ln⁡nn\sum_{n \ge 1} \frac{\ln n}{n}. The divergence test was useless here: ln⁡nn→0\frac{\ln n}{n} \to 0.

c) f(x)=arctan⁡x1+x2f(x) = \frac{\arctan x}{1 + x^2} is continuous and positive on [1,∞)[1, \infty), since arctan⁡x>0\arctan x > 0 for x>0x > 0. The product of an INCREASING numerator and a decreasing 11+x2\frac{1}{1 + x^2} has no sign rule, so the derivative is needed: f′(x)=11+x2(1+x2)−2xarctan⁡x(1+x2)2=1−2xarctan⁡x(1+x2)2f'(x) = \frac{\frac{1}{1 + x^2}(1 + x^2) - 2x\arctan x}{(1 + x^2)^2} = \frac{1 - 2x\arctan x}{(1 + x^2)^2}. At x=1x = 1 the numerator is 1−2⋅π4=1−π2<01 - 2 \cdot \frac{\pi}{4} = 1 - \frac{\pi}{2} < 0, and 2xarctan⁡x2x\arctan x increases, so the numerator stays negative on [1,∞)[1, \infty): ff decreases there. With u=arctan⁡xu = \arctan x, du=dx1+x2du = \frac{dx}{1 + x^2}: ∫1tf(x) dx=(arctan⁡t)22−12(π4)2→12⋅π24−12⋅π216=3π232\int_1^t f(x)\,dx = \frac{(\arctan t)^2}{2} - \frac{1}{2}\left(\frac{\pi}{4}\right)^2 \to \frac{1}{2}\cdot\frac{\pi^2}{4} - \frac{1}{2}\cdot\frac{\pi^2}{16} = \frac{3\pi^2}{32}. The integral converges, so the series CONVERGES by the integral test.

d) The integral test gives the FATE of the series, never its value. Place over each [n,n+1][n, n + 1] the rectangle of height an=f(n)a_n = f(n): since ff is strictly decreasing on [1,∞)[1, \infty), f(x)<f(n)f(x) < f(n) for n<x≤n+1n < x \le n + 1, so each rectangle has strictly more area than the region under the curve on the same interval. Adding them: ∑n=1∞an>∫1∞f(x) dx=2e\sum_{n=1}^{\infty} a_n > \int_1^{\infty} f(x)\,dx = \frac{2}{e}. The same picture shifted one step to the right, rectangles of height an+1a_{n+1} on [n,n+1][n, n + 1], lies under the curve, so ∑n=2∞an<∫1∞f=2e\sum_{n=2}^{\infty} a_n < \int_1^{\infty} f = \frac{2}{e}, and adding a1=1ea_1 = \frac{1}{e} gives ∑n=1∞an<3e\sum_{n=1}^{\infty} a_n < \frac{3}{e}. So 2e<S<3e\frac{2}{e} < S < \frac{3}{e}, roughly between 0.740.74 and 1.101.10 with e≈2.72e \approx 2.72. (The exact sum is e(e−1)2\frac{e}{(e - 1)^2}, about 0.920.92, but that is another chapter.)

e) f(x)=e1/xx2f(x) = \frac{e^{1/x}}{x^2} is continuous and positive on [1,∞)[1, \infty). For the decrease no derivative is needed: x↦1xx \mapsto \frac{1}{x} decreases and eue^u increases, so e1/xe^{1/x} DECREASES; 1x2\frac{1}{x^2} decreases too; and a product of two POSITIVE decreasing functions is decreasing. Saying so in one sentence is a complete justification. With u=1xu = \frac{1}{x}, du=−dxx2du = -\frac{dx}{x^2}, the bounds x=1x = 1 and x=tx = t become u=1u = 1 and u=1tu = \frac{1}{t}: ∫1te1/xx2 dx=∫1/t1eu du=e−e1/t→e−1\int_1^t \frac{e^{1/x}}{x^2}\,dx = \int_{1/t}^{1} e^u\,du = e - e^{1/t} \to e - 1. The integral converges, so the series CONVERGES by the integral test. The product rule for monotonicity needs POSITIVE factors: (−x)(−x)=x2(-x)(-x) = x^2 is a product of two decreasing functions that increases on [1,∞)[1, \infty).

Exercise 2: p-series: the benchmark, its hypotheses, and its disguises

The pp-series ∑n=1∞1np\sum_{n=1}^{\infty} \frac{1}{n^p} converges if p>1p > 1 and diverges if p≤1p \le 1. Almost every comparison of the chapter ends on it, so it has to be recognized in any form.

The pp-integral ∫1∞dxxp\int_1^{\infty} \frac{dx}{x^p} is known from the chapter on improper integrals: it converges exactly when p>1p > 1, to 1p−1\frac{1}{p - 1}. Quote it, do not recompute it.

  • a) Deduce the pp-series test from the pp-integral with the integral test, for p>0p > 0: check the hypotheses. Why does the integral test NOT apply when p≤0p \le 0, and which test settles that case?
  • b) Write each term as 1np\frac{1}{n^p} and decide: ∑1n23\sum \frac{1}{\sqrt[3]{n^2}}, ∑nnn3\sum \frac{n\sqrt{n}}{n^3}, ∑n4n\sum \frac{\sqrt[4]{n}}{n} and ∑n−π/3\sum n^{-\pi/3}.
  • c) Show that 3−ln⁡n=1nln⁡33^{-\ln n} = \frac{1}{n^{\ln 3}}, then decide ∑n=1∞3−ln⁡n\sum_{n=1}^{\infty} 3^{-\ln n} and ∑n=1∞2−ln⁡n\sum_{n=1}^{\infty} 2^{-\ln n} without a calculator.
  • d) Decide ∑n=1∞1(n+3)3/2\sum_{n=1}^{\infty} \frac{1}{(n + 3)^{3/2}} by shifting the index, then ∑n=1∞12n−1\sum_{n=1}^{\infty} \frac{1}{2n - 1} with the integral test. A classmate says the second is half the harmonic series, so it converges to half of infinity: comment.
  • e) For p=2p = 2 the pp-integral equals 11. Show that ∑n=1∞1n2\sum_{n=1}^{\infty} \frac{1}{n^2} is NOT 11, and give an interval that contains it.
Show the solution

Answers

  • a) f(x)=x−pf(x) = x^{-p} is continuous, positive, decreasing for p>0p > 0; for p≤0p \le 0, 1np↛0\frac{1}{n^p} \not\to 0: divergence test.
  • b) p=23p = \frac{2}{3} diverges; p=32p = \frac{3}{2} converges; p=34p = \frac{3}{4} diverges; p=π3>1p = \frac{\pi}{3} > 1 converges.
  • c) ∑3−ln⁡n\sum 3^{-\ln n} converges (ln⁡3>1\ln 3 > 1); ∑2−ln⁡n\sum 2^{-\ln n} diverges (ln⁡2<1\ln 2 < 1).
  • d) ∑k≥4k−3/2\sum_{k \ge 4} k^{-3/2} converges; ∑12n−1\sum \frac{1}{2n - 1} diverges (12ln⁡(2t−1)→∞\frac{1}{2}\ln(2t - 1) \to \infty).
  • e) 1<54≤∑1n2≤21 < \frac{5}{4} \le \sum \frac{1}{n^2} \le 2

a) For p>0p > 0, let f(x)=1xp=x−pf(x) = \frac{1}{x^p} = x^{-p}. It is continuous and positive on [1,∞)[1, \infty), and f′(x)=−px−p−1<0f'(x) = -p x^{-p-1} < 0: decreasing. The integral test applies, so ∑1np\sum \frac{1}{n^p} behaves like ∫1∞dxxp\int_1^{\infty} \frac{dx}{x^p}: convergent for p>1p > 1, divergent for 0<p≤10 < p \le 1. For p≤0p \le 0 the hypothesis DECREASING fails: f(x)=x−p=x∣p∣f(x) = x^{-p} = x^{|p|} is constant (p=0p = 0) or increasing (p<0p < 0), and a test whose hypothesis fails says nothing. The right tool is the divergence test: 1np=n∣p∣\frac{1}{n^p} = n^{|p|} tends to ∞\infty or equals 11, never to 00, so the series diverges. Together: ∑1np\sum \frac{1}{n^p} converges exactly when p>1p > 1.

b) 1n23=1n2/3\frac{1}{\sqrt[3]{n^2}} = \frac{1}{n^{2/3}}: p=23≤1p = \frac{2}{3} \le 1, DIVERGES. nnn3=n3/2n3=1n3/2\frac{n\sqrt{n}}{n^3} = \frac{n^{3/2}}{n^3} = \frac{1}{n^{3/2}}: p=32>1p = \frac{3}{2} > 1, CONVERGES. n4n=n1/4n=1n3/4\frac{\sqrt[4]{n}}{n} = \frac{n^{1/4}}{n} = \frac{1}{n^{3/4}}: p=34p = \frac{3}{4}, DIVERGES. n−π/3=1nπ/3n^{-\pi/3} = \frac{1}{n^{\pi/3}} with π3>1\frac{\pi}{3} > 1 because π>3\pi > 3: CONVERGES, with no decimal needed. The exponent is read AFTER the algebra: n23\sqrt[3]{n^2} is n2/3n^{2/3}, not n3/2n^{3/2}, and that single swap turns a divergent series into a convergent one.

c) 3−ln⁡n=e−ln⁡3⋅ln⁡n=(eln⁡n)−ln⁡3=n−ln⁡33^{-\ln n} = e^{-\ln 3 \cdot \ln n} = \left(e^{\ln n}\right)^{-\ln 3} = n^{-\ln 3}. So ∑3−ln⁡n\sum 3^{-\ln n} is a pp-series with p=ln⁡3p = \ln 3. Since 3>e3 > e and ln⁡\ln increases, ln⁡3>ln⁡e=1\ln 3 > \ln e = 1: it CONVERGES. In the same way 2−ln⁡n=n−ln⁡22^{-\ln n} = n^{-\ln 2}, and 2<e2 < e gives ln⁡2<1\ln 2 < 1: ∑2−ln⁡n\sum 2^{-\ln n} DIVERGES. The dividing base is ee itself, for which e−ln⁡n=1ne^{-\ln n} = \frac{1}{n}, the harmonic series. A term like 3−ln⁡n3^{-\ln n} LOOKS geometric, but the variable is inside a logarithm, not alone in the exponent, and it decreases far more slowly than (13)n\left(\frac{1}{3}\right)^n.

d) With k=n+3k = n + 3: ∑n=1∞1(n+3)3/2=∑k=4∞1k3/2\sum_{n=1}^{\infty} \frac{1}{(n + 3)^{3/2}} = \sum_{k=4}^{\infty} \frac{1}{k^{3/2}}, a pp-series with p=32p = \frac{3}{2} missing its first three terms: it CONVERGES, since dropping finitely many terms never changes convergence. For ∑12n−1\sum \frac{1}{2n - 1}: f(x)=12x−1f(x) = \frac{1}{2x - 1} is continuous, positive and decreasing on [1,∞)[1, \infty), and ∫1tdx2x−1=12ln⁡(2t−1)→∞\int_1^t \frac{dx}{2x - 1} = \frac{1}{2}\ln(2t - 1) \to \infty: the series DIVERGES. The classmate's verdict is right, his words are not: the odd reciprocals are not half of the harmonic series term by term, and half of infinity is not a number to converge to. What is true is 12n−1≥12n\frac{1}{2n - 1} \ge \frac{1}{2n}, a comparison with a divergent series, which is the next exercise.

e) ∑n=1∞1n2≥1+14>1\sum_{n=1}^{\infty} \frac{1}{n^2} \ge 1 + \frac{1}{4} > 1, since all the terms are positive: the sum is not 11. The integral is an AREA under a curve, the series is a sum of rectangles, and Exercise 1 d) compares them in the right direction: rectangles of heights a2,a3,…a_2, a_3, \dots placed on [1,2],[2,3],…[1, 2], [2, 3], \dots fit under the curve, so ∑n=2∞1n2≤∫1∞dxx2=1\sum_{n=2}^{\infty} \frac{1}{n^2} \le \int_1^{\infty} \frac{dx}{x^2} = 1, and ∑n=1∞1n2≤1+1=2\sum_{n=1}^{\infty} \frac{1}{n^2} \le 1 + 1 = 2. So 54≤S≤2\frac{5}{4} \le S \le 2. (Euler proved that S=π26S = \frac{\pi^2}{6}, about 1.641.64.) Exercise 5 narrows this interval to a width of 112\frac{1}{12}.

Exercise 3: Direct comparison: the inequality has to point the right way

The comparison test. Let ∑an\sum a_n and ∑bn\sum b_n have POSITIVE terms. If an≤bna_n \le b_n for all n≥Nn \ge N and ∑bn\sum b_n converges, then ∑an\sum a_n converges. If an≥bna_n \ge b_n for all n≥Nn \ge N and ∑bn\sum b_n diverges, then ∑an\sum a_n diverges.

The other two combinations, smaller than a divergent series or larger than a convergent one, prove NOTHING. The figure shows the terms of the series of part b) between two benchmark curves.

123456789100.10.20.30.40.51/(2x)1/(2x + √x): the series1/(3x)
  • a) Decide ∑n=1∞1+cos⁡nnn\sum_{n=1}^{\infty} \frac{1 + \cos n}{n\sqrt{n}}. Explain why the integral test cannot be used here.
  • b) A student writes: 12n+n<12n\frac{1}{2n + \sqrt{n}} < \frac{1}{2n} and ∑12n\sum \frac{1}{2n} diverges, so ∑12n+n\sum \frac{1}{2n + \sqrt{n}} diverges. Say what her inequality actually proves, then use the figure to find the inequality that concludes, and decide.
  • c) Decide ∑n=3∞1n2−5\sum_{n=3}^{\infty} \frac{1}{n^2 - 5}. The obvious comparison with 1n2\frac{1}{n^2} points the wrong way: show that 1n2−5≤2n2\frac{1}{n^2 - 5} \le \frac{2}{n^2} for n≥4n \ge 4, and say why n=3n = 3 is excluded.
  • d) Decide ∑n=1∞2n3n+n\sum_{n=1}^{\infty} \frac{2^n}{3^n + n} by comparison with a geometric series.
  • e) Decide ∑n=1∞ln⁡nn\sum_{n=1}^{\infty} \frac{\ln n}{\sqrt{n}}, giving the exact range of nn for which your inequality holds.
Show the solution

Answers

  • a) 0≤1+cos⁡nn3/2≤2n3/20 \le \frac{1 + \cos n}{n^{3/2}} \le \frac{2}{n^{3/2}}: converges. ff is not decreasing.
  • b) Her inequality proves nothing; 2n+n≤3n2n + \sqrt{n} \le 3n gives an≥13na_n \ge \frac{1}{3n}: diverges.
  • c) n2−5≥n22n^2 - 5 \ge \frac{n^2}{2} iff n2≥10n^2 \ge 10, so an≤2n2a_n \le \frac{2}{n^2} for n≥4n \ge 4: converges.
  • d) 2n3n+n<(23)n\frac{2^n}{3^n + n} < \left(\frac{2}{3}\right)^n: converges.
  • e) ln⁡nn≥1n\frac{\ln n}{\sqrt{n}} \ge \frac{1}{\sqrt{n}} for n≥3n \ge 3: diverges.

a) Positivity first: cos⁡n≥−1\cos n \ge -1, so 1+cos⁡n≥01 + \cos n \ge 0 and every term is ≥0\ge 0. Then 1+cos⁡n≤21 + \cos n \le 2 gives 0≤1+cos⁡nn3/2≤2n3/20 \le \frac{1 + \cos n}{n^{3/2}} \le \frac{2}{n^{3/2}} for all n≥1n \ge 1. The series ∑2n3/2\sum \frac{2}{n^{3/2}} is twice a pp-series with p=32>1p = \frac{3}{2} > 1: it converges. The terms are SMALLER than those of a convergent series, so ∑1+cos⁡nnn\sum \frac{1 + \cos n}{n\sqrt{n}} CONVERGES by the comparison test. The integral test is out: f(x)=1+cos⁡xx3/2f(x) = \frac{1 + \cos x}{x^{3/2}} is not decreasing, since f(π)=0f(\pi) = 0 while f(2π)=2(2π)3/2>0f(2\pi) = \frac{2}{(2\pi)^{3/2}} > 0. A bounded oscillating factor is the typical sign that the comparison test, not the integral test, is the tool.

b) Her inequality is true, and it proves nothing: being SMALLER than the terms of a divergent series is compatible with both verdicts, since 1n2<1n\frac{1}{n^2} < \frac{1}{n} too and ∑1n2\sum \frac{1}{n^2} converges. To prove divergence she needs a LOWER bound by a divergent series. On the figure the orange terms sit ABOVE the green curve 13x\frac{1}{3x}: indeed n≤n\sqrt{n} \le n for n≥1n \ge 1, so 2n+n≤3n2n + \sqrt{n} \le 3n and 12n+n≥13n\frac{1}{2n + \sqrt{n}} \ge \frac{1}{3n}. Since ∑13n=13∑1n\sum \frac{1}{3n} = \frac{1}{3}\sum \frac{1}{n} diverges (harmonic), ∑12n+n\sum \frac{1}{2n + \sqrt{n}} DIVERGES by the comparison test. The method: to show divergence, make the denominator BIGGER, never smaller; the constant 13\frac{1}{3} costs nothing.

c) For n≥3n \ge 3, n2−5>0n^2 - 5 > 0 and the terms are positive. But n2−5<n2n^2 - 5 < n^2 gives 1n2−5>1n2\frac{1}{n^2 - 5} > \frac{1}{n^2}: bigger than a CONVERGENT series, no conclusion. The repair is to give up a constant: n2−5≥n22n^2 - 5 \ge \frac{n^2}{2} is equivalent to n22≥5\frac{n^2}{2} \ge 5, that is n2≥10n^2 \ge 10, true for every n≥4n \ge 4. Then 1n2−5≤2n2\frac{1}{n^2 - 5} \le \frac{2}{n^2} for n≥4n \ge 4, and ∑2n2\sum \frac{2}{n^2} converges (p=2p = 2), so the series CONVERGES. At n=3n = 3: n2−5=4<92n^2 - 5 = 4 < \frac{9}{2}, the inequality fails, and it does not matter, since the test only asks for n≥Nn \ge N and one term is a finite number. Exercise 4 reaches the same verdict in one limit.

d) All terms are positive. Making the denominator smaller makes the fraction bigger: 3n+n>3n3^n + n > 3^n, so 2n3n+n<2n3n=(23)n\frac{2^n}{3^n + n} < \frac{2^n}{3^n} = \left(\frac{2}{3}\right)^n. The geometric series ∑(23)n\sum \left(\frac{2}{3}\right)^n has ratio r=23r = \frac{2}{3}, with ∣r∣<1|r| < 1: it converges. The terms are smaller than those of a convergent series, so the series CONVERGES. Here the easy inequality is also the right one: dropping a positive term from the denominator gives an UPPER bound, exactly what convergence needs.

e) For n≥3n \ge 3: 3>e3 > e, so ln⁡n≥ln⁡3>ln⁡e=1\ln n \ge \ln 3 > \ln e = 1, and ln⁡nn≥1n\frac{\ln n}{\sqrt{n}} \ge \frac{1}{\sqrt{n}}. The series ∑1n\sum \frac{1}{\sqrt{n}} is a pp-series with p=12≤1p = \frac{1}{2} \le 1: it diverges. The terms are bigger than those of a divergent series from n=3n = 3 on, so ∑ln⁡nn\sum \frac{\ln n}{\sqrt{n}} DIVERGES. The range matters and must be written: at n=1n = 1, ln⁡1=0\ln 1 = 0, and at n=2n = 2, ln⁡2<1\ln 2 < 1, so the inequality is false there. Writing it for all n≥1n \ge 1 puts a false statement on the page, and markers take the mark for it even when the verdict is right.

Exercise 4: Limit comparison: keep the dominant terms, then take one limit

The limit comparison test. Let an>0a_n > 0 and bn>0b_n > 0. If lim⁡n→∞anbn=c\lim_{n \to \infty} \frac{a_n}{b_n} = c with 0<c<∞0 < c < \infty, then ∑an\sum a_n and ∑bn\sum b_n both converge or both diverge.

Two one-sided cases follow from the comparison test: if the limit is 00 and ∑bn\sum b_n converges, ∑an\sum a_n converges; if the limit is ∞\infty and ∑bn\sum b_n diverges, ∑an\sum a_n diverges. The benchmark bnb_n is built by keeping the DOMINANT term of the numerator and of the denominator.

  • a) Decide ∑n=1∞2n2+3nn7+1\sum_{n=1}^{\infty} \frac{2n^2 + 3n}{\sqrt{n^7 + 1}}.
  • b) Decide ∑n=1∞n+5n2−3n+7\sum_{n=1}^{\infty} \frac{n + 5}{n^2 - 3n + 7}, after checking that every term is positive.
  • c) Decide ∑n=1∞n+ln⁡nn2+1\sum_{n=1}^{\infty} \frac{\sqrt{n} + \ln n}{n^2 + 1}, justifying which term of the numerator dominates.
  • d) For ∑n=1∞ln⁡nn2\sum_{n=1}^{\infty} \frac{\ln n}{n^2}, compute lim⁡anbn\lim \frac{a_n}{b_n} with bn=1n2b_n = \frac{1}{n^2}, then with bn=1nb_n = \frac{1}{n}, and explain why neither concludes. Find a bnb_n that does, and decide.
  • e) Every exponent in ∑n=1∞1n1+1/n\sum_{n=1}^{\infty} \frac{1}{n^{1 + 1/n}} is greater than 11. Decide the series with a limit comparison with 1n\frac{1}{n}.
Show the solution

Answers

  • a) bn=1n3/2b_n = \frac{1}{n^{3/2}}, limit 22: converges.
  • b) Denominator >0> 0 (discriminant −19-19); bn=1nb_n = \frac{1}{n}, limit 11: diverges.
  • c) ln⁡nn→0\frac{\ln n}{\sqrt{n}} \to 0; bn=1n3/2b_n = \frac{1}{n^{3/2}}, limit 11: converges.
  • d) Limits ∞\infty (with ∑bn\sum b_n convergent) and 00 (with ∑bn\sum b_n divergent) decide nothing; bn=1n3/2b_n = \frac{1}{n^{3/2}}, limit 00: converges.
  • e) an1/n=n−1/n→1\frac{a_n}{1/n} = n^{-1/n} \to 1: diverges.

a) The terms are positive. Dominant terms: 2n22n^2 on top, n7=n7/2\sqrt{n^7} = n^{7/2} below, so ana_n behaves like 2n2n7/2=2n3/2\frac{2n^2}{n^{7/2}} = \frac{2}{n^{3/2}}. Take bn=1n3/2b_n = \frac{1}{n^{3/2}} (the constant 22 can stay out of bnb_n, the limit collects it). Writing n7+1=n7/21+1n7\sqrt{n^7 + 1} = n^{7/2}\sqrt{1 + \frac{1}{n^7}}: anbn=(2n2+3n) n3/2n7/21+1/n7=2+3n1+1n7→2\frac{a_n}{b_n} = \frac{(2n^2 + 3n)\,n^{3/2}}{n^{7/2}\sqrt{1 + 1/n^7}} = \frac{2 + \frac{3}{n}}{\sqrt{1 + \frac{1}{n^7}}} \to 2. Since 0<2<∞0 < 2 < \infty and ∑1n3/2\sum \frac{1}{n^{3/2}} converges (p=32>1p = \frac{3}{2} > 1), the series CONVERGES by the limit comparison test. The algebra is always the same: factor the dominant power out of every sum BEFORE taking the limit.

b) n+5>0n + 5 > 0, and n2−3n+7n^2 - 3n + 7 has discriminant 9−28=−19<09 - 28 = -19 < 0 with a positive leading coefficient, so it is positive for every nn: all terms are positive, which the test requires. Dominant terms: nn2=1n\frac{n}{n^2} = \frac{1}{n}. With bn=1nb_n = \frac{1}{n}: anbn=n2+5nn2−3n+7=1+5n1−3n+7n2→1\frac{a_n}{b_n} = \frac{n^2 + 5n}{n^2 - 3n + 7} = \frac{1 + \frac{5}{n}}{1 - \frac{3}{n} + \frac{7}{n^2}} \to 1. The harmonic series diverges, so the series DIVERGES. A direct comparison would need an inequality such as n2−3n+7≤2n2n^2 - 3n + 7 \le 2n^2, true but one more thing to prove: that is the time the limit version saves.

c) The terms are positive. In the numerator, n\sqrt{n} dominates ln⁡n\ln n: by L'Hospital's rule, lim⁡x→∞ln⁡xx=lim⁡1/x1/(2x)=lim⁡2x=0\lim_{x \to \infty} \frac{\ln x}{\sqrt{x}} = \lim \frac{1/x}{1/(2\sqrt{x})} = \lim \frac{2}{\sqrt{x}} = 0, and the limit of the sequence is the limit of the function. So ana_n behaves like nn2=1n3/2\frac{\sqrt{n}}{n^2} = \frac{1}{n^{3/2}}. With bn=1n3/2b_n = \frac{1}{n^{3/2}}: anbn=(n+ln⁡n) n3/2n2+1=1+ln⁡nn1+1n2→1\frac{a_n}{b_n} = \frac{(\sqrt{n} + \ln n)\,n^{3/2}}{n^2 + 1} = \frac{1 + \frac{\ln n}{\sqrt{n}}}{1 + \frac{1}{n^2}} \to 1. Since ∑1n3/2\sum \frac{1}{n^{3/2}} converges, the series CONVERGES. A logarithm is never the dominant term against a positive power of nn, and it has to be SAID, with the limit, not assumed.

d) With bn=1n2b_n = \frac{1}{n^2}: anbn=ln⁡n→∞\frac{a_n}{b_n} = \ln n \to \infty, and ∑1n2\sum \frac{1}{n^2} CONVERGES. A term infinitely larger than that of a convergent series can do anything: no conclusion. With bn=1nb_n = \frac{1}{n}: anbn=ln⁡nn→0\frac{a_n}{b_n} = \frac{\ln n}{n} \to 0, and ∑1n\sum \frac{1}{n} DIVERGES. A term infinitely smaller than that of a divergent series can do anything: no conclusion. The logarithm sits between the two powers, so the benchmark must sit between them too: bn=1n3/2b_n = \frac{1}{n^{3/2}} gives anbn=ln⁡nn1/2→0\frac{a_n}{b_n} = \frac{\ln n}{n^{1/2}} \to 0 (part c), and ∑1n3/2\sum \frac{1}{n^{3/2}} converges, so the one-sided case applies: ∑ln⁡nn2\sum \frac{\ln n}{n^2} CONVERGES. Any exponent strictly between 11 and 22 works; 32\frac{3}{2} is the one that keeps the arithmetic clean.

e) It is not a pp-series: in 1np\frac{1}{n^p} the exponent is a CONSTANT, and here it changes with nn and tends to 11. With bn=1nb_n = \frac{1}{n}: anbn=nn1+1/n=n−1/n=1n1/n\frac{a_n}{b_n} = \frac{n}{n^{1 + 1/n}} = n^{-1/n} = \frac{1}{n^{1/n}}. Now ln⁡(n1/n)=ln⁡nn→0\ln\left(n^{1/n}\right) = \frac{\ln n}{n} \to 0, so n1/n→e0=1n^{1/n} \to e^0 = 1 and the ratio tends to 11. Since 0<1<∞0 < 1 < \infty and the harmonic series diverges, ∑1n1+1/n\sum \frac{1}{n^{1 + 1/n}} DIVERGES. The extra factor n−1/nn^{-1/n} tends to 11: it is far too weak to pull the harmonic series into convergence, although every single exponent exceeds 11.

Exercise 5: The remainder estimate: how far is the partial sum from the sum?

When the integral test applies, it does more than decide: it measures the error. Write sn=a1+⋯+ans_n = a_1 + \dots + a_n and Rn=S−sn=an+1+an+2+⋯R_n = S - s_n = a_{n+1} + a_{n+2} + \cdots, the remainder. If ff is continuous, positive and decreasing on [n,∞)[n, \infty) with f(k)=akf(k) = a_k, then ∫n+1∞f(x) dx≤Rn≤∫n∞f(x) dx\int_{n+1}^{\infty} f(x)\,dx \le R_n \le \int_n^{\infty} f(x)\,dx.

The figure shows, for ∑1n2\sum \frac{1}{n^2}, the rectangles of heights a4,a5,…a_4, a_5, \dots placed on [3,4],[4,5],…[3, 4], [4, 5], \dots.

1234567890.10.20.3y = 1/x²shaded: a₄ + a₅ + ... + a₉
  • a) Using the figure, explain why R3≤∫3∞dxx2R_3 \le \int_3^{\infty} \frac{dx}{x^2}. Then say where to place the same rectangles to prove R3≥∫4∞dxx2R_3 \ge \int_4^{\infty} \frac{dx}{x^2}, and state both inequalities for a general nn.
  • b) Compute s3s_3 for ∑n=1∞1n2\sum_{n=1}^{\infty} \frac{1}{n^2} exactly, and deduce that 2918≤S≤6136\frac{29}{18} \le S \le \frac{61}{36}.
  • c) Replace SS by the midpoint of that interval. Give this estimate and the error it guarantees, and compare with the error of s3s_3 alone, knowing that S=π26≈1.645S = \frac{\pi^2}{6} \approx 1.645.
  • d) How many terms of ∑1n3\sum \frac{1}{n^3} guarantee an error below 12000\frac{1}{2000}? Show that 3030 terms do not.
  • e) For ∑1n2\sum \frac{1}{n^2}, find the SMALLEST nn for which Rn<1100R_n < \frac{1}{100}, proving both that it works and that n−1n - 1 does not.
Show the solution

Answers

  • a) ∫n+1∞f(x) dx≤Rn≤∫n∞f(x) dx\int_{n+1}^{\infty} f(x)\,dx \le R_n \le \int_n^{\infty} f(x)\,dx
  • b) s3=4936s_3 = \frac{49}{36}, 14≤R3≤13\frac{1}{4} \le R_3 \le \frac{1}{3}, so 2918≤S≤6136\frac{29}{18} \le S \le \frac{61}{36}.
  • c) S≈11972S \approx \frac{119}{72} with error at most 124\frac{1}{24}; s3s_3 alone is off by about 0.280.28.
  • d) Rn≤12n2≤12000R_n \le \frac{1}{2n^2} \le \frac{1}{2000} for n≥32n \ge 32; R30>11922>12000R_{30} > \frac{1}{1922} > \frac{1}{2000}.
  • e) n=100n = 100: R100<1100R_{100} < \frac{1}{100} and R99>1100R_{99} > \frac{1}{100}.

a) R3=a4+a5+⋯R_3 = a_4 + a_5 + \cdots is the total area of the shaded rectangles: widths 11, heights a4=f(4),a5=f(5),…a_4 = f(4), a_5 = f(5), \dots. On [k,k+1][k, k + 1] the rectangle has height f(k+1)f(k + 1), the value at its RIGHT end, and since ff decreases, f(k+1)≤f(x)f(k + 1) \le f(x) for all xx in the interval: every rectangle lies under the curve. So R3≤∫3∞dxx2R_3 \le \int_3^{\infty} \frac{dx}{x^2}. Move the same rectangles one step right, height aka_k on [k,k+1][k, k + 1] for k≥4k \ge 4: now the height is the value at the LEFT end, the maximum on the interval, and every rectangle covers the curve, so R3≥∫4∞dxx2R_3 \ge \int_4^{\infty} \frac{dx}{x^2}, the figure of the solution. In general: ∫n+1∞f≤Rn≤∫n∞f\int_{n+1}^{\infty} f \le R_n \le \int_n^{\infty} f. The upper bound starts at nn, the lower one at n+1n + 1: swapping them is the classic slip, and the picture is the way to rebuild them in ten seconds.

b) s3=1+14+19=36+9+436=4936s_3 = 1 + \frac{1}{4} + \frac{1}{9} = \frac{36 + 9 + 4}{36} = \frac{49}{36}. With ∫m∞dxx2=1m\int_m^{\infty} \frac{dx}{x^2} = \frac{1}{m}: 14≤R3≤13\frac{1}{4} \le R_3 \le \frac{1}{3}. Adding s3s_3 to each side of 14≤S−s3≤13\frac{1}{4} \le S - s_3 \le \frac{1}{3}: 4936+936≤S≤4936+1236\frac{49}{36} + \frac{9}{36} \le S \le \frac{49}{36} + \frac{12}{36}, that is 5836=2918≤S≤6136\frac{58}{36} = \frac{29}{18} \le S \le \frac{61}{36}. Three terms and two integrals pin the sum inside an interval of width 336=112\frac{3}{36} = \frac{1}{12}.

c) The midpoint is 12(5836+6136)=11972\frac{1}{2}\left(\frac{58}{36} + \frac{61}{36}\right) = \frac{119}{72}. Since SS lies in an interval of width 112\frac{1}{12}, it is at most half a width from the middle: the error is at most 124\frac{1}{24}, about 0.040.04. In fact 11972≈1.653\frac{119}{72} \approx 1.653 and π26≈1.645\frac{\pi^2}{6} \approx 1.645, an error below 0.010.01. The partial sum alone, s3=4936≈1.36s_3 = \frac{49}{36} \approx 1.36, misses by about 0.280.28. The remainder estimate turned three terms into two correct decimals: that is the reason it is in the course.

d) f(x)=1x3f(x) = \frac{1}{x^3} is continuous, positive and decreasing on [1,∞)[1, \infty), and ∫n∞dxx3=12n2\int_n^{\infty} \frac{dx}{x^3} = \frac{1}{2n^2}. So Rn≤12n2R_n \le \frac{1}{2n^2}, which is ≤12000\le \frac{1}{2000} as soon as n2≥1000n^2 \ge 1000. Since 312=96131^2 = 961 and 322=102432^2 = 1024, n=32n = 32 terms guarantee the precision. For the other direction use the LOWER bound: R30≥∫31∞dxx3=12⋅961=11922R_{30} \ge \int_{31}^{\infty} \frac{dx}{x^3} = \frac{1}{2 \cdot 961} = \frac{1}{1922}, which is more than 12000\frac{1}{2000}: 3030 terms are not enough, and fewer terms leave an even larger remainder. The bounds leave only n=31n = 31 undecided. An upper bound tells you what SUFFICES; only the lower bound can prove that something does NOT.

e) Since f(x)=1x2f(x) = \frac{1}{x^2} is STRICTLY decreasing, both inequalities are strict: 1n+1<Rn<1n\frac{1}{n + 1} < R_n < \frac{1}{n}. For n=100n = 100: R100<1100R_{100} < \frac{1}{100}, so 100100 terms work. For n=99n = 99: R99>199+1=1100R_{99} > \frac{1}{99 + 1} = \frac{1}{100}, so 9999 terms do not. The smallest nn is exactly 100100. Compare with d): the p=3p = 3 series needs about 3232 terms for 12000\frac{1}{2000}, the p=2p = 2 series needs 100100 terms for a precision twenty times coarser. The closer pp is to 11, the slower the remainder dies, and at p=1p = 1 it never does.

1234567890.10.20.3y = 1/x²rectangles a₄, a₅, ... from x = 4shaded: area from 4 to infinity

Part B: problems and reasoning (/50)

Exercise 6: Logarithms: where they decide, and where they do not

Powers of ln⁡n\ln n grow more slowly than any positive power of nn: lim⁡n→∞(ln⁡n)qnε=0\lim_{n \to \infty} \frac{(\ln n)^q}{n^{\varepsilon}} = 0 for every qq and every ε>0\varepsilon > 0. This exercise finds out when that matters, with all three tools of the chapter.

From the chapter on improper integrals, quote: ∫2∞dxxln⁡x\int_2^{\infty} \frac{dx}{x \ln x} diverges and ∫2∞dxx(ln⁡x)2=1ln⁡2\int_2^{\infty} \frac{dx}{x(\ln x)^2} = \frac{1}{\ln 2}.

24681012141618200.20.40.60.811/(x (ln x)²): converges1/(x ln x): diverges1/x: diverges(e, 1/e)
  • a) For which real numbers pp does ∑n=2∞1npln⁡n\sum_{n=2}^{\infty} \frac{1}{n^p \ln n} converge? Treat p>1p > 1, p=1p = 1 and p<1p < 1, each with its own test.
  • b) Decide ∑n=3∞1nln⁡n ln⁡(ln⁡n)\sum_{n=3}^{\infty} \frac{1}{n \ln n \,\ln(\ln n)}, checking the hypotheses of the integral test. Why does the sum start at n=3n = 3?
  • c) Decide ∑n=1∞(ln⁡n)5n6/5\sum_{n=1}^{\infty} \frac{(\ln n)^5}{n^{6/5}} with a limit comparison, choosing the benchmark carefully.
  • d) The figure plots 1x\frac{1}{x}, 1xln⁡x\frac{1}{x\ln x} and 1x(ln⁡x)2\frac{1}{x(\ln x)^2}. At x=2x = 2 the term of the only CONVERGENT series is the largest of the three. Explain why this is no contradiction, and show that the three curves meet at (e,1e)(e, \frac{1}{e}).
  • e) State and justify the rule: ∑(ln⁡n)qnp\sum \frac{(\ln n)^q}{n^p} converges if p>1p > 1 and diverges if p<1p < 1, whatever the real number qq. What happens when p=1p = 1?
Show the solution

Answers

  • a) Converges exactly when p>1p > 1: comparison with 1np\frac{1}{n^p}, integral test at p=1p = 1, comparison with 1n\frac{1}{n} for p<1p < 1.
  • b) ∫3t=ln⁡(ln⁡(ln⁡t))−ln⁡(ln⁡(ln⁡3))→∞\int_3^t = \ln(\ln(\ln t)) - \ln(\ln(\ln 3)) \to \infty: diverges. ln⁡(ln⁡2)<0\ln(\ln 2) < 0.
  • c) bn=1n11/10b_n = \frac{1}{n^{11/10}}, limit 00: converges.
  • d) Convergence depends on the TAIL, not on the first terms; at x=ex = e, ln⁡x=1\ln x = 1 and all three equal 1e\frac{1}{e}.
  • e) p>1p > 1: converges; p<1p < 1: diverges; p=1p = 1: converges exactly when q<−1q < -1.

a) The terms are positive for n≥2n \ge 2. If p>1p > 1: for n≥3n \ge 3, ln⁡n>1\ln n > 1, so 1npln⁡n<1np\frac{1}{n^p \ln n} < \frac{1}{n^p}, a convergent pp-series: CONVERGES by comparison. If p=1p = 1: f(x)=1xln⁡xf(x) = \frac{1}{x\ln x} is continuous and positive on [2,∞)[2, \infty), and decreasing as the reciprocal of a product of two positive increasing functions; ∫2∞dxxln⁡x\int_2^{\infty} \frac{dx}{x\ln x} diverges, so the series DIVERGES by the integral test. If p<1p < 1: npln⁡nn=ln⁡nn1−p→0\frac{n^p \ln n}{n} = \frac{\ln n}{n^{1-p}} \to 0 since 1−p>01 - p > 0, so npln⁡n≤nn^p \ln n \le n for nn large, that is an≥1na_n \ge \frac{1}{n}, and the series DIVERGES by comparison with the harmonic series. So it converges exactly when p>1p > 1: the logarithm changes nothing, except that it could have mattered at p=1p = 1, and there it does not save the series either.

b) We need ln⁡(ln⁡x)>0\ln(\ln x) > 0, that is ln⁡x>1\ln x > 1, that is x>ex > e: at n=2n = 2, ln⁡(ln⁡2)<0\ln(\ln 2) < 0 because ln⁡2<1\ln 2 < 1, so the term would be negative, and the series starts at 33. On [3,∞)[3, \infty), f(x)=1xln⁡x ln⁡(ln⁡x)f(x) = \frac{1}{x\ln x\,\ln(\ln x)} is continuous, positive, and decreasing as the reciprocal of a product of three positive increasing functions. With u=ln⁡(ln⁡x)u = \ln(\ln x), du=1ln⁡x⋅1x dxdu = \frac{1}{\ln x}\cdot\frac{1}{x}\,dx: ∫3tf(x) dx=∫ln⁡(ln⁡3)ln⁡(ln⁡t)duu=ln⁡(ln⁡(ln⁡t))−ln⁡(ln⁡(ln⁡3))→∞\int_3^t f(x)\,dx = \int_{\ln(\ln 3)}^{\ln(\ln t)} \frac{du}{u} = \ln(\ln(\ln t)) - \ln(\ln(\ln 3)) \to \infty. The series DIVERGES by the integral test. It diverges absurdly slowly: ln⁡(ln⁡(ln⁡t))\ln(\ln(\ln t)) passes 22 only when tt exceeds eee2e^{e^{e^2}}, a number with more than seven hundred digits. No numerical experiment could ever detect this divergence, which is why the test is needed.

c) Terms positive for n≥2n \ge 2 (a1=0a_1 = 0). Against 1n6/5\frac{1}{n^{6/5}} the ratio is (ln⁡n)5→∞(\ln n)^5 \to \infty, with a convergent benchmark: no conclusion. Keep a sliver of the power to absorb the logarithm: bn=1n11/10b_n = \frac{1}{n^{11/10}}, still a convergent pp-series since 1110>1\frac{11}{10} > 1. Then anbn=(ln⁡n)5n6/5−11/10=(ln⁡n)5n1/10=(ln⁡nn1/50)5\frac{a_n}{b_n} = \frac{(\ln n)^5}{n^{6/5 - 11/10}} = \frac{(\ln n)^5}{n^{1/10}} = \left(\frac{\ln n}{n^{1/50}}\right)^5, and ln⁡xx1/50→0\frac{\ln x}{x^{1/50}} \to 0 by L'Hospital's rule (1/x150x−49/50=50x1/50→0\frac{1/x}{\frac{1}{50}x^{-49/50}} = \frac{50}{x^{1/50}} \to 0). The limit is 00 and ∑bn\sum b_n converges: the series CONVERGES. Raising the inner ratio to the fifth power is what avoids applying L'Hospital five times.

d) Convergence is decided by the TAIL: changing or dropping finitely many terms never changes it. At x=2x = 2, ln⁡2<1\ln 2 < 1, so (ln⁡2)2<ln⁡2<1(\ln 2)^2 < \ln 2 < 1, and dividing by a SMALLER number gives a LARGER value: 12(ln⁡2)2>12ln⁡2>12\frac{1}{2(\ln 2)^2} > \frac{1}{2\ln 2} > \frac{1}{2}. At x=ex = e, ln⁡e=1\ln e = 1, so the three expressions all equal 1e\frac{1}{e}: the red point. For x>ex > e, ln⁡x>1\ln x > 1 and the order reverses for good, the convergent term becoming the SMALLEST. The picture of the first terms decides nothing; the integral test, which looks at the whole tail, does: ∫2∞dxx(ln⁡x)2=1ln⁡2\int_2^{\infty} \frac{dx}{x(\ln x)^2} = \frac{1}{\ln 2} is finite, while the other two integrals diverge.

e) If p>1p > 1: put r=1+p2r = \frac{1 + p}{2}, strictly between 11 and pp. Then (ln⁡n)q/np1/nr=(ln⁡n)qnp−r→0\frac{(\ln n)^q / n^p}{1/n^r} = \frac{(\ln n)^q}{n^{p - r}} \to 0 because p−r>0p - r > 0, and ∑1nr\sum \frac{1}{n^r} converges: CONVERGES. If p<1p < 1: (ln⁡n)q/np1/n=n1−p(ln⁡n)q→∞\frac{(\ln n)^q / n^p}{1/n} = n^{1 - p}(\ln n)^q \to \infty because 1−p>01 - p > 0, and ∑1n\sum \frac{1}{n} diverges: DIVERGES. Part a) is the case q=−1q = -1 and part c) the case q=5q = 5. If p=1p = 1, no power can absorb the logarithm and the integral test decides: ∫2t(ln⁡x)qx dx=(ln⁡t)q+1−(ln⁡2)q+1q+1\int_2^t \frac{(\ln x)^q}{x}\,dx = \frac{(\ln t)^{q + 1} - (\ln 2)^{q + 1}}{q + 1} for q≠−1q \ne -1, finite as t→∞t \to \infty exactly when q+1<0q + 1 < 0. So at p=1p = 1 the series converges exactly when q<−1q < -1. The logarithm only matters on the border p=1p = 1.

Exercise 7: Transcendental terms: limit comparison with the limits of MATH 140

When the term is sin⁡1n\sin\frac{1}{n} or ln⁡(1+1n2)\ln\left(1 + \frac{1}{n^2}\right), there is no polynomial to read a dominant power from. The dominant power comes from four limits proved in MATH 140 with L'Hospital's rule: as t→0t \to 0, sin⁡tt→1\frac{\sin t}{t} \to 1, 1−cos⁡tt2→12\frac{1 - \cos t}{t^2} \to \frac{1}{2}, ln⁡(1+t)t→1\frac{\ln(1 + t)}{t} \to 1 and et−1t→1\frac{e^t - 1}{t} \to 1.

With t=1nt = \frac{1}{n} or t=1n2t = \frac{1}{n^2}, which tends to 00 as n→∞n \to \infty, each limit turns into a limit comparison with a pp-series.

  • a) Decide ∑n=1∞sin⁡1n\sum_{n=1}^{\infty} \sin\frac{1}{n}, after checking that its terms are positive.
  • b) Decide ∑n=1∞(1−cos⁡1n)\sum_{n=1}^{\infty} \left(1 - \cos\frac{1}{n}\right).
  • c) Decide ∑n=1∞ln⁡(1+1n2)\sum_{n=1}^{\infty} \ln\left(1 + \frac{1}{n^2}\right) and ∑n=1∞(e1/n−1)\sum_{n=1}^{\infty} \left(e^{1/n} - 1\right).
  • d) Rationalize, then decide: ∑n=1∞(n2+1−n)\sum_{n=1}^{\infty} \left(\sqrt{n^2 + 1} - n\right) and ∑n=1∞n+1−nn\sum_{n=1}^{\infty} \frac{\sqrt{n + 1} - \sqrt{n}}{n}.
  • e) For which p>0p > 0 does ∑n=1∞(1−cos⁡1np)\sum_{n=1}^{\infty} \left(1 - \cos\frac{1}{n^p}\right) converge?
Show the solution

Answers

  • a) sin⁡(1/n)1/n→1\frac{\sin(1/n)}{1/n} \to 1: diverges like ∑1n\sum \frac{1}{n}.
  • b) 1−cos⁡(1/n)1/n2→12\frac{1 - \cos(1/n)}{1/n^2} \to \frac{1}{2}: converges.
  • c) ln⁡(1+1n2)\ln\left(1 + \frac{1}{n^2}\right): limit 11 with 1n2\frac{1}{n^2}, converges. e1/n−1e^{1/n} - 1: limit 11 with 1n\frac{1}{n}, diverges.
  • d) 1n2+1+n\frac{1}{\sqrt{n^2 + 1} + n} behaves like 12n\frac{1}{2n}: diverges. 1n(n+1+n)\frac{1}{n(\sqrt{n + 1} + \sqrt{n})} behaves like 12n3/2\frac{1}{2n^{3/2}}: converges.
  • e) Converges exactly when p>12p > \frac{1}{2}.

a) For n≥1n \ge 1, 0<1n≤1<π0 < \frac{1}{n} \le 1 < \pi, and sin⁡\sin is positive on (0,π)(0, \pi): the terms are positive. With bn=1nb_n = \frac{1}{n}: anbn=sin⁡(1/n)1/n\frac{a_n}{b_n} = \frac{\sin(1/n)}{1/n}. As n→∞n \to \infty, t=1n→0+t = \frac{1}{n} \to 0^+ and sin⁡tt→1\frac{\sin t}{t} \to 1, so the ratio tends to 11. Since 0<1<∞0 < 1 < \infty and ∑1n\sum \frac{1}{n} diverges, ∑sin⁡1n\sum \sin\frac{1}{n} DIVERGES by limit comparison. Note that sin⁡1n→0\sin\frac{1}{n} \to 0: the divergence test is silent, and the direct inequality sin⁡1n≤1n\sin\frac{1}{n} \le \frac{1}{n}, although true, points the useless way. The limit is exactly the tool for a term that is equivalent to 1n\frac{1}{n} without being bounded below by it in any obvious way.

b) cos⁡1n<1\cos\frac{1}{n} < 1 since 0<1n≤1<2π0 < \frac{1}{n} \le 1 < 2\pi, so the terms are positive. With bn=1n2b_n = \frac{1}{n^2} and t=1nt = \frac{1}{n}: anbn=1−cos⁡tt2→12\frac{a_n}{b_n} = \frac{1 - \cos t}{t^2} \to \frac{1}{2}. Since 0<12<∞0 < \frac{1}{2} < \infty and ∑1n2\sum \frac{1}{n^2} converges, the series CONVERGES. The benchmark is 1n2\frac{1}{n^2}, not 1n\frac{1}{n}: 1−cos⁡t1 - \cos t is of order t2t^2. Comparing with 1n\frac{1}{n} gives the limit lim⁡1−cos⁡tt=0\lim \frac{1 - \cos t}{t} = 0 against a DIVERGENT series, which decides nothing.

c) Both terms are positive, since ln⁡(1+u)>0\ln(1 + u) > 0 and eu>1e^u > 1 for u>0u > 0. With u=1n2→0u = \frac{1}{n^2} \to 0 and bn=1n2b_n = \frac{1}{n^2}: ln⁡(1+u)u→1\frac{\ln(1 + u)}{u} \to 1, and ∑1n2\sum \frac{1}{n^2} converges, so ∑ln⁡(1+1n2)\sum \ln\left(1 + \frac{1}{n^2}\right) CONVERGES. With t=1nt = \frac{1}{n} and bn=1nb_n = \frac{1}{n}: et−1t→1\frac{e^t - 1}{t} \to 1, and ∑1n\sum \frac{1}{n} diverges, so ∑(e1/n−1)\sum \left(e^{1/n} - 1\right) DIVERGES. The rule of thumb that comes out of a), b) and c): each of these functions of a small tt behaves like its first non-zero power of tt, and that power, with t=1nt = \frac{1}{n}, is the pp of the benchmark.

d) Multiply by the conjugate: n2+1−n=(n2+1)−n2n2+1+n=1n2+1+n>0\sqrt{n^2 + 1} - n = \frac{(n^2 + 1) - n^2}{\sqrt{n^2 + 1} + n} = \frac{1}{\sqrt{n^2 + 1} + n} > 0. With bn=1nb_n = \frac{1}{n}: anbn=nn2+1+n=11+1/n2+1→12\frac{a_n}{b_n} = \frac{n}{\sqrt{n^2 + 1} + n} = \frac{1}{\sqrt{1 + 1/n^2} + 1} \to \frac{1}{2}, so the first series DIVERGES. For the second, n+1−n=1n+1+n\sqrt{n + 1} - \sqrt{n} = \frac{1}{\sqrt{n + 1} + \sqrt{n}}, so an=1n(n+1+n)>0a_n = \frac{1}{n(\sqrt{n + 1} + \sqrt{n})} > 0. With bn=1n3/2b_n = \frac{1}{n^{3/2}}: anbn=nn+1+n=11+1/n+1→12\frac{a_n}{b_n} = \frac{\sqrt{n}}{\sqrt{n + 1} + \sqrt{n}} = \frac{1}{\sqrt{1 + 1/n} + 1} \to \frac{1}{2}, and ∑1n3/2\sum \frac{1}{n^{3/2}} converges, so the second series CONVERGES. A difference of two large roots hides its size; the conjugate makes it visible, and only then can a dominant power be read.

e) The terms are positive, as in b). With t=1np→0t = \frac{1}{n^p} \to 0 (because p>0p > 0) and bn=1n2p=t2b_n = \frac{1}{n^{2p}} = t^2: anbn=1−cos⁡tt2→12\frac{a_n}{b_n} = \frac{1 - \cos t}{t^2} \to \frac{1}{2}. So the series has the fate of ∑1n2p\sum \frac{1}{n^{2p}}, a pp-series with exponent 2p2p: it converges exactly when 2p>12p > 1, that is p>12p > \frac{1}{2}. At p=12p = \frac{1}{2}, the terms behave like 12n\frac{1}{2n} and the series diverges; part b) is the case p=1p = 1.

Exercise 8: Five statements to correct

Each statement below was written in a MATH 141 answer, and each contains an error: a false conclusion, or a true conclusion reached by an argument that proves nothing. Say what is wrong, give a correct argument or statement, and settle it with a counterexample when the statement is false.

  • a) 1n2−n>1n2\frac{1}{n^2 - \sqrt{n}} > \frac{1}{n^2} and ∑1n2\sum \frac{1}{n^2} converges, so ∑n=2∞1n2−n\sum_{n=2}^{\infty} \frac{1}{n^2 - \sqrt{n}} converges by the comparison test.
  • b) By the integral test, ∑n=1∞1n3=∫1∞dxx3=12\sum_{n=1}^{\infty} \frac{1}{n^3} = \int_1^{\infty} \frac{dx}{x^3} = \frac{1}{2}.
  • c) ∑n=2∞1n1+1/ln⁡n\sum_{n=2}^{\infty} \frac{1}{n^{1 + 1/\ln n}} converges, because every exponent 1+1ln⁡n1 + \frac{1}{\ln n} is greater than 11.
  • d) The integral test only needs ff continuous and positive: the decreasing hypothesis is a technicality.
  • e) If an>0a_n > 0 and ∑an\sum a_n converges, then ∑an\sum \sqrt{a_n} converges too, since the square roots of small numbers are small.
Show the solution

Answers

  • a) Verdict right, argument void (larger than convergent); limit comparison with 1n2\frac{1}{n^2}, limit 11: converges.
  • b) False: S>1>12S > 1 > \frac{1}{2}; in fact 12<S≤32\frac{1}{2} < S \le \frac{3}{2}.
  • c) False: n1/ln⁡n=en^{1/\ln n} = e, so the term is 1en\frac{1}{en}: diverges.
  • d) False: f(x)=sin⁡2(πx)xf(x) = \frac{\sin^2(\pi x)}{x} gives a series of zeros but a divergent integral.
  • e) False: an=1n2a_n = \frac{1}{n^2} gives ∑1n\sum \frac{1}{n}. True instead: ∑an2\sum a_n^2 converges.

a) The VERDICT is right and the ARGUMENT is worth nothing. Being larger than the terms of a convergent series proves nothing: 1n>1n2\frac{1}{n} > \frac{1}{n^2} as well, and ∑1n\sum \frac{1}{n} diverges. A correct argument: for n≥2n \ge 2, n2−n>0n^2 - \sqrt{n} > 0, and with bn=1n2b_n = \frac{1}{n^2}, anbn=n2n2−n=11−n−3/2→1\frac{a_n}{b_n} = \frac{n^2}{n^2 - \sqrt{n}} = \frac{1}{1 - n^{-3/2}} \to 1; since ∑1n2\sum \frac{1}{n^2} converges, the series converges by LIMIT comparison. On a final, a right verdict with this argument earns about one mark out of four: the marks are for the inequality that points the right way.

b) FALSE. All terms are positive, so the sum exceeds its first term: S>1>12S > 1 > \frac{1}{2}. The integral test gives the FATE of the series, never its value: the integral is the area under the curve, the series the area of rectangles that stick out above it. What the rectangles do give is a bracket: ∫1∞f≤S≤a1+∫1∞f\int_1^{\infty} f \le S \le a_1 + \int_1^{\infty} f, that is 12≤S≤32\frac{1}{2} \le S \le \frac{3}{2}. (The sum is about 1.201.20.) Correct statement: by the integral test the series converges, and 12≤S≤32\frac{1}{2} \le S \le \frac{3}{2}.

c) FALSE. Simplify the term first: n1/ln⁡n=e1ln⁡n⋅ln⁡n=e1=en^{1/\ln n} = e^{\frac{1}{\ln n}\cdot\ln n} = e^1 = e, so 1n1+1/ln⁡n=1n⋅n1/ln⁡n=1en\frac{1}{n^{1 + 1/\ln n}} = \frac{1}{n \cdot n^{1/\ln n}} = \frac{1}{en}. The series is 1e\frac{1}{e} times the harmonic series without its first term: it DIVERGES. The pp-series test needs a CONSTANT exponent. Here the exponent tends to 11, and whether such a series converges depends on how fast: 1+1ln⁡n1 + \frac{1}{\ln n} approaches 11 too fast, and the excess over nn is just the constant factor ee.

d) FALSE. Take f(x)=sin⁡2(πx)xf(x) = \frac{\sin^2(\pi x)}{x}, continuous and ≥0\ge 0 on [1,∞)[1, \infty). At every integer sin⁡(πn)=0\sin(\pi n) = 0, so ∑f(n)=0\sum f(n) = 0: the series converges. But on [k,k+1][k, k + 1], 1x≥1k+1\frac{1}{x} \ge \frac{1}{k + 1} and ∫kk+1sin⁡2(πx) dx=12\int_k^{k+1} \sin^2(\pi x)\,dx = \frac{1}{2}, so ∫1N+1f(x) dx≥12∑k=1N1k+1→∞\int_1^{N + 1} f(x)\,dx \ge \frac{1}{2}\sum_{k=1}^{N} \frac{1}{k + 1} \to \infty: the integral diverges. Without the decrease, the values at the integers do not control the area between them. Correct statement: ff continuous, positive AND decreasing on some [N,∞)[N, \infty).

e) FALSE. an=1n2a_n = \frac{1}{n^2} is positive and ∑1n2\sum \frac{1}{n^2} converges, but an=1n\sqrt{a_n} = \frac{1}{n} and the harmonic series diverges. Square roots of small numbers are LARGER than the numbers: 0.01=0.1\sqrt{0.01} = 0.1. The true statement goes the other way: if ∑an\sum a_n converges with an>0a_n > 0, then an→0a_n \to 0, so an≤1a_n \le 1 for nn large, hence 0<an2≤an0 < a_n^2 \le a_n, and ∑an2\sum a_n^2 converges by comparison.

Exercise 9: The leaning tower of books: how slowly the harmonic series grows

Identical books, each one unit long, are stacked flat at the edge of a table, each sticking out beyond the one below it. Statics shows that the largest possible overhang is reached when the kk-th book from the TOP sticks out 12k\frac{1}{2k} of a length beyond the book (or the table) below it. With nn books the tip of the top book is then Dn=12(1+12+⋯+1n)=12HnD_n = \frac{1}{2}\left(1 + \frac{1}{2} + \dots + \frac{1}{n}\right) = \frac{1}{2}H_n lengths beyond the edge of the table, where HnH_n is the nn-th partial sum of the harmonic series.

The figure shows four books: D4=12+14+16+18=2524D_4 = \frac{1}{2} + \frac{1}{4} + \frac{1}{6} + \frac{1}{8} = \frac{25}{24}, so the top book is already entirely beyond the table. Take e3≈20.1e^3 \approx 20.1, e4≈54.6e^4 \approx 54.6 and e9≈8103e^9 \approx 8103.

tableoverhang1/21/41/61/8
  • a) Comparing HnH_n with areas under y=1xy = \frac{1}{x}, prove that ln⁡(n+1)≤Hn≤1+ln⁡n\ln(n + 1) \le H_n \le 1 + \ln n for every n≥1n \ge 1.
  • b) Deduce that the overhang can be made as large as desired. Which test of the chapter is this?
  • c) Using a), find a number of books that surely gives an overhang of at least 22 lengths, and a number below which this is impossible.
  • d) Show that an overhang of 55 lengths needs more than 80008000 books. With books 33 cm thick, how tall is the stack at least?
  • e) A more cautious builder lets the kk-th book from the top stick out only 12k2\frac{1}{2k^2}. Show that, whatever the number of books, her overhang stays below one length.
Show the solution

Answers

  • a) ln⁡(n+1)≤Hn≤1+ln⁡n\ln(n + 1) \le H_n \le 1 + \ln n
  • b) Dn≥12ln⁡(n+1)→∞D_n \ge \frac{1}{2}\ln(n + 1) \to \infty: the integral test for ∑1k\sum \frac{1}{k}.
  • c) 5454 books suffice; fewer than 2121 cannot work (the true minimum is 3131).
  • d) Hn≥10H_n \ge 10 forces n≥e9n \ge e^9, so at least 81048104 books, a stack of more than 243243 m.
  • e) 12∑1k2<12(1+∫1∞dxx2)=1\frac{1}{2}\sum \frac{1}{k^2} < \frac{1}{2}\left(1 + \int_1^{\infty} \frac{dx}{x^2}\right) = 1

a) f(x)=1xf(x) = \frac{1}{x} is continuous, positive and decreasing on [1,∞)[1, \infty). On [k,k+1][k, k + 1] the rectangle of height 1k\frac{1}{k}, the value at the LEFT end, covers the curve (tall boxes in the figure of the solution). The nn rectangles for k=1,…,nk = 1, \dots, n have total area HnH_n and cover the region under the curve from 11 to n+1n + 1: Hn≥∫1n+1dxx=ln⁡(n+1)H_n \ge \int_1^{n+1} \frac{dx}{x} = \ln(n + 1). On [k,k+1][k, k + 1] the rectangle of height 1k+1\frac{1}{k + 1}, the value at the RIGHT end, lies under the curve (dashed tops). Those for k=1,…,n−1k = 1, \dots, n - 1 have area 12+⋯+1n=Hn−1\frac{1}{2} + \dots + \frac{1}{n} = H_n - 1 and fit under the curve from 11 to nn: Hn−1≤ln⁡nH_n - 1 \le \ln n. Together: ln⁡(n+1)≤Hn≤1+ln⁡n\ln(n + 1) \le H_n \le 1 + \ln n, and for n=1n = 1 both sides read ln⁡2≤1≤1\ln 2 \le 1 \le 1.

b) Dn=12Hn≥12ln⁡(n+1)D_n = \frac{1}{2}H_n \ge \frac{1}{2}\ln(n + 1), and ln⁡(n+1)→∞\ln(n + 1) \to \infty: with enough books the tip goes as far from the table as you like, with no book ever resting on nothing. This is exactly the integral test applied to ∑1k\sum \frac{1}{k}: the integral ∫1∞dxx\int_1^{\infty} \frac{dx}{x} diverges, so the harmonic series diverges, and the inequality of a) is the proof of that test written for one series. The terms 12k\frac{1}{2k}, the extra overhang of each new book, tend to 00, and still the total is unbounded.

c) An overhang of 22 means Hn≥4H_n \ge 4. SUFFICIENT: Hn≥ln⁡(n+1)≥4H_n \ge \ln(n + 1) \ge 4 as soon as n+1≥e4≈54.6n + 1 \ge e^4 \approx 54.6, that is n≥54n \ge 54. So 5454 books surely work. NECESSARY: Hn≤1+ln⁡nH_n \le 1 + \ln n, so Hn≥4H_n \ge 4 forces ln⁡n≥3\ln n \ge 3, that is n≥e3≈20.1n \ge e^3 \approx 20.1, so n≥21n \ge 21. The minimum lies between 2121 and 5454. (Adding the terms one by one, H30≈3.99H_{30} \approx 3.99 and H31≈4.03H_{31} \approx 4.03: the true minimum is 3131 books.) The lower bound of a) answers the question what suffices, the upper bound the question what is impossible, and neither alone answers both.

d) An overhang of 55 lengths means Hn≥10H_n \ge 10. Since Hn≤1+ln⁡nH_n \le 1 + \ln n, this forces ln⁡n≥9\ln n \ge 9, that is n≥e9≈8103n \ge e^9 \approx 8103, so at least 81048104 books. The stack is then at least 8104×3=24 3128104 \times 3 = 24\,312 cm, more than 243243 m, taller than most office towers, for an overhang of five book lengths. The harmonic series diverges, but at the speed of a logarithm: each extra length of overhang multiplies the number of books by about e2≈7.4e^2 \approx 7.4.

e) Her overhang with nn books is 12∑k=1n1k2\frac{1}{2}\sum_{k=1}^{n} \frac{1}{k^2}, a partial sum of a series with positive terms, so it is less than the full sum 12∑k=1∞1k2\frac{1}{2}\sum_{k=1}^{\infty} \frac{1}{k^2}. By the rectangle argument of a) with f(x)=1x2f(x) = \frac{1}{x^2}: ∑k=2∞1k2<∫1∞dxx2=1\sum_{k=2}^{\infty} \frac{1}{k^2} < \int_1^{\infty} \frac{dx}{x^2} = 1, so ∑k=1∞1k2<2\sum_{k=1}^{\infty} \frac{1}{k^2} < 2 and her overhang stays below 12⋅2=1\frac{1}{2} \cdot 2 = 1 length, whatever the number of books. Two builders, two terms that both tend to 00: 12k\frac{1}{2k} gives an unbounded overhang, 12k2\frac{1}{2k^2} a bounded one. What decides is the exponent, p=1p = 1 against p=2p = 2, not the fact that the terms shrink.

12345670.20.40.60.811.2tall boxes: 1 + 1/2 + ... + 1/6 = H₆dashed tops: 1/2 + ... + 1/7 = H₇ − 1shaded: ln 7

Exercise 10: A final exam question: one family of series, the whole chapter

The shape of a long final exam question: one family of series, and every tool of the chapter used on it once. For a real number pp, consider ∑n=1∞n(n2+1)p\sum_{n=1}^{\infty} \frac{n}{(n^2 + 1)^p}, whose terms are all positive.

  • a) Using a limit comparison with a pp-series, find all real pp for which the series converges.
  • b) For p=2p = 2, check the three hypotheses of the integral test on f(x)=x(x2+1)2f(x) = \frac{x}{(x^2 + 1)^2} and confirm the verdict of a).
  • c) For p=2p = 2, compute s2s_2 and prove that 1950≤S≤43100\frac{19}{50} \le S \le \frac{43}{100}.
  • d) For p=2p = 2, how many terms guarantee an error below 1200\frac{1}{200}? Show that 88 terms do not.
  • e) For p=1p = 1 a student writes: nn2+1<nn2=1n\frac{n}{n^2 + 1} < \frac{n}{n^2} = \frac{1}{n} and the harmonic series diverges, so the series diverges. Correct the argument, and confirm the verdict with the integral test.
Show the solution

Answers

  • a) an1/n2p−1→1\frac{a_n}{1/n^{2p - 1}} \to 1: converges exactly when 2p−1>12p - 1 > 1, that is p>1p > 1.
  • b) f′(x)=1−3x2(x2+1)3<0f'(x) = \frac{1 - 3x^2}{(x^2 + 1)^3} < 0 on [1,∞)[1, \infty) and ∫1∞f=14\int_1^{\infty} f = \frac{1}{4}: converges.
  • c) s2=33100s_2 = \frac{33}{100}, 120≤R2≤110\frac{1}{20} \le R_2 \le \frac{1}{10}, so 1950≤S≤43100\frac{19}{50} \le S \le \frac{43}{100}.
  • d) Rn≤12(n2+1)≤1200R_n \le \frac{1}{2(n^2 + 1)} \le \frac{1}{200} for n≥10n \ge 10; R8≥1164>1200R_8 \ge \frac{1}{164} > \frac{1}{200}.
  • e) n2+1≤2n2n^2 + 1 \le 2n^2 gives an≥12na_n \ge \frac{1}{2n}: diverges; also ∫1t=12ln⁡t2+12→∞\int_1^t = \frac{1}{2}\ln\frac{t^2 + 1}{2} \to \infty.

a) Dominant terms: n(n2)p=1n2p−1\frac{n}{(n^2)^p} = \frac{1}{n^{2p - 1}}. With bn=1n2p−1b_n = \frac{1}{n^{2p - 1}}: anbn=n⋅n2p−1(n2+1)p=n2p(n2+1)p=(n2n2+1)p=(11+1/n2)p→1\frac{a_n}{b_n} = \frac{n \cdot n^{2p - 1}}{(n^2 + 1)^p} = \frac{n^{2p}}{(n^2 + 1)^p} = \left(\frac{n^2}{n^2 + 1}\right)^p = \left(\frac{1}{1 + 1/n^2}\right)^p \to 1, for EVERY real pp, since the base tends to 11. Both series have positive terms, and 0<1<∞0 < 1 < \infty, so the series behaves like ∑1n2p−1\sum \frac{1}{n^{2p - 1}}, which converges exactly when 2p−1>12p - 1 > 1. Answer: the series converges if and only if p>1p > 1. The exponent of the benchmark is 2p−12p - 1, not 2p2p: the nn in the numerator eats one power, and forgetting it gives the wrong threshold p>12p > \frac{1}{2}.

b) f(x)=x(x2+1)2f(x) = \frac{x}{(x^2 + 1)^2} is continuous (the denominator never vanishes) and positive on [1,∞)[1, \infty). By the quotient rule, f′(x)=(x2+1)2−x⋅2(x2+1)⋅2x(x2+1)4=x2+1−4x2(x2+1)3=1−3x2(x2+1)3f'(x) = \frac{(x^2 + 1)^2 - x \cdot 2(x^2 + 1)\cdot 2x}{(x^2 + 1)^4} = \frac{x^2 + 1 - 4x^2}{(x^2 + 1)^3} = \frac{1 - 3x^2}{(x^2 + 1)^3}, negative for x≥1x \ge 1: ff decreases. With u=x2+1u = x^2 + 1: ∫1tx dx(x2+1)2=[−12(x2+1)]1t=14−12(t2+1)→14\int_1^t \frac{x\,dx}{(x^2 + 1)^2} = \left[-\frac{1}{2(x^2 + 1)}\right]_1^t = \frac{1}{4} - \frac{1}{2(t^2 + 1)} \to \frac{1}{4}. The integral converges, so the series converges by the integral test, in agreement with a) since 2>12 > 1. The value 14\frac{1}{4} is not the sum: the first term alone is already a1=14a_1 = \frac{1}{4}.

c) s2=1(1+1)2+2(4+1)2=14+225=25+8100=33100s_2 = \frac{1}{(1 + 1)^2} + \frac{2}{(4 + 1)^2} = \frac{1}{4} + \frac{2}{25} = \frac{25 + 8}{100} = \frac{33}{100}. From b), ∫m∞f=12(m2+1)\int_m^{\infty} f = \frac{1}{2(m^2 + 1)}, so ∫3∞f=120\int_3^{\infty} f = \frac{1}{20} and ∫2∞f=110\int_2^{\infty} f = \frac{1}{10}. The remainder estimate gives 120≤R2≤110\frac{1}{20} \le R_2 \le \frac{1}{10}, and S=s2+R2S = s_2 + R_2 gives 33100+5100≤S≤33100+10100\frac{33}{100} + \frac{5}{100} \le S \le \frac{33}{100} + \frac{10}{100}, that is 1950≤S≤43100\frac{19}{50} \le S \le \frac{43}{100}. The decrease of ff was checked on [1,∞)[1, \infty), which contains [2,∞)[2, \infty), as the estimate requires.

d) Rn≤∫n∞f=12(n2+1)R_n \le \int_n^{\infty} f = \frac{1}{2(n^2 + 1)}, and 12(n2+1)≤1200\frac{1}{2(n^2 + 1)} \le \frac{1}{200} exactly when n2+1≥100n^2 + 1 \ge 100, that is n2≥99n^2 \ge 99. Since 92=819^2 = 81 and 102=10010^2 = 100, n=10n = 10 terms guarantee the precision. For n=8n = 8, the LOWER bound: R8≥∫9∞f=12⋅82=1164>1200R_8 \ge \int_9^{\infty} f = \frac{1}{2 \cdot 82} = \frac{1}{164} > \frac{1}{200}, so 88 terms are not enough. For n=9n = 9 the two bounds, 1202\frac{1}{202} and 1164\frac{1}{164}, straddle 1200\frac{1}{200} and decide nothing: an answer of 1010 terms is the one the estimate justifies.

e) The inequality nn2+1<1n\frac{n}{n^2 + 1} < \frac{1}{n} is true and useless: smaller than a divergent series proves nothing. The verdict needs a LOWER bound. Since 1≤n21 \le n^2 for n≥1n \ge 1, n2+1≤2n2n^2 + 1 \le 2n^2, so nn2+1≥n2n2=12n\frac{n}{n^2 + 1} \ge \frac{n}{2n^2} = \frac{1}{2n}, and ∑12n\sum \frac{1}{2n} diverges: the series DIVERGES by the comparison test. With the integral test: f(x)=xx2+1f(x) = \frac{x}{x^2 + 1} is continuous and positive, f′(x)=1−x2(x2+1)2≤0f'(x) = \frac{1 - x^2}{(x^2 + 1)^2} \le 0 on [1,∞)[1, \infty), and ∫1tf(x) dx=12ln⁡(t2+1)−12ln⁡2→∞\int_1^t f(x)\,dx = \frac{1}{2}\ln(t^2 + 1) - \frac{1}{2}\ln 2 \to \infty. Both routes agree with a): p=1p = 1 is not >1> 1.

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