Borui Academy

Chapter 1

Sequences

Limits, L'Hôpital, Squeeze, MBT

Chapter 1 — Sequences

By the end of this chapter you will:

  1. Distinguish a sequence from a series
  2. Decide whether a sequence converges and find its limit
  3. Use the Monotonic Bounded Theorem (MBT) to prove convergence
  4. Recognize the standard sequence patterns AP loves to test

1.0 Sequence vs. Series — One-Line Distinction

Sequence Series
What it is A list of numbers The sum of those numbers
Notation a1,a2,a3,a_1, a_2, a_3, \dots or {an}\{a_n\} n=1an=a1+a2+\sum_{n=1}^{\infty} a_n = a_1 + a_2 + \cdots
Convergence means Term ana_n approaches a number Total sum approaches a number
Analogy A trail of footprints The total length of the trail

🔑 Key insight: A sequence converging does not imply the corresponding series converges. Example: an=1na_n = \frac{1}{n} converges to 0, but the harmonic series 1n\sum \frac{1}{n} diverges to \infty. This is one of BC's favorite traps.

🎵 Audio 1 — Sequence vs. Series intuition (Chinese narration) — audio/01_intro.mp3


1.1 Sequences — Intuitive Layer

Picture this: you are hopping along a number line. Each hop lands at a point ana_n.

  • If your landings cluster closer and closer to a fixed value LL → the sequence converges, limnan=L\lim_{n\to\infty} a_n = L
  • If your landings wander or run off to infinity → it diverges

Sequence convergence on a number line — points cluster toward L

Formal definition (good to recognize, intuition is enough day-to-day):
limnan=L    ε>0, N, n>NanL<ε\lim_{n\to\infty} a_n = L \iff \forall \varepsilon > 0,\ \exists N,\ n>N \Rightarrow |a_n - L| < \varepsilon

In plain English: "no matter how small a tolerance ε\varepsilon you pick, eventually every ana_n falls inside an ε\varepsilon-neighborhood of LL."


1.2 Computing Limits — The Four Tools

Tool 1: Direct simplification

an=3n2+2nn2+5a_n = \frac{3n^2 + 2n}{n^2 + 5}

Divide top and bottom by the highest power n2n^2:

an=3+2/n1+5/n2n3+01+0=3a_n = \frac{3 + 2/n}{1 + 5/n^2} \xrightarrow{n\to\infty} \frac{3+0}{1+0} = 3

Rule: "compare degrees."

  • numerator degree > denominator → diverges to ±\pm\infty
  • equal degrees → ratio of leading coefficients
  • numerator degree < denominator → converges to 0

Tool 2: Replace nn by xx, then L'Hôpital

an=lnnna_n = \frac{\ln n}{n}

Treat nn as a continuous variable: limxlnxx=lim1/x1=0\lim_{x\to\infty}\frac{\ln x}{x} = \lim \frac{1/x}{1} = 0.

⚠️ Trap: L'Hôpital only applies to 00\frac{0}{0} or \frac{\infty}{\infty}. Verify the form first. Most AP problems are written in a form where this is legal.

Tool 3: Squeeze Theorem

When ana_n contains sin,cos\sin, \cos, or (1)n(-1)^n but is bounded between two known limits.

Example: an=sinnna_n = \frac{\sin n}{n}.

Since 1sinn1-1 \le \sin n \le 1:
1nsinnn1n-\frac{1}{n} \le \frac{\sin n}{n} \le \frac{1}{n}

Both outer bounds approach 0, so an0a_n \to 0.

Tool 4: Memorized limits

Sequence Limit
1np, p>0\frac{1}{n^p},\ p>0 00
rn, r<1r^n,\ \lvert r\rvert<1 00
rn, r=1r^n,\ r=1 11
rn, r>1r^n,\ r>1 or r1r\le -1 divergent
nn\sqrt[n]{n} 11
cn, c>0\sqrt[n]{c},\ c>0 11
(1+1n)n\left(1+\frac{1}{n}\right)^n ee
n!nn\frac{n!}{n^n} 00

🎵 Audio 4 — Four-tool overviewaudio/04_four_tools.mp3


1.3 Monotonic Bounded Theorem (MBT)

Intuition: an elevator that only goes up (monotonically increasing) but is capped by a ceiling (bounded above) must stop at some floor.

Monotonic bounded theorem — staircase rising under an upper bound

Theorem:

  • A sequence that is monotonically increasing AND bounded above converges.
  • A sequence that is monotonically decreasing AND bounded below converges.

How to prove monotonicity — three strategies:

  1. Sign of an+1ana_{n+1} - a_n
  2. Compare an+1an\frac{a_{n+1}}{a_n} with 1 (when all terms are positive)
  3. Replace nn with xx and check derivative sign

How to find the bound — usually plug in a few terms, guess, then verify by induction.

🎵 Audio 2 — Elevator analogy + solution playbookaudio/02_mbt.mp3


1.4 Worked Examples (Standard → Twist → AP-Level)

Example 1 (standard)

Find limn4n3n2n3+n2+1\displaystyle\lim_{n\to\infty} \frac{4n^3 - n}{2n^3 + n^2 + 1}.

Solution: divide by n3n^3:
=lim41/n22+1/n+1/n3=42=2= \lim \frac{4 - 1/n^2}{2 + 1/n + 1/n^3} = \frac{4}{2} = 2

Converges to 2.


Example 2 (twist)

Decide whether an=n!2na_n = \frac{n!}{2^n} converges.

Intuition: factorial grows faster than any exponential, so this should diverge.

Verify: an+1an=(n+1)!/2n+1n!/2n=n+12\frac{a_{n+1}}{a_n} = \frac{(n+1)!/2^{n+1}}{n!/2^n} = \frac{n+1}{2}.

For n2n \ge 2, the ratio exceeds 1, so ana_n keeps growing — diverges to \infty.

🔑 Speed hierarchy (slowest to fastest):
lognnpan (a>1)n!nn\log n \prec n^p \prec a^n \ (a>1) \prec n! \prec n^n
Whichever is in the numerator and slower → limit is 0. In the denominator and slower → limit is \infty.


Example 3 (AP-level — recursive sequence)

Let a1=1a_1 = 1 and an+1=2+ana_{n+1} = \sqrt{2 + a_n}. Show {an}\{a_n\} converges and find its limit.

Step 1 — Monotonicity? Compute a few terms: a1=1, a2=31.73, a31.93a_1=1,\ a_2=\sqrt{3}\approx 1.73,\ a_3 \approx 1.93. Looks increasing.

Induction: assume an>an1a_n > a_{n-1}. Then 2+an>2+an12 + a_n > 2 + a_{n-1}, so 2+an>2+an1\sqrt{2+a_n} > \sqrt{2+a_{n-1}}, i.e. an+1>ana_{n+1} > a_n. ✓

Step 2 — Bounded above? Guess upper bound =2= 2. Induction: an<22+an<4an+1=2+an<2a_n < 2 \Rightarrow 2 + a_n < 4 \Rightarrow a_{n+1} = \sqrt{2+a_n} < 2. ✓

By MBT, the sequence converges.

Step 3 — Find LL. Let L=limanL = \lim a_n. Take limits on both sides of the recursion:
L=2+LL2L2=0L=2 or 1L = \sqrt{2 + L} \Rightarrow L^2 - L - 2 = 0 \Rightarrow L = 2 \text{ or } -1

Since an>0a_n > 0, L=2L = 2. ✅

🔑 AP playbook for recursive sequences: prove MBT → set LL → solve the equation.

🎵 Audio 5 — Recursive-sequence three-step walkthroughaudio/05_example3.mp3


1.5 Trap Alerts ⚠️

  1. Sequence convergence ≠ series convergence. 1n0\frac{1}{n} \to 0 but 1n\sum \frac{1}{n} diverges.
  2. Verify the L'Hôpital form first. Only 00\frac{0}{0} or \frac{\infty}{\infty} qualify.
  3. (1)n(-1)^n alone diverges — it bounces between ±1\pm 1. But (1)nn0\frac{(-1)^n}{n} \to 0 via Squeeze.
  4. A "candidate" limit is not the limit until existence is proved. In Example 3 you must do MBT first, then solve. Don't skip.

🎵 Audio 6 — Four trap alertsaudio/06_traps.mp3


1.6 Mnemonic

"Compare degrees, remember ee and 11, squeeze for noise, MBT for recursion."

  • Compare degrees: rational expressions reduce to leading-coefficient ratio
  • ee and 11: (1+1/n)ne(1+1/n)^n \to e, n1\sqrt[n]{\cdot} \to 1
  • Squeeze: handles sin,cos,(1)n\sin, \cos, (-1)^n
  • MBT: handles recursive definitions

🎵 Audio 3 — Recap + mnemonicaudio/03_recap.mp3


Media Inventory

File Purpose
audio/01_intro.mp3 Sequence vs. series intuition
audio/02_mbt.mp3 MBT — elevator analogy + playbook
audio/03_recap.mp3 Chapter recap & mnemonic
audio/04_four_tools.mp3 Four-tool overview
audio/05_example3.mp3 Recursive-sequence walkthrough
audio/06_traps.mp3 Four trap alerts
images/01_convergence.png Number-line convergence visualization
images/02_mbt.png MBT staircase diagram

End of chapter. Next: series basics, geometric series, and p-series.