7.4 Advanced Summation Techniques and Sequence Applications

7.4 Advanced Summation Techniques and Sequence Applications

Summation of non-standard sequences is one of the highest-frequency question types in the Gaokao Mathematics comprehensive exam. This section details four core summation methods and their applications in mathematical modeling and inequality proofs.

1. Telescoping Cancellation Method (裂项相消法)

Fundamental Concept

If the general term $c_n$ can be decomposed into the difference of consecutive values of an auxiliary sequence $f(n)$:

then the partial sum $S_n = \sum_{k=1}^n c_n$ collapses all interior terms:

Classic Telescoping Decomposition Archetypes

1. Standard Rational Fraction: $$\frac{1}{n(n+1)} = \frac{1}{n} - \frac{1}{n+1}$$
2. General Linear Product Fraction: $$\frac{1}{(an+b)(an+b+d)} = \frac{1}{d} \left( \frac{1}{an+b} - \frac{1}{an+b+d} \right)$$
3. Radical Denominator Rationalization: $$\frac{1}{\sqrt{n+1} + \sqrt{n}} = \frac{\sqrt{n+1} - \sqrt{n}}{(\sqrt{n+1} + \sqrt{n})(\sqrt{n+1} - \sqrt{n})} = \sqrt{n+1} - \sqrt{n}$$
4. Factorial Product Fraction: $$\frac{n}{(n+1)!} = \frac{(n+1)-1}{(n+1)!} = \frac{1}{n!} - \frac{1}{(n+1)!}$$

2. Multiply-and-Subtract Method (错位相减法)

Applicable Type

Summation of an arithmetico-geometric sequence $T_n = \sum_{k=1}^n c_k$, where $c_k = a_k \cdot b_k$, with $(a_k)$ being an arithmetic sequence $a_k = a_1 + (k-1)d$ and $(b_k)$ a geometric sequence $b_k = b_1 q^{k-1}$ ($q \neq 0, 1$).

Rigorous Step-by-Step Derivation

Write out $T_n$ explicitly:

Multiply the entire expression by the common ratio $q$ and shift terms by one position to align equal powers of $q$:

Subtract $q T_n$ from $T_n$:

Since $a_k - a_{k-1} = d$ for all middle terms, the intermediate terms form a pure geometric series of $n-1$ terms:

Finally, divide by $1-q$ to isolate $T_n$.

Gaokao Pitfall Alert: When performing multiply-and-subtract:

1. Do not forget to multiply the final term $a_n b_1 q^{n-1}$ by $q$, obtaining $- a_n b_1 q^n$.
2. Note that the middle geometric series contains $n-1$ terms, not $n$ terms.
3. Remember to divide the final expression by $(1-q)$.

3. Grouping and Reverse Pairing Summation Methods

Grouping Summation Method (分组求和法)

When the general term $c_n$ is a linear combination of simpler terms $c_n = a_n \pm b_n$, where $a_n$ and $b_n$ are standard arithmetic or geometric terms, compute sums separately:

Reverse Pairing Method (倒序相加法)

When sequence terms exhibit symmetric structural properties relative to $n$, such as $c_k + c_{n+1-k} = C$ (constant), write $S_n$ forwards and backwards and add:

4. Sequence Applications & Inequality Proofs

Sequence concepts are widely applied in financial mathematics (annuities, compound interest growth $A_n = P(1+r)^n$, loan amortization) and sequence inequality proofs.

Common Bounding Strategies for Sequence Inequalities:

1. Telescoping Bounding (裂项放缩): To prove $S_n < M$, bound $a_k < f(k) - f(k+1)$ and telescope.
   • Example: $\frac{1}{n^2} < \frac{1}{n(n-1)} = \frac{1}{n-1} - \frac{1}{n}$ for $n \ge 2$.
2. Geometric Series Bounding (等比放缩): Bound terms by a geometric sequence $a_k \le C q^k$ with $|q| < 1$.

Worked Gaokao Exam Examples

Example 1 (Multiply-and-Subtract Method)

Problem: Given an arithmetic sequence $(a_n)$ with $a_1 = 1$ and $d = 2$, so $a_n = 2n-1$. Let $b_n = 2^n$. Find the partial sum $T_n = \sum_{k=1}^n a_k b_k$.

Solution:

1. Write $T_n$ explicitly: $$T_n = 1 \cdot 2^1 + 3 \cdot 2^2 + 5 \cdot 2^3 + \dots + (2n-1) \cdot 2^n$$
2. Multiply $T_n$ by the common ratio $q = 2$: $$2 T_n = 1 \cdot 2^2 + 3 \cdot 2^3 + \dots + (2n-3) \cdot 2^n + (2n-1) \cdot 2^{n+1}$$
3. Subtract $2 T_n$ from $T_n$: $$-T_n = 1 \cdot 2^1 + \left[ 2 \cdot 2^2 + 2 \cdot 2^3 + \dots + 2 \cdot 2^n \right] - (2n-1) \cdot 2^{n+1}$$
4. Simplify the middle terms (a geometric sum of $n-1$ terms with $a=8, q=2$): $$2 \cdot 2^2 + 2 \cdot 2^3 + \dots + 2 \cdot 2^n = 2(2^2 + 2^3 + \dots + 2^n) = 2 \cdot \frac{4(2^{n-1} - 1)}{2 - 1} = 8(2^{n-1} - 1) = 2^{n+2} - 8$$ Substituting back: $$-T_n = 2 + 2^{n+2} - 8 - (2n-1) \cdot 2^{n+1} = 2^{n+2} - 6 - (2n-1) \cdot 2^{n+1}$$ Rewrite $2^{n+2} = 2 \cdot 2^{n+1}$: $$-T_n = [2 - (2n-1)] \cdot 2^{n+1} - 6 = (3 - 2n) \cdot 2^{n+1} - 6$$
5. Multiply by $-1$: $$T_n = (2n - 3) \cdot 2^{n+1} + 6$$

Example 2 (Telescoping Summation and Inequality Proof)

Problem: Let sequence $(a_n)$ have general term $a_n = \frac{1}{n(n+1)}$ for $n \ge 1$.

1. Find the sum $S_n = \sum_{k=1}^n a_k$.
2. Prove that $S_n < 1$ for all $n \in \mathbb{N}^*$.

Solution:

1. Decompose the general term using partial fraction decomposition:

   $$a_n = \frac{1}{n(n+1)} = \frac{1}{n} - \frac{1}{n+1}$$

   Write out the partial sum $S_n$:

   $$S_n = \left(1 - \frac{1}{2}\right) + \left(\frac{1}{2} - \frac{1}{3}\right) + \dots + \left(\frac{1}{n} - \frac{1}{n+1}\right)$$

   All intermediate terms cancel telescopically:

   $$S_n = 1 - \frac{1}{n+1} = \frac{n}{n+1}$$

2. For any positive integer $n \in \mathbb{N}^*$, $n+1 > n > 0$, so $\frac{1}{n+1} > 0$. Therefore:

   $$S_n = 1 - \frac{1}{n+1} < 1$$

   This completes the proof that $S_n < 1$ for all $n \in \mathbb{N}^*$.