Sum of the first n terms of a geometric progression
We write Sn for the sum of the first n terms of a geometric progression: Sn = b₁ + b₁q + b₁q² + ... + b₁q^(n−1). Multiplying both sides by q gives qS_n = b₁q + b₁q² + ... + b₁q^n. Subtracting the first equality from the second cancels almost all the terms, leaving qS_n − Sn = b₁q^n − b₁. For q ≠ 1 this gives Sn = b₁(1 − q^n) : (1 − q) = b₁(q^n − 1) : (q − 1). If q = 1, every term equals b₁, so Sn = b₁ · n. When bn is known, the sum can also be written Sn = (bn · q − b₁) : (q − 1).
In a knockout tournament with 32 players there are 16 matches in the first round, then 8, 4, 2 and 1. The total is 16 + 8 + 4 + 2 + 1 = 31 matches: the geometric sum 16 · (1 − (1/2)⁵) : (1 − 1/2) = 31.
A sports organiser builds a tournament schedule, a banker totals the payments on a loan, and a community organiser counts how many people a message reaches after several rounds.
Imagine you tell a piece of news to 2 people, each of them tells 2 new people, and so on for 5 rounds: write the number told in each round, add them and check with the formula.
“Group sums”: the class splits into three groups; each computes Sn for its own b₁, q, n; the results are then checked in a table.