Unit 7 of 12 · Sequences and series
Sum a finite geometric progression
Choose a finite-sum formula and keep the first term and term count consistent.
Model the doubling reward on a chessboard
The source introduces geometric series through a legend about the inventor of chess and an emperor of India. Offered a reward, the inventor asks for 1 grain on the first square, 2 on the next, 4 on the next, 8 on the next, then doubling across all 64 squares.
The emperor agrees because the request sounds small; in the story, the treasurer returns after a week reporting a quantity beyond centuries of rice production.
These are the source’s story details, not measured production data.
The mathematical model has a=1,r=2 and 64 terms:
Applying the finite formula derived next gives grains. This exact integer is an authored answer to the source’s question; the source itself introduces the general derivation without printing the integer. The 64th square contains grains; the total uses , so these are different quantities.
Derive the finite geometric-sum formula
Adding the terms gives a geometric series, whose first-n-term sum is . Multiply that sum by r so the shared middle terms line up:
The explicit lists illustrate a sufficiently long sum; include each actual term once when n is small. Subtracting (2) from (1) cancels the shared powers:
Subtracting in the opposite order gives the equivalent form
The source asks why we usually choose the second form for r>1 and the first for r<1. The respective denominator is positive, making signs easier to track.
Both forms are algebraically valid for any allowed r≠1, including negative ratios; their numerators and denominators change sign together.
At r=1 the series is constant and , so do not divide by zero.
The source’s GP convention still excludes zero terms and zero ratio.
Self-Practice 7 uses a=0.6,r=1.5,n=15. Its answer 524 is rounded:
to three significant figures. A finite sum is valid even though r>1; no convergence assumption is needed.
Apply and compare finite geometric sums
Example 24 takes finite partial sums of the infinite list . The source derives
Its strict threshold is
The least integer is 11; indeed and . This is a question about a finite partial sum, not a claim that the entire infinite series has a finite total.
Example 25 links each finite GP to sigma notation. Its six doubling terms have a=3,r=2:
Its nine halving terms have a=1/2,r=1/2:
Here j renames the source’s summation counter r to distinguish it from the common ratio. The source’s final comparison recommends the appropriate AP or GP formula when sigma notation describes one of those special series:
| Special series | Sum of the first n terms |
|---|---|
| Arithmetic | |
| Geometric | , |
First identify the term pattern and count; sigma notation alone does not decide which formula applies.
Try these examples
Open an example in chapter practice. Try it first, then read its solution. Use “Learn this step” to return to this unit.