A legend tells of a ruler who offered a reward of rice on a chessboard: 1 grain on the first square, 2 on the second, 4 on the third, doubling every square. The ruler agreed, thinking it modest, but the total on all 64 squares is more than 18 quintillion grains, far more rice than has ever been grown. Adding a geometric sequence is a geometric SERIES, and because each term is a multiple of the last, these sums can explode (or, when the ratio is less than 1, settle down) in ways our intuition misjudges. Phone trees, the spread of a rumour, the total distance travelled by a bouncing ball and, later in this unit, the value of a savings plan are all geometric series.
Deriving the formula
Gauss's pairing trick relied on the first-plus-last symmetry of an arithmetic sequence, which a geometric sequence doesn't have: in , the pairs and are not equal. Instead, geometric series get summed with a shift-and-subtract trick. Write out . Now multiply every term by : . Multiplying by shifts every term one place along, so the two lists share almost every term. Subtracting cancels everything except the very first term of and the very last term of .
The two forms are the same fraction with the top and bottom both multiplied by . When , use so that everything stays positive; when , use . Notice the exponent is , the NUMBER of terms, not : the in the formula is the term just past the end of the sum. A quick check shows it works: , and the formula gives .
Finding n before you sum
In MCR3U, the exponent (the number of terms) is what usually needs the most care. Often a question shows the last term instead of telling you , as in . Find first by solving : gives , so . Then A shortcut skips entirely: since , the sum formula can be written using the last term directly.
| Series | a | r | n | Sum |
|---|---|---|---|---|
| 1 | 3 | 4 | ||
| 64 | 0.5 | 6 | ||
| 4 | −2 | 4 | ||
| 5 | 1 | 6 |
Applications and recognising a geometric series
A phone tree where each person calls 3 others reaches people in 6 levels. A ball dropped from 10 m that rebounds to 60% of its height travels 10 m down, then UP and DOWN each rebound height: By the time it hits the ground for the 5th time it has travelled m. The bracket is a geometric series with , , . The two traps are forgetting the factor of 2 (each rebound is travelled twice) and adding the initial drop into the doubled part.
- Consecutive terms have a common DIFFERENCE
- Derived by writing the sum forwards and backwards (pairing)
- Grows roughly like
- Consecutive terms have a common RATIO
- Derived by multiplying by and subtracting ()
- ,
- Explodes when ; levels off toward a limit when
- Confirm the terms share a common ratio: divide at least two consecutive pairs. Convert percentages to a ratio (a 60% rebound means ; a 5% increase means ).
- Identify as the first term actually being added. In a bounce problem the first rebound is , not the 10 m drop.
- Find , the number of terms. If only the last term is given, solve by matching bases, or use the last-term form of the formula.
- Choose the form of the formula that keeps the numbers positive, substitute, and keep full calculator precision until the final answer.
- Sanity check: for the sum should be larger than the last term (with it is just under double the last term, as in vs ); for the sum should be less than (for that ceiling is 12).