This is a beta course, so its structure, chapters, and examples may continue to change.
The Grouping Summation Method
The grouping summation method is the most direct method for handling composite sequences. When the general term of a sequence can be decomposed into the sum of several simple sequences, we can sum each group separately and then add the results.
Decompose the general term an of a sequence into the sum of several simple sequences an=bn+cn+⋯, sum each group separately, and then add them:
Sn=∑an=∑bn+∑cn+⋯
Core idea: break the whole into parts and conquer each one.
Applicable Scenarios
The grouping summation method applies to the following cases:
Arithmetic + geometric: an=(an+b)+cqn
Polynomial + exponential: an=n2+2n
Piecewise definitions: odd-indexed and even-indexed terms follow different rules
Judgment criterion: if the general term can be clearly divided into several parts, each part being a known type of sequence (arithmetic, geometric, constant, etc.), then the grouping summation method can be used.
Worked Examples
Example 1: Arithmetic + Geometric
Find the sum: Sn=(1+2)+(2+4)+(3+8)+⋯+(n+2n)
Solution:
Split the sequence into two groups:
Sn=(1+2+3+⋯+n)+(2+4+8+⋯+2n)
The first group is an arithmetic sequence and the second is a geometric sequence:
Sn=2n(n+1)+2−12(2n−1)=2n(n+1)+2n+1−2
Example 2: Polynomial + Exponential
Find the sum: Sn=(1+31)+(4+32)+(9+33)+⋯+(n2+3n)
Solution:
Grouping:
Sn=(1+4+9+⋯+n2)+(3+32+33+⋯+3n)
The first group is a sum of squares and the second is a geometric sequence:
The sequence {an} satisfies: the odd-indexed terms form the arithmetic sequence 1,3,5,…, and the even-indexed terms form the geometric sequence 2,4,8,…. Find the sum of the first 2n terms.