Definition · Geometric sequenceA sequence with a first term a₁ and a constant multiplier r, called the common ratio, such that aₙ = r·aₙ₋₁ for n ≥ 2. Equivalently, aₙ = a₁rⁿ⁻¹. When consecutive terms in the denominator are nonzero, dividing aₙ₊₁/aₙ is the quickest way to find and check r; the multiplicative definition still makes sense when a term or r is zero.
3, 6, 12, 24, … has r = 2. 81, 27, 9, 3, … has r = 1/3 and shrinks. 5, -10, 20, -40, … has r = -2, and a negative ratio is how a sequence alternates in sign: odd-numbered terms keep the sign of a₁ and even-numbered ones flip it. 7, 0, 0, … has r = 0; after the first step the quotient 0/0 is unavailable, but every term still equals zero times the one before it.
Theorem · The n-th term of a geometric sequenceaₙ = a₁rⁿ⁻¹ for every n ≥ 1. Getting from a₁ to aₙ is n - 1 multiplications by r, exactly as getting there in an arithmetic sequence was n - 1 additions of d.
For r > 0, the plotted terms lie on an exponential curve: a₁rⁿ⁻¹ is Exponential and Logarithmic Functions's a·bˣ sampled at the integers. For r < 0, no real exponential curve has that negative base; the magnitudes follow |a₁||r|ⁿ⁻¹ while the signs alternate. |r| > 1 grows in magnitude, 0 < |r| < 1 decays in magnitude, r = 1 is constant, and r = 0 becomes zero after the first term.
Definition · Geometric seriesThe sum of the terms of a geometric sequence. Sₙ denotes the sum of the first n terms, a₁ + a₁r + … + a₁rⁿ⁻¹.
Theorem · The sum of n termsFor r ≠ 1, Sₙ = a₁(1 - rⁿ)/(1 - r). For r = 1 every term equals a₁ and Sₙ = na₁.
Write Sₙ = a₁ + a₁r + a₁r² + … + a₁rⁿ⁻¹, and multiply the whole line by r: rSₙ = a₁r + a₁r² + … + a₁rⁿ⁻¹ + a₁rⁿ.
Subtract the second line from the first. Every term of rSₙ also appears in Sₙ except the last, and every term of Sₙ appears in rSₙ except the first, so all but two cancel: Sₙ - rSₙ = a₁ - a₁rⁿ.
Factor both sides: Sₙ(1 - r) = a₁(1 - rⁿ). Dividing by 1 - r requires r ≠ 1, which is precisely the case the theorem handles separately, and there the sum is na₁ by inspection.
□
Two edge cases are checks on the derivation rather than exceptions to the sequence. If r = 0, the formula gives Sₙ = a₁(1 - 0ⁿ)/(1 - 0) = a₁, matching a₁ + 0 + … + 0. If r = 1, the line Sₙ(1 - r) = a₁(1 - rⁿ) reduces to 0 = 0 and contains no sum information, so direct counting supplies Sₙ = na₁. Whether a sequence of finite sums approaches a number as n grows is a different question, taken up after partial sums have been made into a sequence of their own.