Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Geometric Sequences






Constant Ratio

A geometric sequence multiplies each term by the same fixed factor to produce the next. That factor — the common ratio — controls whether the sequence grows, decays, oscillates, or converges. Geometric sequences appear wherever quantities scale by a constant proportion, and their series formulas include one of the few cases where an infinite sum has a finite closed form.



Definition

A geometric sequence is a sequence in which consecutive terms have a constant ratio rr:

an+1an=rfor all n\frac{a_{n+1}}{a_n} = r \quad \text{for all } n


Starting from a first term a10a_1 \neq 0, the sequence unfolds as a1,a1r,a1r2,a1r3,a_1, a_1 r, a_1 r^2, a_1 r^3, \ldots. The general term is:

an=a1rn1a_n = a_1 \cdot r^{n-1}


The ratio rr determines the sequence's character. When r>1r > 1, the terms grow without bound: 2,6,18,54,2, 6, 18, 54, \ldots with r=3r = 3. When 0<r<10 < r < 1, the terms decay toward zero: 81,27,9,3,1,81, 27, 9, 3, 1, \ldots with r=13r = \frac{1}{3}. When r<0r < 0, the terms alternate in sign: 4,8,16,32,4, -8, 16, -32, \ldots with r=2r = -2.

The case r=1r = 1 produces a constant sequence — every term equals a1a_1. The case r=0r = 0 is excluded because every term after the first would be zero, and the ratio an+1an\frac{a_{n+1}}{a_n} would be undefined.

Where an arithmetic sequence is linear — its terms lie on a straight line when plotted against their indices — a geometric sequence is exponential. The general term a1rn1a_1 \cdot r^{n-1} is an exponential function of nn.

Identifying Geometric Sequences

To test whether a sequence is geometric, compute the ratio of consecutive terms. If every ratio equals the same value, the sequence is geometric and that value is rr.

The sequence 5,15,45,1355, 15, 45, 135 has ratios 3,3,33, 3, 3. All equal, so it is geometric with r=3r = 3.

The sequence 12,6,3,1.512, 6, 3, 1.5 has ratios 0.5,0.5,0.50.5, 0.5, 0.5. Geometric with r=12r = \frac{1}{2}.

The sequence 1,2,4,71, 2, 4, 7 has ratios 2,2,1.752, 2, 1.75. The final ratio differs, so the sequence is not geometric.

A constant sequence like 5,5,5,55, 5, 5, 5 is both arithmetic (with d=0d = 0) and geometric (with r=1r = 1). This is the only type of sequence that belongs to both families.

As with arithmetic sequences, a finite sample cannot confirm a geometric pattern with certainty. The sequence 2,4,82, 4, 8 could continue as 16,32,16, 32, \ldots (geometric with r=2r = 2) or as 14,22,14, 22, \ldots (not geometric). The defining rule, not the sample, is what settles the classification.

Finding Terms

The explicit formula an=a1rn1a_n = a_1 \cdot r^{n-1} contains four quantities. Given any three, the fourth can be found.

Finding a specific term: if a1=3a_1 = 3 and r=2r = 2, then a10=329=1536a_{10} = 3 \cdot 2^9 = 1536.

Finding the common ratio: if a1=5a_1 = 5 and a4=40a_4 = 40, then 40=5r340 = 5 \cdot r^3, so r3=8r^3 = 8 and r=2r = 2.

Finding the first term: if a6=96a_6 = 96 and r=2r = 2, then 96=a12596 = a_1 \cdot 2^5, so a1=3a_1 = 3.

Finding the position of a term: if a1=4a_1 = 4, r=3r = 3, and some term equals 29162916, then 2916=43n12916 = 4 \cdot 3^{n-1}, so 3n1=729=363^{n-1} = 729 = 3^6 and n=7n = 7. When the arithmetic does not produce a clean power, solving for nn requires logarithms: n1=ln(an/a1)lnrn - 1 = \frac{\ln(a_n / a_1)}{\ln r}.

When two non-consecutive terms are given — say a2=6a_2 = 6 and a5=162a_5 = 162 — write both in terms of a1a_1 and rr: a1r=6a_1 r = 6 and a1r4=162a_1 r^4 = 162. Dividing gives r3=27r^3 = 27, so r=3r = 3, and back-substituting gives a1=2a_1 = 2.

Recursive Formula

The recursive definition of a geometric sequence specifies a starting value and a multiplicative rule:

a1=c,an=ran1a_1 = c, \quad a_n = r \cdot a_{n-1}


Each term is produced by multiplying the preceding term by rr. This makes the constant-ratio structure explicit but requires computing all earlier terms to reach a later one.

Converting between forms works the same way as for arithmetic sequences. Applying the recursive rule n1n - 1 times gives an=crn1a_n = c \cdot r^{n-1}, recovering the explicit formula. In the other direction, dividing an=a1rn1a_n = a_1 r^{n-1} by an1=a1rn2a_{n-1} = a_1 r^{n-2} yields anan1=r\frac{a_n}{a_{n-1}} = r, which gives the recursive rule an=ran1a_n = r \cdot a_{n-1}.

Both representations define the same sequence. The explicit form is better for computing isolated terms; the recursive form emphasizes the multiplicative process and connects to models where each step scales the previous state by a fixed factor.

Finite Geometric Series

The sum of the first nn terms of a geometric sequence is:

Sn=a1+a1r+a1r2++a1rn1S_n = a_1 + a_1 r + a_1 r^2 + \cdots + a_1 r^{n-1}


The closed form is:

Sn=a11rn1r(r1)S_n = a_1 \cdot \frac{1 - r^n}{1 - r} \quad (r \neq 1)


The derivation uses a telescoping trick. Multiply SnS_n by rr:

rSn=a1r+a1r2++a1rnrS_n = a_1 r + a_1 r^2 + \cdots + a_1 r^n


Subtract from the original sum:

SnrSn=a1a1rnS_n - rS_n = a_1 - a_1 r^n


Factor:

Sn(1r)=a1(1rn)S_n(1 - r) = a_1(1 - r^n)


Divide by 1r1 - r to isolate SnS_n. When r=1r = 1, every term equals a1a_1 and Sn=na1S_n = na_1.

For example, the sum 1+2+4+8++291 + 2 + 4 + 8 + \cdots + 2^9 has a1=1a_1 = 1, r=2r = 2, and n=10n = 10:

S10=1121012=110241=1023S_{10} = 1 \cdot \frac{1 - 2^{10}}{1 - 2} = \frac{1 - 1024}{-1} = 1023

Infinite Geometric Series

When r<1|r| < 1, the terms of a geometric sequence shrink toward zero, and the partial sums SnS_n approach a finite limit as nn \to \infty. Since rn0r^n \to 0, the finite sum formula Sn=a11rn1rS_n = a_1 \cdot \frac{1 - r^n}{1 - r} simplifies to:

S=a11r(r<1)S = \frac{a_1}{1 - r} \quad (|r| < 1)


The series 12+14+18+\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \cdots has a1=12a_1 = \frac{1}{2} and r=12r = \frac{1}{2}, so S=1/211/2=1S = \frac{1/2}{1 - 1/2} = 1. Adding half of the remaining distance at each step eventually fills the full unit.

Repeating decimals provide another illustration. The decimal 0.333=310+3100+31000+0.333\ldots = \frac{3}{10} + \frac{3}{100} + \frac{3}{1000} + \cdots is a geometric series with a1=310a_1 = \frac{3}{10} and r=110r = \frac{1}{10}, summing to 3/109/10=13\frac{3/10}{9/10} = \frac{1}{3}.

When r1|r| \geq 1, the terms do not diminish (or grow in magnitude), and the partial sums grow without bound. The series diverges and no finite sum exists. The boundary case r=1r = -1 produces partial sums that oscillate between a1a_1 and 00 without settling — this too is divergent.

Geometric Mean

The geometric mean of two positive numbers aa and bb is:

G=abG = \sqrt{ab}


In a geometric sequence with positive terms, every term is the geometric mean of its two neighbors:

an=an1an+1a_n = \sqrt{a_{n-1} \cdot a_{n+1}}


This follows from the constant-ratio property: an1=anra_{n-1} = \frac{a_n}{r} and an+1=anra_{n+1} = a_n r, so an1an+1=an2a_{n-1} \cdot a_{n+1} = a_n^2.

Inserting geometric means between two positive values aa and bb requires placing kk terms so that the resulting k+2k + 2 values form a geometric sequence. The common ratio must be r=(ba)1/(k+1)r = \left(\frac{b}{a}\right)^{1/(k+1)}, and the inserted terms are ar,ar2,,arkar, ar^2, \ldots, ar^k.

The AM–GM inequality states that for any set of positive numbers, the geometric mean never exceeds the arithmetic mean:

GAG \leq A


Equality holds only when all values are identical. This inequality extends to include the harmonic mean: HGAH \leq G \leq A.