The Main Idea 

The Main Idea 

Two fundamental sequence patterns appear frequently and have special names because of their predictable, useful structures.

Arithmetic sequences: Add the same amount each time. The explicit form is always [latex]a_n = cn + b[/latex] (linear function).

• Common difference: [latex]d = a_{n+1} - a_n[/latex] stays constant
• Example: [latex]3, 7, 11, 15, 19, \ldots[/latex] has [latex]d = 4[/latex] and [latex]a_n = 4n - 1[/latex]

Geometric sequences: Multiply by the same amount each time. The explicit form is always [latex]a_n = cr^n[/latex] (exponential function).

• Common ratio: [latex]r = \frac{a_{n+1}}{a_n}[/latex] stays constant
• Example: [latex]2, -\frac{2}{3}, \frac{2}{9}, -\frac{2}{27}, \ldots[/latex] has [latex]r = -\frac{1}{3}[/latex] and [latex]a_n = 2(-\frac{1}{3})^{n-1}[/latex]

Recognition strategy:

• Check differences between consecutive terms (if constant → arithmetic)
• Check ratios between consecutive terms (if constant → geometric)
• For complex sequences, examine numerators and denominators separately, watch for alternating signs

Write out several terms, identify the underlying structure, then build either an explicit formula or recurrence relation based on what you observe.

The Main Idea 

The most important question about any sequence is: What happens to the terms as [latex]n[/latex] gets really large? This “long-term behavior” determines whether a sequence is useful for mathematical modeling and tells us if the sequence settles down or keeps changing forever.

The fundamental classification:

• Convergent sequences: Terms get arbitrarily close to some finite number [latex]L[/latex] as [latex]n \to \infty[/latex]
• Divergent sequences: Terms don’t settle down to any finite value

Convergence depends only on what happens eventually. You can add, remove, or change any finite number of terms at the beginning without affecting whether the sequence converges.

Sequences can diverge by growing without bound ([latex]\lim_{n \to \infty} a_n = \infty[/latex]) or by oscillating forever. When we write [latex]\lim_{n \to \infty} a_n = \infty[/latex], we’re still saying the sequence diverges—we’re just describing how it diverges.

The formal definition: A sequence [latex]{a_n}[/latex] converges to [latex]L[/latex] if for every tiny distance [latex]\epsilon > 0[/latex], there exists some point [latex]N[/latex] such that all terms beyond [latex]N[/latex] are within [latex]\epsilon[/latex] of [latex]L[/latex].

If [latex]a_n = f(n)[/latex] for some function [latex]f[/latex], and you know [latex]\lim_{x \to \infty} f(x) = L[/latex], then [latex]\lim_{n \to \infty} a_n = L[/latex]. This lets you use familiar function limit techniques on sequences.

The Main Idea 

Once you understand the theory of sequence limits, the real skill lies in choosing the right technique to evaluate them efficiently. Most sequence limits can be found using a combination of basic patterns and algebraic manipulation.

Geometric sequence limits (your foundation):

• If [latex]0 < r < 1[/latex]: [latex]r^n \to 0[/latex]
• If [latex]r = 1[/latex]: [latex]r^n \to 1[/latex]
• If [latex]r > 1[/latex]: [latex]r^n \to \infty[/latex] (diverges)

Key building block: [latex]\lim_{n \to \infty} \frac{1}{n^k} = 0[/latex] for any positive integer [latex]k[/latex]. This simple fact handles many sequences involving polynomial denominators.

Algebraic limit laws: Just like with functions, you can break complex sequences apart:

• Sum/difference: [latex]\lim(a_n \pm b_n) = \lim a_n \pm \lim b_n[/latex]
• Product: [latex]\lim(a_n \cdot b_n) = (\lim a_n) \cdot (\lim b_n)[/latex]
• Quotient: [latex]\lim(\frac{a_n}{b_n}) = \frac{\lim a_n}{\lim b_n}[/latex] (when denominator limit ≠ 0)

Rational expressions strategy: For sequences like [latex]\frac{3n^4 - 7n^2 + 5}{6 - 4n^4}[/latex], factor out the highest power of [latex]n[/latex] from numerator and denominator. The limit depends on which degree is larger, just like with rational functions.

For sequences involving exponentials or indeterminate forms like [latex](1 + \frac{4}{n})^n[/latex], treat them as continuous functions and use logarithmic techniques or L’Hôpital’s rule.

The Main Idea 

When basic limit laws and algebraic manipulation aren’t enough, these advanced techniques handle the tricky cases that would otherwise leave you stuck.

L’Hôpital’s Rule for sequences: When you get indeterminate forms like [latex]\frac{\infty}{\infty}[/latex] or [latex]\frac{0}{0}[/latex], treat the sequence as a function and apply L’Hôpital’s rule. For [latex]{\frac{5n^2+1}{e^n}}[/latex], both numerator and denominator approach infinity, so differentiate top and bottom repeatedly until you get a determinate form.

Continuous functions preserve limits: If [latex]{a_n}[/latex] converges to [latex]L[/latex] and [latex]f[/latex] is continuous at [latex]L[/latex], then [latex]{f(a_n)}[/latex] converges to [latex]f(L)[/latex]. This is incredibly useful for sequences involving square roots, trigonometric functions, exponentials, and logarithms.

The Squeeze Theorem: When direct calculation is difficult, “sandwich” your sequence between two simpler sequences that converge to the same limit. This is particularly powerful for oscillating sequences.

Classic squeeze setup: For [latex]{\frac{\cos n}{n^2}}[/latex], use [latex]-1 \leq \cos n \leq 1[/latex] to get [latex]-\frac{1}{n^2} \leq \frac{\cos n}{n^2} \leq \frac{1}{n^2}[/latex]. Since both outer sequences approach 0, the middle one must too.

When to use each technique:

• L’Hôpital’s: Indeterminate forms involving exponentials, polynomials, or logarithms
• Continuous functions: When the sequence formula involves standard functions like [latex]\sin[/latex], [latex]\cos[/latex], [latex]\sqrt{x}[/latex], [latex]e^x[/latex]
• Squeeze Theorem: Oscillating sequences or when bounds are easier to find than exact values

Try the simplest approach first, then escalate to these advanced techniques when needed.

The Main Idea 

The Monotone Convergence Theorem provides a practical way to prove sequences converge even when you can’t calculate their exact limits. It combines two key concepts: boundedness and monotonicity (consistent direction of change).

If a sequence is both bounded and eventually monotone (either consistently increasing or consistently decreasing), then it must converge. No oscillation, no divergence to infinity—it has to settle down to some finite limit.

Key definitions:

• Bounded sequence: Has both upper and lower bounds (all terms stay within some finite range)
• Monotone sequence: Eventually increases consistently or decreases consistently
• Eventually monotone: The pattern holds from some point forward (early terms can behave differently)

The theorem: If [latex]{a_n}[/latex] is bounded and eventually monotone, then [latex]{a_n}[/latex] converges.

Why does this work? Think of a bounded increasing sequence as climbing a ladder with a ceiling. Since you can’t go through the ceiling (bounded above) and you keep climbing (increasing), you must approach some highest reachable point. That’s your limit.

Important relationships:

• All convergent sequences are bounded (but bounded sequences aren’t necessarily convergent)
• Unbounded sequences cannot converge
• Monotonicity eliminates oscillation, which is what makes bounded sequences fail to converge

This theorem is especially useful for recursively defined sequences and sequences involving factorials or exponentials where direct limit calculation is difficult.