Study guide

7.3 Recurrence Relations and General Term Determination

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.3 Recurrence Relations and General Term Determination

Key Takeaways Explain This Topic AI

For additive recurrences a_{n+1} - a_n = f(n), the difference accumulation method gives a_n = a_1 + Sum_{k=1}^{n-1} f(k).

For multiplicative recurrences a_{n+1}/a_n = f(n), the product accumulation method gives a_n = a_1 * Prod_{k=1}^{n-1} f(k).

First-order linear recurrences a_{n+1} = p a_n + q (p != 1) are solved by undetermined coefficient transformation a_{n+1} - lambda = p(a_n - lambda) with lambda = q / (1-p).

When given S_n relations, apply a_n = S_n - S_{n-1} for n >= 2, always verifying whether the initial term a_1 = S_1 conforms to the general pattern.

Recurrences involving variable additions like a_{n+1} = p a_n + k r^n can be linearized by dividing by r^{n+1} to create an auxiliary sequence.

Last updated: July 2026

7.3 Recurrence Relations and General Term Determination

Determining the general term a n a_n a n ​ from a recurrence relation is a central topic in Gaokao Mathematics. This section provides a comprehensive classification of standard recurrence structures and their exact resolution algorithms.

  • 1. Difference Accumulation Method (累加法)
  • Applicable Type
  • Recurrences of the form: a n + 1 − a n = f ( n ) a_{n+1} - a_n = f(n) a n + 1 ​ − a n ​ = f ( n )

where f ( n ) f(n) f ( n ) is a solvable explicit function of n n n (such as a polynomial, exponential, or rational expression whose sum ∑ f ( k ) \sum f(k) ∑ f ( k ) can be computed).

Algorithm

Write out the equations for successive indices up to n − 1 n-1 n − 1 : a 2 − a 1 & = f ( 1 ) a 3 − a 2 & = f ( 2 ) & ⋮ a n − a n − 1 & = f ( n − 1 ) \begin{aligned}

  • a_2 - a_1 \&= f(1) \\
  • a_3 - a_2 \&= f(2) \\
  • \&\vdots \\
  • a_n - a_{n-1} \&= f(n-1)
  • \end{aligned} a 2 ​ − a 1 ​ & = f ( 1 ) a 3 ​ − a 2 ​ & = f ( 2 ) & ⋮ a n ​ − a n − 1 ​ & = f ( n − 1 ) ​

Summing all n − 1 n-1 n − 1 equations produces a telescoping sum on the left: ( a n − a n − 1 ) + ⋯ + ( a 2 − a 1 ) = ∑ k = 1 n − 1 f ( k ) ⟹ a n = a 1 + ∑ k = 1 n − 1 f ( k ) ( n ≥ 2 ) (a_n - a_{n-1}) + \dots + (a_2 - a_1) = \sum_{k=1}^{n-1} f(k) \implies a_n = a_1 + \sum_{k=1}^{n-1} f(k) \quad (n \ge 2) ( a n ​ − a n − 1 ​ ) + ⋯ + ( a 2 ​ − a 1 ​ ) = k = 1 ∑ n − 1 ​ f ( k ) ⟹ a n ​ = a 1 ​ + k = 1 ∑ n − 1 ​ f ( k ) ( n ≥ 2 )

Mandatory Check : Always verify whether the derived formula holds for n = 1 n=1 n = 1 .

  • 2. Product Accumulation Method (累乘法)
  • Applicable Type

Recurrences of the form: a n + 1 a n = f ( n ) ( a n ≠ 0 , f ( n ) ≠ 0 ) \frac{a_{n+1}}{a_n} = f(n) \quad (a_n \neq 0, f(n) \neq 0) a n ​ a n + 1 ​ ​ = f ( n ) ( a n ​  = 0 , f ( n )  = 0 )

where the product ∏ k = 1 n − 1 f ( k ) \prod_{k=1}^{n-1} f(k) ∏ k = 1 n − 1 ​ f ( k ) simplifies via cancellation or known multiplicative formulas.

Algorithm

Write out successive ratios for k = 1 , 2 , … , n − 1 k=1, 2, \dots, n-1 k = 1 , 2 , … , n − 1 : a 2 a 1 = f ( 1 ) , a 3 a 2 = f ( 2 ) , … , a n a n − 1 = f ( n − 1 ) \frac{a_2}{a_1} = f(1), \quad \frac{a_3}{a_2} = f(2), \quad \dots, \quad \frac{a_n}{a_{n-1}} = f(n-1) a 1 ​ a 2 ​ ​ = f ( 1 ) , a 2 ​ a 3 ​ ​ = f ( 2 ) , … , a n − 1 ​ a n ​ ​ = f ( n − 1 )

Multiplying all n − 1 n-1 n − 1 ratios together yields: a n a 1 = ∏ k = 1 n − 1 f ( k ) ⟹ a n = a 1 ⋅ ∏ k = 1 n − 1 f ( k ) ( n ≥ 2 ) \frac{a_n}{a_1} = \prod_{k=1}^{n-1} f(k) \implies a_n = a_1 \cdot \prod_{k=1}^{n-1} f(k) \quad (n \ge 2) a 1 ​ a n ​ ​ = k = 1 ∏ n − 1 ​ f ( k ) ⟹ a n ​ = a 1 ​ ⋅ k = 1 ∏ n − 1 ​ f ( k ) ( n ≥ 2 )

3. First-Order Linear Recurrence a n + 1 = p a n + q a_{n+1} = p a_n + q a n + 1 ​ = p a n ​ + q (待定系数构造法)

When p = 1 p = 1 p = 1 , the relation reduces to a n + 1 − a n = q a_{n+1} - a_n = q a n + 1 ​ − a n ​ = q (arithmetic sequence). When q = 0 q = 0 q = 0 , it reduces to a n + 1 = p a n a_{n+1} = p a_n a n + 1 ​ = p a n ​ (geometric sequence). When p ≠ 1 p \neq 1 p  = 1 and q ≠ 0 q \neq 0 q  = 0 , we construct an auxiliary geometric sequence.

Undetermined Coefficient Transformation

Assume the recurrence can be written in the form: a n + 1 − λ = p ( a n − λ ) a_{n+1} - \lambda = p(a_n - \lambda) a n + 1 ​ − λ = p ( a n ​ − λ )

Expanding this equation: a n + 1 = p a n + λ ( 1 − p ) a_{n+1} = p a_n + \lambda(1 - p) a n + 1 ​ = p a n ​ + λ ( 1 − p ) . Comparing coefficients with a n + 1 = p a n + q a_{n+1} = p a_n + q a n + 1 ​ = p a n ​ + q yields: λ ( 1 − p ) = q ⟹ λ = q 1 − p \lambda(1 - p) = q \implies \lambda = \frac{q}{1 - p} λ ( 1 − p ) = q ⟹ λ = 1 − p q ​

Define the auxiliary sequence b n = a n − λ b_n = a_n - \lambda b n ​ = a n ​ − λ . Then b 1 = a 1 − λ b_1 = a_1 - \lambda b 1 ​ = a 1 ​ − λ , and b n + 1 = p b n b_{n+1} = p b_n b n + 1 ​ = p b n ​ . Thus, ( b n ) (b_n) ( b n ​ ) is a geometric sequence with initial term b 1 b_1 b 1 ​ and common ratio p p p : b n = b 1 ⋅ p n − 1 = ( a 1 − λ ) p n − 1 b_n = b_1 \cdot p^{n-1} = (a_1 - \lambda) p^{n-1} b n ​ = b 1 ​ ⋅ p n − 1 = ( a 1 ​ − λ ) p n − 1

Substituting back a n = b n + λ a_n = b_n + \lambda a n ​ = b n ​ + λ gives the general term: a n = ( a 1 − λ ) p n − 1 + λ = ( a 1 − q 1 − p ) p n − 1 + q 1 − p a_n = (a_1 - \lambda) p^{n-1} + \lambda = \left(a_1 - \frac{q}{1-p}\right) p^{n-1} + \frac{q}{1-p} a n ​ = ( a 1 ​ − λ ) p n − 1 + λ = ( a 1 ​ − 1 − p q ​ ) p n − 1 + 1 − p q ​

4. Higher Recurrence Structures: a n + 1 = p a n + f ( n ) a_{n+1} = p a_n + f(n) a n + 1 ​ = p a n ​ + f ( n )

Function Type f ( n ) f(n) f ( n ) Auxiliary Transformation Strategy Resulting Auxiliary Sequence

f ( n ) = k r n f(n) = k r^n f ( n ) = k r n ( r ≠ p r \neq p r  = p ) Divide both sides by r n + 1 r^{n+1} r n + 1 : a n + 1 r n + 1 = p r a n r n + k r \frac{a_{n+1}}{r^{n+1}} = \frac{p}{r} \frac{a_n}{r^n} + \frac{k}{r} r n + 1 a n + 1 ​ ​ = r p ​ r n a n ​ ​ + r k ​ Let b n = a n r n b_n = \frac{a_n}{r^n} b n ​ = r n a n ​ ​ , reducing to b n + 1 = p ′ b n + q ′ b_{n+1} = p' b_n + q' b n + 1 ​ = p ′ b n ​ + q ′

f ( n ) = k p n f(n) = k p^n f ( n ) = k p n ( r = p r = p r = p ) Divide both sides by p n + 1 p^{n+1} p n + 1 : a n + 1 p n + 1 = a n p n + k p \frac{a_{n+1}}{p^{n+1}} = \frac{a_n}{p^n} + \frac{k}{p} p n + 1 a n + 1 ​ ​ = p n a n ​ ​ + p k ​ Let b n = a n p n b_n = \frac{a_n}{p^n} b n ​ = p n a n ​ ​ , giving AP b n + 1 − b n = k p b_{n+1} - b_n = \frac{k}{p} b n + 1 ​ − b n ​ = p k ​

f ( n ) = A n + B f(n) = A n + B f ( n ) = A n + B Construct a n + 1 + X ( n + 1 ) + Y = p ( a n + X n + Y ) a_{n+1} + X(n+1) + Y = p(a_n + Xn + Y) a n + 1 ​ + X ( n + 1 ) + Y = p ( a n ​ + X n + Y ) Match coefficients to solve for X X X and Y Y Y

5. Sequence Determination via S n S_n S n ​ and a n a_n a n ​ Relations

In many Gaokao problems, the defining condition involves both S n S_n S n ​ and a n a_n a n ​ .

Fundamental Bridge a n = { S 1 , & n = 1 S n − S n − 1 , & n ≥ 2 a_n = \begin{cases} S_1, \& n = 1 \\ S_n - S_{n-1}, \& n \ge 2 \end{cases} a n ​ = { S 1 ​ , & n = 1 S n ​ − S n − 1 ​ , & n ≥ 2 ​

Core Resolution Pathways:

Eliminate S n S_n S n ​ to find a n a_n a n ​ relation :

Write the relation for index n n n : f ( S n , a n ) = 0 f(S_n, a_n) = 0 f ( S n ​ , a n ​ ) = 0 .

Write the relation for index n − 1 n-1 n − 1 ( n ≥ 2 n \ge 2 n ≥ 2 ): f ( S n − 1 , a n − 1 ) = 0 f(S_{n-1}, a_{n-1}) = 0 f ( S n − 1 ​ , a n − 1 ​ ) = 0 .

Subtract the two equations and substitute S n − S n − 1 = a n S_n - S_{n-1} = a_n S n ​ − S n − 1 ​ = a n ​ to obtain a pure recurrence relation in a n a_n a n ​ .

Eliminate a n a_n a n ​ to find S n S_n S n ​ relation :

Substitute a n = S n − S n − 1 a_n = S_n - S_{n-1} a n ​ = S n ​ − S n − 1 ​ ( n ≥ 2 n \ge 2 n ≥ 2 ) directly into the given equation to obtain a recurrence relation in S n S_n S n ​ , find S n S_n S n ​ , and then recover a n = S n − S n − 1 a_n = S_n - S_{n-1} a n ​ = S n ​ − S n − 1 ​ .

Loading diagram... Recurrence Relation Solution Taxonomy

  • Worked Gaokao Exam Examples
  • Example 1 (Undetermined Coefficients for a n + 1 = p a n + q a_{n+1} = p a_n + q a n + 1 ​ = p a n ​ + q )

Problem : A sequence ( a n ) (a_n) ( a n ​ ) satisfies a 1 = 2 a_1 = 2 a 1 ​ = 2 and a n + 1 = 3 a n − 2 a_{n+1} = 3 a_n - 2 a n + 1 ​ = 3 a n ​ − 2 for all n ≥ 1 n \ge 1 n ≥ 1 .

Show that ( a n − 1 ) (a_n - 1) ( a n ​ − 1 ) is a geometric sequence and state its common ratio.

Find the general term formula a n a_n a n ​ .

Solution :

We construct λ \lambda λ such that a n + 1 − λ = 3 ( a n − λ ) a_{n+1} - \lambda = 3(a_n - \lambda) a n + 1 ​ − λ = 3 ( a n ​ − λ ) .

Expanding gives a n + 1 = 3 a n − 2 λ a_{n+1} = 3a_n - 2\lambda a n + 1 ​ = 3 a n ​ − 2 λ . Comparing with a n + 1 = 3 a n − 2 a_{n+1} = 3a_n - 2 a n + 1 ​ = 3 a n ​ − 2 : − 2 λ = − 2 ⟹ λ = 1 -2\lambda = -2 \implies \lambda = 1 − 2 λ = − 2 ⟹ λ = 1

Thus, a n + 1 − 1 = 3 ( a n − 1 ) a_{n+1} - 1 = 3(a_n - 1) a n + 1 ​ − 1 = 3 ( a n ​ − 1 ) for all n ≥ 1 n \ge 1 n ≥ 1 .

Calculate the initial term of ( a n − 1 ) (a_n - 1) ( a n ​ − 1 ) : b 1 = a 1 − 1 = 2 − 1 = 1 b_1 = a_1 - 1 = 2 - 1 = 1 b 1 ​ = a 1 ​ − 1 = 2 − 1 = 1

Since a n + 1 − 1 a n − 1 = 3 \frac{a_{n+1} - 1}{a_n - 1} = 3 a n ​ − 1 a n + 1 ​ − 1 ​ = 3 is a constant ratio, ( a n − 1 ) (a_n - 1) ( a n ​ − 1 ) is a geometric sequence with initial term 1 1 1 and common ratio q = 3 q = 3 q = 3 .

The general term of the auxiliary sequence is: a n − 1 = 1 ⋅ 3 n − 1 = 3 n − 1 a_n - 1 = 1 \cdot 3^{n-1} = 3^{n-1} a n ​ − 1 = 1 ⋅ 3 n − 1 = 3 n − 1

  • Adding 1 gives the general term a n a_n a n ​ : a n = 3 n − 1 + 1 a_n = 3^{n-1} + 1 a n ​ = 3 n − 1 + 1
  • Example 2 (General Term from S n S_n S n ​ Recurrence Relation)

Problem : Let ( a n ) (a_n) ( a n ​ ) be a sequence with partial sum S n S_n S n ​ satisfying S n = 2 a n − 2 S_n = 2 a_n - 2 S n ​ = 2 a n ​ − 2 for all n ≥ 1 n \ge 1 n ≥ 1 .

Find a 1 a_1 a 1 ​ and a 2 a_2 a 2 ​ .

Determine the general term formula a n a_n a n ​ .

Solution :

For n = 1 n = 1 n = 1 , S 1 = a 1 S_1 = a_1 S 1 ​ = a 1 ​ , so: a 1 = 2 a 1 − 2 ⟹ a 1 = 2 a_1 = 2a_1 - 2 \implies a_1 = 2 a 1 ​ = 2 a 1 ​ − 2 ⟹ a 1 ​ = 2

For n = 2 n = 2 n = 2 , S 2 = a 1 + a 2 = 2 + a 2 S_2 = a_1 + a_2 = 2 + a_2 S 2 ​ = a 1 ​ + a 2 ​ = 2 + a 2 ​ . Using S 2 = 2 a 2 − 2 S_2 = 2a_2 - 2 S 2 ​ = 2 a 2 ​ − 2 : 2 + a 2 = 2 a 2 − 2 ⟹ a 2 = 4 2 + a_2 = 2a_2 - 2 \implies a_2 = 4 2 + a 2 ​ = 2 a 2 ​ − 2 ⟹ a 2 ​ = 4

For n ≥ 2 n \ge 2 n ≥ 2 , we have: S n = 2 a n − 2 S_n = 2a_n - 2 S n ​ = 2 a n ​ − 2 S n − 1 = 2 a n − 1 − 2 S_{n-1} = 2a_{n-1} - 2 S n − 1 ​ = 2 a n − 1 ​ − 2

Subtracting the second equation from the first: S n − S n − 1 = 2 a n − 2 a n − 1 S_n - S_{n-1} = 2a_n - 2a_{n-1} S n ​ − S n − 1 ​ = 2 a n ​ − 2 a n − 1 ​

Since S n − S n − 1 = a n S_n - S_{n-1} = a_n S n ​ − S n − 1 ​ = a n ​ for n ≥ 2 n \ge 2 n ≥ 2 : a n = 2 a n − 2 a n − 1 ⟹ a n = 2 a n − 1 ( n ≥ 2 ) a_n = 2a_n - 2a_{n-1} \implies a_n = 2a_{n-1} \quad (n \ge 2) a n ​ = 2 a n ​ − 2 a n − 1 ​ ⟹ a n ​ = 2 a n − 1 ​ ( n ≥ 2 )

Thus, ( a n ) (a_n) ( a n ​ ) is a geometric sequence with first term a 1 = 2 a_1 = 2 a 1 ​ = 2 and common ratio q = 2 q = 2 q = 2 .

The general term formula is: a n = 2 ⋅ 2 n − 1 = 2 n a_n = 2 \cdot 2^{n-1} = 2^n a n ​ = 2 ⋅ 2 n − 1 = 2 n