Geometric Series Generalizer

Math Calculus • Infinite Series and Sequences

Written by STEM Calculators Team Published December 30, 2025 Updated February 24, 2026

8. Geometric Series Generalizer

Handles generalized geometric series \( \sum a\,r^n \) and power-series form \( \sum (r x)^n \). Computes finite partial sums and infinite sums (when \(|q|<1\)), with a zoomable, pannable plot and a “how many terms for \( \varepsilon \)” helper.

Inputs

Mode

In power mode, the effective ratio is \(q=r x\).

Compute

Infinite sum requires \(|q|<1\).

Start index \(n_0\)

Coefficient \(a\)

Supports expressions like 2, pi, 1/3.

Ratio \(r\)

Numeric ratio; in power mode \(q=r x\).

Number of terms \(N\) (finite sum)

Computes \(S_N=\sum_{n=n_0}^{n_0+N-1} a\,q^n\) where \(q=r\) or \(q=r x\).

Plot points

How many partial sums to draw (≤ 500).

Target \( \varepsilon \) (optional)

For \(|q|<1\), finds smallest \(N\le N_{\max}\) so the tail bound ≤ \(\varepsilon\).

Search cap \(N_{\max}\)

Options

Show steps Sample table Auto-solve

Presets

Click a preset to load & compute.

Ready

Graph

Drag to pan • wheel/pinch to zoom. Plots partial sums \(S_k\) vs index \(k\). Optional “stacking” shading shows increments between consecutive partial sums.

Graph options

Plot \(S_k\) Plot terms \(t_n\) Shade stacking Show \(S_\infty\) Legend Auto-fit after solve

x: 0, y: 0, zoom(px/unit): 60

Results & steps

Click Fill example or enter values and press Calculate.

Rate this calculator

0.0 /5 (0 ratings)

Be the first to rate.

Your rating

Name (optional) Review (optional)

You can update your rating any time.

Theory: Geometric Series Generalizer

1) What is a geometric series?

A geometric series has a constant ratio between consecutive terms. A standard form is \[ \sum_{n=n_0}^{\infty} a\,r^n, \] where \(a\) is a coefficient and \(r\) is the ratio.

If you shift the start index \(n_0\), the first term is \(t_{n_0}=a\,r^{n_0}\).

2) Finite geometric sum

The finite sum of \(N\) terms starting at \(n_0\) is \[ S_N=\sum_{n=n_0}^{n_0+N-1} a\,r^n. \]

If \(r\neq 1\), factor out the first term \(t_{n_0}=a r^{n_0}\): \[ S_N=t_{n_0}\bigl(1+r+r^2+\cdots+r^{N-1}\bigr) =t_{n_0}\,\frac{1-r^N}{1-r}. \]

If \(r=1\), every term equals \(a\), so \[ S_N=aN. \]

3) Infinite geometric sum and convergence

The infinite geometric series \[ \sum_{n=n_0}^{\infty} a\,r^n \] converges only if \(|r|<1\) (or trivially if \(a=0\)).

When \(|r|<1\), the sum is \[ S_\infty=\frac{a\,r^{n_0}}{1-r}. \]

If \(|r|\ge 1\) and \(a\neq 0\), then the terms do not go to 0, so the series diverges.

4) The classic “\(S = 1 + rS\)” idea

For the simplest case \(\sum_{n=0}^{\infty} r^n\), write \[ S=1+r+r^2+r^3+\cdots. \] Multiply by \(r\): \[ rS=r+r^2+r^3+\cdots. \] Subtract: \[ S-rS=1 \quad\Rightarrow\quad S(1-r)=1 \quad\Rightarrow\quad S=\frac{1}{1-r}. \]

The generalized form just replaces \(1\) with the first term \(t_{n_0}=a r^{n_0}\).

5) Error / remainder after \(N\) terms (when \(|r|<1\))

When \(|r|<1\), the remainder after the first \(N\) terms is \[ R_N = S_\infty - S_N = \frac{a\,r^{n_0+N}}{1-r}. \]

A safe bound on the magnitude is \[ |R_N| \le \frac{|a|\,|r|^{n_0+N}}{1-|r|}. \] This is what the “how many terms for \(\varepsilon\)” helper uses.

6) Power-series form \(\sum (r x)^n\)

A common power-series geometric form is \[ \sum_{n=0}^{\infty} (r x)^n = \frac{1}{1-rx}, \] provided \(|rx|<1\).

If \(r\neq 0\), the convergence region in \(x\) is \[ |x| < \frac{1}{|r|}. \]

7) Beyond geometric (advanced)

More advanced series like arithmetico-geometric series (e.g., \(\sum n r^n\)) and generating functions build on geometric sums by differentiating/integrating the geometric identity with respect to \(r\) or \(x\).

Frequently Asked Questions

What does this geometric series generalizer calculate?

It calculates finite and infinite sums for geometric-type series using an effective ratio q. In numeric mode q=r, and in power mode q=r x at the chosen x.

When does the infinite geometric series converge?

The infinite sum exists only when |q|<1. If |q|>=1 and a is not 0, the terms do not approach 0 and the series diverges.

What is the finite sum formula used by the calculator?

For q not equal to 1, S_N = a q^n0 (1 - q^N) / (1 - q). For q=1, every term is a and S_N = a N.

How does the epsilon term-count helper work?

When |q|<1, it uses a tail bound based on the remainder after N terms to find the smallest N (up to N_max) that makes the bound less than or equal to epsilon. This provides a guaranteed tolerance target for the geometric tail under the convergence condition.

Rate this calculator

Frequently Asked Questions

Related calculators