Chapter 20 — Further Reading

Annotated pointers for going deeper, with explicit section mapping to the two reference texts this book is calibrated against. Use the textbook mappings first to drill the standard material; reach for the analysis and history titles to understand why the theorems are true and where they came from.

Primary Textbook Mapping

Stewart, J. (2020). Calculus: Early Transcendentals (9th ed.). Cengage. - §11.1 "Sequences" is the exact counterpart to this chapter: the definition of a sequence, the limit of a sequence, the limit laws, the Squeeze Theorem, and the Monotone Sequence Theorem (Stewart's name for our Monotone Convergence Theorem). Work Stewart's §11.1 exercises 1–87 for sheer drilling volume on the limits of Part B and the monotone/bounded arguments of Part D. - Stewart introduces series in §11.2, the natural next stop after this chapter — read its first pages to see our §20.9 "a series is the limit of its partial sums" stated in his notation. - Stewart's continuous-function and L'Hôpital connection (using a continuous $f$ with $f(n)=a_n$) appears in §11.1; it leans on §4.4 (L'Hôpital), which corresponds to this book's Chapter 9.

Strang, G., and Herman, E. Calculus, Volume 2. OpenStax (free, openstax.org). - §5.1 "Sequences" is the free-text match to this chapter: definitions, limit laws, the Squeeze Theorem, bounded/monotone sequences, and the Monotone Convergence Theorem, with worked recursive examples close to our §20.6 Babylonian case. - §5.2 "Infinite Series" and the geometric series there give the closed-form behind the drug-plateau limit $C^* = D/(1-f)$ in Case Study 2, and set up Chapter 21 of this book. - OpenStax is the recommended free companion: its exercises and "Student Project" boxes (including a logistic/Fibonacci-flavored project) reinforce §20.7.

Mapping note. This book's section numbers (20.1–20.11) do not line up one-to-one with Stewart §11.1 or OpenStax §5.1, but the content does: our §20.3 = their convergence definition, our §20.4–20.5 = their limit laws and standard limits, our §20.6 = their Monotone (Convergence) Theorem, our §20.7 (recursion, fixed points, stability) goes beyond both standard texts toward numerical analysis.

Rigorous Real-Analysis Treatments

Abbott, S. (2015). Understanding Analysis (2nd ed.). Springer. Chapter 2 is devoted to sequences with unusually clear, well-motivated proofs of the limit laws, the Monotone Convergence Theorem, and the Bolzano–Weierstrass theorem. The best first stop if you want the proofs behind §20.3–20.6.

Rudin, W. (1976). Principles of Mathematical Analysis (3rd ed.). McGraw-Hill. Chapter 3 treats sequences and series with full rigor, including subsequences, Cauchy sequences, and completeness — the formal underpinning of the MCT's reliance on the completeness of $\mathbb{R}$ noted in §20.6. Terse but authoritative.

Tao, T. (2006). Analysis I. Springer / Hindustan. Constructs the real numbers themselves from Cauchy sequences of rationals, showing why "bounded monotone sequences converge" is equivalent to there being no gaps in $\mathbb{R}$ — the deepest answer to "why does the MCT hold?"

Bressoud, D. M. (2007). A Radical Approach to Real Analysis (2nd ed.). MAA. Develops sequence and series theory in the historical order it was discovered, motivating each definition by the problem it solved.

On $e$ and Compound Interest (Case Study 1)

Maor, E. (1994). e: The Story of a Number. Princeton University Press. The definitive accessible history; its Bernoulli chapter is the long version of Case Study 1, tracing $(1+1/n)^n$ from a banking puzzle to a universal constant.

Dunham, W. (1999). Euler: The Master of Us All. MAA. How Euler formalized $e$, proved $(1+r/n)^n \to e^r$, and connected it to the series $\sum 1/k!$ that reappears in Chapter 23.

Strogatz, S. (2019). Infinite Powers. Houghton Mifflin Harcourt. A general-audience tour of calculus with a strong chapter on the exponential function and why $e$ is "natural."

On Recursion, Fixed Points, and Numerical Methods (Case Study 2 and §20.7)

Burden, R. L., and Faires, J. D. (2011). Numerical Analysis (9th ed.). Brooks/Cole. Chapter 2 covers fixed-point iteration, the stability criterion $|g'(a^*)|<1$, and Newton's method with full convergence analysis — the rigorous version of §20.7.

Strogatz, S. (2015). Nonlinear Dynamics and Chaos (2nd ed.). Westview. The accessible classic on fixed points, stability, and the logistic map; read it to see the attracting/repelling distinction of §20.7 generalized.

Rowland, M., and Tozer, T. N. (2011). Clinical Pharmacokinetics and Pharmacodynamics (4th ed.). Lippincott. The clinical home of Case Study 2: multiple-dose accumulation, steady-state concentration $D/(1-f)$, and the "four-to-five half-lives" rule, all as the dosing sequence of §20.6–20.7.

On the Fibonacci Sequence and the Golden Ratio (§20.7, Exercise 20.29)

Livio, M. (2003). The Golden Ratio: The Story of Phi. Crown. Popular history of $\phi$, including why $F_{n+1}/F_n \to \phi$.

Vorobiev, N. (2002). Fibonacci Numbers. Birkhäuser. A short rigorous treatment, including Binet's explicit formula contrasted with the recursive definition (the explicit-vs-recursive tension of §20.2).

On the Euler–Mascheroni Constant (Exercise 20.22)

Havil, J. (2003). Gamma: Exploring Euler's Constant. Princeton University Press. A whole book on $\gamma \approx 0.5772$, the limit of $1 + \tfrac12 + \cdots + \tfrac1n - \ln n$ that Exercise 20.22 proves convergent by the MCT. Whether $\gamma$ is even irrational remains unknown after 200 years.

A Practice Recommendation

The standard limits of §20.5 should become reflexive. When you meet a sequence, immediately classify it:

• Ratio of polynomials → ratio of leading coefficients (§20.4).
• Exponential vs. polynomial → exponential wins for $r>1$ (§20.5 hierarchy).
• Factorial vs. exponential → factorial wins (§20.5 hierarchy).
• $(1 + x/n)^n$ pattern → $e^x$ (§20.5, §20.8).
• Recursion $a_{n+1}=f(a_n)$ → find the fixed point $L=f(L)$, then justify convergence via the MCT (§20.6) or $|f'(a^*)|<1$ (§20.7).

These patterns cover the large majority of practical sequence-limit questions — and every one of them returns in the convergence tests of Chapter 22.