Study guide

7.4 Advanced Summation Techniques and Sequence Applications

Gaokao Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Sets, Logic, and Algebraic Foundations

1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations

2 Chapter 2: Functions and Fundamental Properties

2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros

3 Chapter 3: Exponential, Logarithmic, and Power Functions

3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates

4 Chapter 4: Complex Numbers and Quadratic Function Views

4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint

5 Chapter 5: Trigonometric Functions and Identities

5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions

6 Chapter 6: Triangles and Trigonometric Applications

6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling

7 Chapter 7: Sequences and Series

7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications

8 Chapter 8: Plane Vectors

8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications

9 Chapter 9: Lines and Circles in Cartesian Coordinates

9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles

10 Chapter 10: Conic Sections: Ellipses

10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems

11 Chapter 11: Conic Sections: Hyperbolas and Parabolas

11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems

12 Chapter 12: Solid Geometry: Three-Dimensional Figures

12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations

13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors

13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances

14 Chapter 14: Permutations, Combinations, and Binomial Theorem

14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients

15 Chapter 15: Probability and Statistics

15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression

16 Chapter 16: Derivatives and Mathematical Modeling

16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving

7.4 Advanced Summation Techniques and Sequence Applications

Key Takeaways Explain This Topic AI

Telescoping cancellation (裂项相消法) decomposes general terms into c_n = f(n+1) - f(n), causing all intermediate terms to collapse.

Multiply-and-subtract method (错位相减法) computes sums of arithmetico-geometric sequences c_n = (an+b)q^{n-1}, requiring careful exponent tracking.

Grouping summation (分组求和法) separates hybrid general terms into distinct arithmetic and geometric components.

Reverse pairing summation (倒序相加法) exploits functional symmetry f(x) + f(1-x) = C or sequence term pairing.

Sequence applications in Gaokao involve financial mathematics (compound interest, annuities) and sequence inequality proofs using telescoping bounds.

Last updated: July 2026

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 c_n c n ​ can be decomposed into the difference of consecutive values of an auxiliary sequence f ( n ) f(n) f ( n ) : c n = f ( n + 1 ) − f ( n ) or c n = f ( n ) − f ( n + 1 ) c_n = f(n+1) - f(n) \quad \text{or} \quad c_n = f(n) - f(n+1) c n ​ = f ( n + 1 ) − f ( n ) or c n ​ = f ( n ) − f ( n + 1 )

then the partial sum S n = ∑ k = 1 n c n S_n = \sum_{k=1}^n c_n S n ​ = ∑ k = 1 n ​ c n ​ collapses all interior terms: S n = ( f ( 2 ) − f ( 1 ) ) + ( f ( 3 ) − f ( 2 ) ) + ⋯ + ( f ( n + 1 ) − f ( n ) ) = f ( n + 1 ) − f ( 1 ) S_n = (f(2) - f(1)) + (f(3) - f(2)) + \dots + (f(n+1) - f(n)) = f(n+1) - f(1) S n ​ = ( f ( 2 ) − f ( 1 )) + ( f ( 3 ) − f ( 2 )) + ⋯ + ( f ( n + 1 ) − f ( n )) = f ( n + 1 ) − f ( 1 )

Classic Telescoping Decomposition Archetypes

Standard Rational Fraction : 1 n ( n + 1 ) = 1 n − 1 n + 1 \frac{1}{n(n+1)} = \frac{1}{n} - \frac{1}{n+1} n ( n + 1 ) 1 ​ = n 1 ​ − n + 1 1 ​

General Linear Product Fraction : 1 ( a n + b ) ( a n + b + d ) = 1 d ( 1 a n + b − 1 a n + b + d ) \frac{1}{(an+b)(an+b+d)} = \frac{1}{d} \left( \frac{1}{an+b} - \frac{1}{an+b+d} \right) ( an + b ) ( an + b + d ) 1 ​ = d 1 ​ ( an + b 1 ​ − an + b + d 1 ​ )

Radical Denominator Rationalization : 1 n + 1 + n = n + 1 − n ( n + 1 + n ) ( n + 1 − n ) = n + 1 − n \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} n + 1 ​ + n ​ 1 ​ = ( n + 1 ​ + n ​ ) ( n + 1 ​ − n ​ ) n + 1 ​ − n ​ ​ = n + 1 ​ − n ​

Factorial Product Fraction : n ( n + 1 ) ! = ( n + 1 ) − 1 ( n + 1 ) ! = 1 n ! − 1 ( n + 1 ) ! \frac{n}{(n+1)!} = \frac{(n+1)-1}{(n+1)!} = \frac{1}{n!} - \frac{1}{(n+1)!} ( n + 1 )! n ​ = ( n + 1 )! ( n + 1 ) − 1 ​ = n ! 1 ​ − ( n + 1 )! 1 ​

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

Summation of an arithmetico-geometric sequence T n = ∑ k = 1 n c k T_n = \sum_{k=1}^n c_k T n ​ = ∑ k = 1 n ​ c k ​ , where c k = a k ⋅ b k c_k = a_k \cdot b_k c k ​ = a k ​ ⋅ b k ​ , with ( a k ) (a_k) ( a k ​ ) being an arithmetic sequence a k = a 1 + ( k − 1 ) d a_k = a_1 + (k-1)d a k ​ = a 1 ​ + ( k − 1 ) d and ( b k ) (b_k) ( b k ​ ) a geometric sequence b k = b 1 q k − 1 b_k = b_1 q^{k-1} b k ​ = b 1 ​ q k − 1 ( q ≠ 0 , 1 q \neq 0, 1 q  = 0 , 1 ).

Rigorous Step-by-Step Derivation

Write out T n T_n T n ​ explicitly: T n = a 1 b 1 + a 2 ( b 1 q ) + a 3 ( b 1 q 2 ) + ⋯ + a n ( b 1 q n − 1 ) T_n = a_1 b_1 + a_2 (b_1 q) + a_3 (b_1 q^2) + \dots + a_n (b_1 q^{n-1}) T n ​ = a 1 ​ b 1 ​ + a 2 ​ ( b 1 ​ q ) + a 3 ​ ( b 1 ​ q 2 ) + ⋯ + a n ​ ( b 1 ​ q n − 1 )

Multiply the entire expression by the common ratio q q q and shift terms by one position to align equal powers of q q q : q T n = a 1 ( b 1 q ) + a 2 ( b 1 q 2 ) + ⋯ + a n − 1 ( b 1 q n − 1 ) + a n ( b 1 q n ) q T_n = \quad \quad a_1 (b_1 q) + a_2 (b_1 q^2) + \dots + a_{n-1} (b_1 q^{n-1}) + a_n (b_1 q^n) q T n ​ = a 1 ​ ( b 1 ​ q ) + a 2 ​ ( b 1 ​ q 2 ) + ⋯ + a n − 1 ​ ( b 1 ​ q n − 1 ) + a n ​ ( b 1 ​ q n )

Subtract q T n q T_n q T n ​ from T n T_n T n ​ : ( 1 − q ) T n = a 1 b 1 + ( a 2 − a 1 ) b 1 q + ( a 3 − a 2 ) b 1 q 2 + ⋯ + ( a n − a n − 1 ) b 1 q n − 1 − a n b 1 q n (1-q) T_n = a_1 b_1 + (a_2 - a_1) b_1 q + (a_3 - a_2) b_1 q^2 + \dots + (a_n - a_{n-1}) b_1 q^{n-1} - a_n b_1 q^n ( 1 − q ) T n ​ = a 1 ​ b 1 ​ + ( a 2 ​ − a 1 ​ ) b 1 ​ q + ( a 3 ​ − a 2 ​ ) b 1 ​ q 2 + ⋯ + ( a n ​ − a n − 1 ​ ) b 1 ​ q n − 1 − a n ​ b 1 ​ q n

Since a k − a k − 1 = d a_k - a_{k-1} = d a k ​ − a k − 1 ​ = d for all middle terms, the intermediate terms form a pure geometric series of n − 1 n-1 n − 1 terms: ( 1 − q ) T n = a 1 b 1 + d b 1 q ( 1 − q n − 1 1 − q ) − a n b 1 q n (1-q) T_n = a_1 b_1 + d b_1 q \left( \frac{1 - q^{n-1}}{1 - q} \right) - a_n b_1 q^n ( 1 − q ) T n ​ = a 1 ​ b 1 ​ + d b 1 ​ q ( 1 − q 1 − q n − 1 ​ ) − a n ​ b 1 ​ q n

Finally, divide by 1 − q 1-q 1 − q to isolate T n T_n T n ​ .

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

Do not forget to multiply the final term a n b 1 q n − 1 a_n b_1 q^{n-1} a n ​ b 1 ​ q n − 1 by q q q , obtaining − a n b 1 q n - a_n b_1 q^n − a n ​ b 1 ​ q n .

Note that the middle geometric series contains n − 1 n-1 n − 1 terms, not n n n terms.

Remember to divide the final expression by ( 1 − q ) (1-q) ( 1 − q ) .

  • 3. Grouping and Reverse Pairing Summation Methods
  • Grouping Summation Method (分组求和法)

When the general term c n c_n c n ​ is a linear combination of simpler terms c n = a n ± b n c_n = a_n \pm b_n c n ​ = a n ​ ± b n ​ , where a n a_n a n ​ and b n b_n b n ​ are standard arithmetic or geometric terms, compute sums separately: S n = ∑ k = 1 n a k ± ∑ k = 1 n b k S_n = \sum_{k=1}^n a_k \pm \sum_{k=1}^n b_k S n ​ = k = 1 ∑ n ​ a k ​ ± k = 1 ∑ n ​ b k ​

Reverse Pairing Method (倒序相加法)

When sequence terms exhibit symmetric structural properties relative to n n n , such as c k + c n + 1 − k = C c_k + c_{n+1-k} = C c k ​ + c n + 1 − k ​ = C (constant), write S n S_n S n ​ forwards and backwards and add: 2 S n = ∑ k = 1 n ( c k + c n + 1 − k ) = n ⋅ C ⟹ S n = n C 2 2 S_n = \sum_{k=1}^n (c_k + c_{n+1-k}) = n \cdot C \implies S_n = \frac{n C}{2} 2 S n ​ = k = 1 ∑ n ​ ( c k ​ + c n + 1 − k ​ ) = n ⋅ C ⟹ S n ​ = 2 n C ​

4. Sequence Applications & Inequality Proofs

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

Common Bounding Strategies for Sequence Inequalities:

Telescoping Bounding (裂项放缩) : To prove S n < M S_n < M S n ​ < M , bound a k < f ( k ) − f ( k + 1 ) a_k < f(k) - f(k+1) a k ​ < f ( k ) − f ( k + 1 ) and telescope.

Example: 1 n 2 < 1 n ( n − 1 ) = 1 n − 1 − 1 n \frac{1}{n^2} < \frac{1}{n(n-1)} = \frac{1}{n-1} - \frac{1}{n} n 2 1 ​ < n ( n − 1 ) 1 ​ = n − 1 1 ​ − n 1 ​ for n ≥ 2 n \ge 2 n ≥ 2 .

Geometric Series Bounding (等比放缩) : Bound terms by a geometric sequence a k ≤ C q k a_k \le C q^k a k ​ ≤ C q k with ∣ q ∣ < 1 |q| < 1 ∣ q ∣ < 1 .

Loading diagram... Summation Method Decision Tree

  • Worked Gaokao Exam Examples
  • Example 1 (Multiply-and-Subtract Method)

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

Solution :

Write T n T_n T n ​ explicitly: T n = 1 ⋅ 2 1 + 3 ⋅ 2 2 + 5 ⋅ 2 3 + ⋯ + ( 2 n − 1 ) ⋅ 2 n T_n = 1 \cdot 2^1 + 3 \cdot 2^2 + 5 \cdot 2^3 + \dots + (2n-1) \cdot 2^n T n ​ = 1 ⋅ 2 1 + 3 ⋅ 2 2 + 5 ⋅ 2 3 + ⋯ + ( 2 n − 1 ) ⋅ 2 n

Multiply T n T_n T n ​ by the common ratio q = 2 q = 2 q = 2 : 2 T n = 1 ⋅ 2 2 + 3 ⋅ 2 3 + ⋯ + ( 2 n − 3 ) ⋅ 2 n + ( 2 n − 1 ) ⋅ 2 n + 1 2 T_n = 1 \cdot 2^2 + 3 \cdot 2^3 + \dots + (2n-3) \cdot 2^n + (2n-1) \cdot 2^{n+1} 2 T n ​ = 1 ⋅ 2 2 + 3 ⋅ 2 3 + ⋯ + ( 2 n − 3 ) ⋅ 2 n + ( 2 n − 1 ) ⋅ 2 n + 1

Subtract 2 T n 2 T_n 2 T n ​ from T n T_n T n ​ : − T n = 1 ⋅ 2 1 + [ 2 ⋅ 2 2 + 2 ⋅ 2 3 + ⋯ + 2 ⋅ 2 n ] − ( 2 n − 1 ) ⋅ 2 n + 1 -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} − T n ​ = 1 ⋅ 2 1 + [ 2 ⋅ 2 2 + 2 ⋅ 2 3 + ⋯ + 2 ⋅ 2 n ] − ( 2 n − 1 ) ⋅ 2 n + 1

Simplify the middle terms (a geometric sum of n − 1 n-1 n − 1 terms with a = 8 , q = 2 a=8, q=2 a = 8 , q = 2 ): 2 ⋅ 2 2 + 2 ⋅ 2 3 + ⋯ + 2 ⋅ 2 n = 2 ( 2 2 + 2 3 + ⋯ + 2 n ) = 2 ⋅ 4 ( 2 n − 1 − 1 ) 2 − 1 = 8 ( 2 n − 1 − 1 ) = 2 n + 2 − 8 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 2 ⋅ 2 2 + 2 ⋅ 2 3 + ⋯ + 2 ⋅ 2 n = 2 ( 2 2 + 2 3 + ⋯ + 2 n ) = 2 ⋅ 2 − 1 4 ( 2 n − 1 − 1 ) ​ = 8 ( 2 n − 1 − 1 ) = 2 n + 2 − 8 Substituting back: − T n = 2 + 2 n + 2 − 8 − ( 2 n − 1 ) ⋅ 2 n + 1 = 2 n + 2 − 6 − ( 2 n − 1 ) ⋅ 2 n + 1 -T_n = 2 + 2^{n+2} - 8 - (2n-1) \cdot 2^{n+1} = 2^{n+2} - 6 - (2n-1) \cdot 2^{n+1} − T n ​ = 2 + 2 n + 2 − 8 − ( 2 n − 1 ) ⋅ 2 n + 1 = 2 n + 2 − 6 − ( 2 n − 1 ) ⋅ 2 n + 1 Rewrite 2 n + 2 = 2 ⋅ 2 n + 1 2^{n+2} = 2 \cdot 2^{n+1} 2 n + 2 = 2 ⋅ 2 n + 1 : − T n = [ 2 − ( 2 n − 1 ) ] ⋅ 2 n + 1 − 6 = ( 3 − 2 n ) ⋅ 2 n + 1 − 6 -T_n = [2 - (2n-1)] \cdot 2^{n+1} - 6 = (3 - 2n) \cdot 2^{n+1} - 6 − T n ​ = [ 2 − ( 2 n − 1 )] ⋅ 2 n + 1 − 6 = ( 3 − 2 n ) ⋅ 2 n + 1 − 6

Multiply by − 1 -1 − 1 : T n = ( 2 n − 3 ) ⋅ 2 n + 1 + 6 T_n = (2n - 3) \cdot 2^{n+1} + 6 T n ​ = ( 2 n − 3 ) ⋅ 2 n + 1 + 6

Example 2 (Telescoping Summation and Inequality Proof)

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

Find the sum S n = ∑ k = 1 n a k S_n = \sum_{k=1}^n a_k S n ​ = ∑ k = 1 n ​ a k ​ .

Prove that S n < 1 S_n < 1 S n ​ < 1 for all n ∈ N ∗ n \in \mathbb{N}^* n ∈ N ∗ .

Solution :

Decompose the general term using partial fraction decomposition: a n = 1 n ( n + 1 ) = 1 n − 1 n + 1 a_n = \frac{1}{n(n+1)} = \frac{1}{n} - \frac{1}{n+1} a n ​ = n ( n + 1 ) 1 ​ = n 1 ​ − n + 1 1 ​

Write out the partial sum S n S_n S n ​ : S n = ( 1 − 1 2 ) + ( 1 2 − 1 3 ) + ⋯ + ( 1 n − 1 n + 1 ) 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) S n ​ = ( 1 − 2 1 ​ ) + ( 2 1 ​ − 3 1 ​ ) + ⋯ + ( n 1 ​ − n + 1 1 ​ )

All intermediate terms cancel telescopically: S n = 1 − 1 n + 1 = n n + 1 S_n = 1 - \frac{1}{n+1} = \frac{n}{n+1} S n ​ = 1 − n + 1 1 ​ = n + 1 n ​

For any positive integer n ∈ N ∗ n \in \mathbb{N}^* n ∈ N ∗ , n + 1 > n > 0 n+1 > n > 0 n + 1 > n > 0 , so 1 n + 1 > 0 \frac{1}{n+1} > 0 n + 1 1 ​ > 0 .

Therefore: S n = 1 − 1 n + 1 < 1 S_n = 1 - \frac{1}{n+1} < 1 S n ​ = 1 − n + 1 1 ​ < 1

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