NOTACAL logo

Series Calculator

Series Calculator

Give us your feedback! Was this useful?

Introduction

A sequence is an ordered list of numbers, and a series is the sum of the terms of a sequence. Series are everywhere in mathematics: they approximate functions, model compound interest, describe wave forms, and decide whether an infinite sum settles to a finite value or grows without bound [lay].

The study of series blossomed with the calculus of the seventeenth and eighteenth centuries. Mathematicians such as Euler, the Bernoullis, and later Cauchy wrestled with infinite sums — some convergent, some dangerously divergent. The distinction matters: the geometric series 1 + 1/2 + 1/4 + ... converges to 2, while 1 + 1/2 + 1/3 + ... (the harmonic series) diverges to infinity despite its terms shrinking to zero.

This calculator handles four common series. Arithmetic series add a constant difference each step. Geometric series multiply by a constant ratio. The p-series sums 1/nᵖ and reveals a sharp convergence rule: it converges only when p > 1. Finally, the sum of squares Σk² has a neat closed form used in statistics and physics.

How to Use

Choose a Series Type: Arithmetic, Geometric, P-Series, or Sum of Squares.

Arithmetic example: first term a₁ = 2, difference d = 3, n = 10. The 10th term is 2 + 9·3 = 29. The sum is (10/2)·(2 + 29) = 5·31 = 155.

Geometric example: a₁ = 1, ratio r = 0.5, n = 10. The partial sum is (1 - 0.5¹⁰) / (1 - 0.5) ≈ 1.9980469, very close to the infinite limit of 2.

P-Series example: p = 2, n = 100. The partial sum of 1 + 1/4 + 1/9 + ... + 1/10000 ≈ 1.634984, approaching π²/6 ≈ 1.644934. The calculator also flags "Converges (p=2>1)". If you set p = 1 (the harmonic series), it flags "Diverges (p=1≤1)".

Sum of Squares example: n = 10 gives 1² + 2² + ... + 10² = 385.

Edge cases: a zero or negative n returns no result. The geometric ratio r = 1 gives a flat series whose sum is simply a₁·n. A p ≤ 0 in the p-series is rejected because the terms would not shrink.

How It's Calculated

Arithmetic series — the nth term and sum:

an=a1+(n1)da_n = a_1 + (n-1)d
[lay]
Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n)

Geometric series — the partial sum:

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

P-series partial sum:

Sn=k=1n1kpS_n = \sum_{k=1}^{n} \frac{1}{k^p}

Sum of squares (closed form):

k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}

Manual example: arithmetic with a₁ = 2, d = 3, n = 10. a₁₀ = 2 + 9·3 = 29. S₁₀ = 5·(2 + 29) = 155. The same formulas drive the geometric and p-series modes, with the convergence flag derived from the exponent p.

Series in Computing and Science

Series sit at the foundation of numerical computing. Every transcendental function evaluated by a processor is ultimately a sum of simple terms, because hardware can add and multiply but has no native sine or logarithm instruction. The partial sums this calculator produces are exactly the intermediate stages a chip runs internally, stopping when the next term falls below the rounding tolerance.

In numerical analysis, the rate at which a partial sum approaches its limit determines how many terms a program must sum. A rapidly converging series such as the exponential needs only a handful of terms for high accuracy, while a slowly converging series such as the harmonic neighbor demands thousands. Engineers choose algorithms based on this convergence behavior, often transforming a slow series into a fast one before computing.

Series also underlie the solution of differential equations. Power series methods assume a solution can be written as an infinite polynomial and then determine the coefficients term by term. This technique solves equations that have no closed-form answer, producing instead a series that can be summed to any desired accuracy. The same idea appears in perturbation methods across physics and engineering.

In probability and statistics, moment-generating functions and characteristic functions are expressed as series. Expected values, variances, and higher moments are extracted from the coefficients. The sum-of-squares closed form this calculator returns is a building block of variance computations used in every data analysis pipeline.

Fourier series, though a different family from the ones here, share the core idea of representing a complicated object as a sum of simple ones. Where Taylor series use powers of x, Fourier series use sines and cosines. Both reduce a hard function to a list of numbers a computer can store and manipulate, which is the essence of digital signal processing.

Understanding partial sums also clarifies the danger of divergent series in models. A simulation that inadvertently sums a divergent series will produce results that grow without bound, masking a modeling error as a numerical one. Checking convergence, as this calculator does for the p-series, is therefore a basic correctness step in scientific computing.

Choosing a Template

Picking the right template depends on the shape of your terms. Geometric and arithmetic sums have explicit closed forms, so use those whenever the pattern matches. Power and p-series describe the building blocks of more complicated series and are the ones most often tested for convergence, while the exponential template covers the most common infinite sum in applications.

Reference Values

Partial Sums of 1/n² (p = 2)

Terms nPartial Sum SₙDistance to π²/6
11.0000000.644934
51.4636110.181323
101.5497680.095167
501.6251330.019802
1001.6349840.009951
10001.6439350.001000
The p-series with p = 2 rises quickly at first, then creeps toward its limit π²/6 ≈ 1.644934. Even 1000 terms leave a small gap, illustrating slow convergence.

The table and chart show how a convergent series approaches its limit: most of the gain happens in the first few terms, and later terms contribute tiny corrections. This is typical of p-series with p just above 1.

More Worked Examples

To build intuition, here are additional partial-sum calculations you can reproduce with the calculator.

Example A — arithmetic series of the first ten integers: a₁ = 1, d = 1, n = 10. The 10th term is 10, and the sum is (10/2)(1 + 10) = 55, the famous triangular number T₁₀. The same formula gives Tₙ = n(n+1)/2, which is the sum of an arithmetic series whose difference is 1.

Example B — arithmetic with negative difference: a₁ = 100, d = -10, n = 11. The terms fall 10 each step: 100, 90, 80, ..., 0. The 11th term is 0 and the sum is (11/2)(100 + 0) = 550. Negative differences are handled identically; the sum simply decreases.

Example C — geometric decay in medicine: a drug retains 80% of its concentration each hour, modeled by a geometric series with a₁ = 1 and r = 0.8. The total exposure over the first 10 hours is (1 - 0.8¹⁰)/(1 - 0.8) ≈ (1 - 0.107)/0.2 ≈ 4.465 dose-hours. The infinite total is 1/(1 - 0.8) = 5, the long-run accumulation ceiling.

Example D — geometric growth of a population: a species doubles each generation (r = 2) starting from a₁ = 1 individual. After 10 generations the cumulative count is (1 - 2¹⁰)/(1 - 2) = 2¹⁰ - 1 = 1023. Here r > 1, so the partial sum grows rapidly and the infinite series diverges — biologically the population outruns any finite resource.

Example E — p-series with p = 3: summing 1 + 1/8 + 1/27 + ... converges to Apéry's constant ζ(3) ≈ 1.202056, a number that appears in quantum electrodynamics. The calculator flags p = 3 as convergent and approaches that limit as n grows, illustrating that larger p converge faster.

Example F — sum of cubes: the identity 1³ + 2³ + ... + n³ = (n(n+1)/2)² means the sum of cubes is the square of the corresponding triangular number. For n = 5 this is (15)² = 225, which you can verify by adding 1 + 8 + 27 + 64 + 125. This closed form shows how a cubic series collapses to a neat square.

Example G — alternating harmonic series: although this calculator does not have an alternating mode, it is worth noting that 1 - 1/2 + 1/3 - 1/4 + ... converges (to ln 2) while the plain harmonic series diverges. The signs are what tame the growth, a subtle point that partial sums alone reveal.

Example H — error of a partial sum: for a convergent series the gap between Sₙ and the limit shrinks as n increases. With the p = 2 series, S₁₀₀₀ misses π²/6 by only about 0.001, small enough for most engineering estimates. The convergence rate depends entirely on p.

Practical Tips

  • Remember the convergence test for p-series: p > 1 converges, p ≤ 1 diverges. The harmonic series (p = 1) is the classic borderline case that diverges.
  • For a geometric series, if |r| < 1 the infinite sum is a₁ / (1 - r); the partial sum formula approaches it as n grows.
  • Watch the geometric ratio r = 1, which the standard formula divides by zero for; the calculator switches to a₁·n in that case.
  • Use the sum-of-squares result for variance formulas in statistics, where Σ(xᵢ - x̄)² reduces to Σxᵢ² minus a correction term.
  • A negative common difference in an arithmetic series simply makes the terms decrease; the sum formula still works.
  • Compare a partial sum to the known limit when available (such as π²/6 for p = 2) to gauge how many terms you need.

Limitations

  • Finite n Only: The calculator shows partial sums for a fixed n. It does not sum to true infinity, though the p-series reports the convergence verdict.
  • P-Series Restriction: p must be positive so the terms actually shrink; p ≤ 0 is rejected as non-sensical for convergence study.
  • No Arbitrary Sequences: You cannot enter a custom recurrence; only the four built-in families are available.
  • Geometric Edge: At r = 1 the partial-sum formula is undefined, handled by a branch, but the infinite behavior for |r| ≥ 1 is not summarized.
  • Display Rounding: Results are rounded for display; for very large n the partial sum may lose low-order precision.
  • No Alternating Series: Alternating signs (such as the alternating harmonic series) are not a selectable mode.

Frequently Asked Questions

What is the difference between a sequence and a series?
A sequence is an ordered list of numbers, such as 1, 2, 3, 4. A series is the sum of those numbers, 1 + 2 + 3 + 4 = 10. The series collapses the list into a single total.
When does a p-series converge?
A p-series Σ1/nᵖ converges if and only if p > 1. For p = 2 it converges to π²/6; for p = 1 (the harmonic series) it diverges despite shrinking terms.
What is the sum of an infinite geometric series?
If the ratio satisfies |r| < 1, the infinite sum is a₁/(1 - r). For example 1 + 1/2 + 1/4 + ... sums to 2.
Why does the harmonic series diverge?
Even though its terms 1/n approach zero, they do not shrink fast enough. Grouping terms shows the partial sums exceed any bound, so the total grows without limit.
How do I find the nth term of an arithmetic sequence?
Use aₙ = a₁ + (n-1)d, where a₁ is the first term and d is the common difference. The series sum then averages the first and last terms and multiplies by n.
What is the formula for the sum of squares?
The sum 1² + 2² + ... + n² equals n(n+1)(2n+1)/6. For n = 10 this gives 385.
Can a series converge if its terms do not go to zero?
No. A necessary condition for convergence is that the terms approach zero. If they do not, the series must diverge.
What does 'partial sum' mean?
It is the sum of the first n terms of a series. Partial sums let you approximate an infinite series and watch it approach its limit.
Is the geometric series formula valid at r = 1?
No — the denominator 1 - r becomes zero. At r = 1 every term equals a₁, so the sum is simply a₁·n.
Where are series used in real life?
Series model compound interest, signal waves, probability distributions, and function approximations in engineering and physics. They are the backbone of mathematical analysis.

Real-World Applications and Extended Examples

Series are the language of approximation. Almost every function a computer evaluates — sine, cosine, logarithms, exponentials — is computed by summing a series of simple terms, because a processor can add and multiply but cannot natively take a sine. The Taylor and Fourier series (close cousins of what this calculator sums) turn complicated curves into lists of numbers a machine can handle.

Extended example 1 — compound interest as a geometric series: investing a fixed amount P each year at interest rate r gives, after n years, P(1 + (1+r) + (1+r)² + ... + (1+r)ⁿ⁻¹), a geometric series with ratio (1+r). The future value formula is just the geometric partial-sum formula in disguise. Setting r = 0.05 and n = 10 shows how regular saving outgrows a single deposit.

Extended example 2 — the bouncing ball: a ball dropped from height h rebounds to a fraction f of its previous height. The total distance traveled is h + 2hf + 2hf² + 2hf³ + ..., a geometric series with ratio f. Because f < 1, the infinite sum converges to h + 2hf/(1 - f), a finite total distance even though the ball bounces infinitely many times. This is a classic convergence demonstration.

Extended example 3 — the harmonic series in music and probability: the harmonic series 1 + 1/2 + 1/3 + ... diverges, but very slowly. The fact that it diverges explains why the "stack of books" overhang puzzle can extend arbitrarily far given enough books, and why the expected number of records in a random permutation grows like the harmonic numbers. Our p-series mode flags p = 1 as divergent, exactly this borderline.

Extended example 4 — approximating π: the p-series with p = 2 converges to π²/6, so π = √(6·S∞). Summing many terms of 1/n² and taking the square root of six times the partial sum yields π to moderate accuracy — a genuinely surprising link between a simple sum and the circle constant. The table above shows the partial sums creeping toward that limit.

Extended example 5 — the sum of squares in statistics: the variance of a data set involves Σxᵢ². When the data are the integers 1 through n, that sum is exactly n(n+1)(2n+1)/6, the closed form this calculator returns for the sum-of-squares mode. Statisticians use it to center and scale measurements without looping through every value.

Extended example 6 — Zeno's paradox resolved: the runner who must cover half the remaining distance each step travels 1/2 + 1/4 + 1/8 + ..., a geometric series with ratio 1/2 whose infinite sum is exactly 1. The paradox — that the runner never arrives — dissolves once you recognize the infinite sum converges. Series give the rigorous answer ancient philosophers lacked.

Extended example 7 — annuities and loans: a level-payment loan is the inverse of a geometric series. The present value of n equal payments of amount A discounted at rate r is A(1 - (1+r)⁻ⁿ)/r, again the geometric formula. Banks and actuaries evaluate this every day; the same algebra underlies mortgage calculators and pension planning.

Extended example 8 — signal processing: a square wave is built from the odd harmonic series sin(x) + (1/3)sin(3x) + (1/5)sin(5x) + ... . Adding more terms (a longer partial sum) makes the synthesized wave resemble a square more closely. The rate of convergence — how many terms you need for a given fidelity — is a direct practical question about partial sums.

A good strategy when working with series is to identify the family first (arithmetic, geometric, p-series, or polynomial like the sum of squares), because each has its own closed form. Then decide whether you need a partial sum or a convergence verdict. This calculator separates those two questions cleanly: every mode returns the numeric sum, and the p-series mode additionally reports whether the infinite version settles or explodes.

An arithmetic series grows linearly in its number of terms, so doubling the terms roughly doubles the sum. A geometric series behaves differently: if the ratio is below one in magnitude, the sum approaches a finite ceiling, but if the ratio reaches or exceeds one, the total runs away without bound.

The harmonic series is the canonical warning that shrinking terms do not guarantee convergence. Its terms 1/n fade toward zero, yet the partial sums exceed any target if you add enough of them, which is why the p-series test (p > 1) draws such a sharp line at p = 1.

Series let you trade a complicated object for a long list of simple numbers. A function becomes a sequence of coefficients, a signal becomes a sequence of amplitudes, and a probability distribution becomes a sequence of moments — in each case the series is the bridge between the continuous world and the discrete arithmetic a computer can perform.

The rate of convergence is a practical concern, not a theoretical footnote. Two series may both converge, but one might need a handful of terms for good accuracy while the other needs thousands. Knowing which family you are in tells you how much computation a real application will demand before you start summing.

An infinite series and its sequence of partial sums are different objects. The sequence is the list of running totals; the series is the limit those totals approach. Confusing the two leads to mistakes such as treating the nth term as if it were the answer, when only the limit of the partial sums is the sum.

The comparison test is the intuitive companion to the p-series rule. If a series has smaller terms than a known convergent series, it converges too; if it has larger terms than a known divergent one, it diverges. The four families here give you the standard benchmarks against which unfamiliar series are judged.

Geometric series sit at the center of the theory because their sums have an exact closed form whenever the ratio's magnitude is below one. That closed form is also the foundation of present-value and annuity formulas in finance, where each future payment is discounted by a constant ratio and then added up exactly as this calculator does.

Power series generalize the idea by letting the ratio between successive terms depend on the position, producing polynomials of infinite degree that can represent functions. The arithmetic and polynomial sums here are the finite cousins of that broader family, and the same addition logic carries over when the number of terms grows without bound.

Last updated: July 20, 2026

1b

UnByte — Independent Software Engineering

Every calculator references authoritative sources — Editorial policy