This is a beta course, so its structure, chapters, and examples may continue to change.
The Type aₙ₊₁ = aₙ + f(n)
This type of recurrence relation is solved by the accumulation method (the summation method), making it a flexible type.
The Recurrence Relation
Mathematical formula
A formula is a symbolic expression of quantitative relations and structural patterns, and an essential tool for solving mathematical problems. Key formulas should be mastered and applied flexibly.
Accumulation-type recurrence relation
an+1=an+f(n)
Characteristic: each time a function f(n) of n is added.
Solution Method: The Accumulation Method
Starting from the recurrence relation, write out several equations:
Most terms on the left side cancel out, leaving only:
an−a1=∑k=1n−1f(k)
Mathematical formula
A formula is a symbolic expression of quantitative relations and structural patterns, and an essential tool for solving mathematical problems. Key formulas should be mastered and applied flexibly.
The general term formula
an=a1+k=1∑n−1f(k)
Core idea: eliminate the intermediate terms through accumulation, turning the recurrence relation into a summation problem.
Worked Examples
Example 1: f(n)=n
The sequence {an} satisfies a1=1 and an+1=an+n. Find the general term formula.
Solution:
an=a1+k=1∑n−1k=1+2(n−1)n=1+2n2−n=2n2−n+2
Example 2: f(n)=2n
The sequence {an} satisfies a1=1 and an+1=an+2n. Find the general term formula.
Solution:
an=a1+k=1∑n−12k=1+2−12(2n−1−1)=1+2n−2=2n−1
Example 3: f(n)=n(n+1)1
The sequence {an} satisfies a1=0 and an+1=an+n(n+1)1. Find the general term formula.
Solution:
Use partial fraction decomposition: n(n+1)1=n1−n+11