ExplorationsWhat −1/12 is actually the value of

The Sum That Is Not a Sum

Proveddivergent seriessummation methodsCesàro and Abel summationadvanced

Add the positive whole numbers in order and the running totals are 1, 3, 6, 10 and so on, growing without bound. They do not approach −1/12. That value comes from a different procedure called , which changes how the infinite expression is treated; this page shows the ordinary sums alongside the precise procedures that assign −1/12.

Current view: Averaging the partial sums

The partial sums beside their running averages, every number an exact fraction.

Averaging the partial sums · 1 − 1 + 1 − 1 + ...after 4 terms, the total is 0

The averages are 1, 1/2, 2/3, 1/2, 3/5, 1/2 and so on: exactly 1/2 on every even step and (k+1)/(2k) on every odd one, both closing on 1/2. After 4 terms the average is 1/2. So 1 − 1 + 1 − 1 + ... is Cesàro summable to 1/2, which is a statement about these averages and not a claim that the running totals above them add up to anything. Every number in both rows is an exact fraction.

Every running total and its average
The running total of 1 − 1 + 1 − 1 + ... after each term, and the average of all the running totals so far, as exact values
Terms addedRunning totalAverage of the totalsThat average, to 6 places
1111.000000
201/20.500000
312/30.666666
401/20.500000
a running total
the sum of every term added so far, printed as an exact value
an average
the mean of all the running totals up to that point, as an exact fraction
the method
Cesàro summation, which reads the lower row and ignores the upper one

Two rows of the same length. The upper row is the partial sums, the lower row is the average of all the partial sums so far, and both are printed as exact fractions with no rounding anywhere. Cesàro summation is the statement that the lower row has a limit, and for Grandi's series it does: 1, 1/2, 2/3, 1/2, 3/5, 1/2, and so on to 1/2. Watch the lower row rather than the upper one. On 1 + 2 + 3 + ... the lower row grows as fast as the upper one, and the note beneath says by how much: the kth average is (k+1)(k+2)/6.

4 terms of 1 − 1 + 1 − 1 + .... The running total is 0 and the average of all the running totals so far is 1/2.

Terms
4
Running total
0
Average of the totals
1/2

The series

The three are chosen so that each method here succeeds on one and fails on the next. 1 + 2 + 3 + ... is the one everybody quotes, and it is the one every method on this page refuses.

How many terms

Small enough to check by hand: every total and every average printed as a fraction you can verify.

Step by step

Use Step for one change you can inspect, or Run to watch the changes accumulate.

Speed
Advanced parameters
The Abel variable · x = 99/100
An exact fraction, never a decimal. Abel summation is the limit as x rises to 1 from below, so x = 1 is offered and then refused with the reason rather than evaluated.
The smoothing width · ε = 1/100
How gently the tail of 1 + 2 + 3 + ... is switched off in the cutoff e^(−nε). As ε shrinks the smoothed sum grows like 1/ε², and what is left when that head is taken away settles toward −1/12.

Cases worth seeing

Try this

Set the series to 1 + 2 + 3 + ... and raise the term count until a partial sum passes ten thousand. How many terms did it take, and is there any number of terms after which the sums come back down?

1/5

What is going on

Each explanation begins with a worked example and follows the same operation through intuition, formal statements and proofs. Later sections distinguish what is established from questions that remain open, so you can follow the level of detail useful to you.

Worked by handGrandi's series, 1 − 1 + 1 − 1, four terms. The flap between 1 and 0; the running averages of those partial sums do not.
  1. 1(1) ÷ 11one so far, so its average is itself
  2. 1, 0(1 + 0) ÷ 21/2the second is 1 − 1, which is 0
  3. 1, 0, 1(1 + 0 + 1) ÷ 32/3the averages overshoot on the odd steps
  4. 1, 0, 1, 0(1 + 0 + 1 + 0) ÷ 41/2and land exactly on 1/2 on every even step, forever

The left-hand column is the list of so far, the middle column adds them up and divides by how many there are, and the right-hand column is the answer as an exact . The laboratory prints these same two rows side by side for any series and any number of terms, and it never rounds: every entry is a of two whole numbers held exactly.

Nothing in that calculation summed the series. The 1, 0, 1, 0 do not converge and never will. What is a different , built out of them by averaging, and it converges to 1/2. Deciding to call that "the sum" is a definition, and it is the first of four definitions on this page. Each one assigns a value to something a series does, and not one of them adds the series up.

01

What you are seeing

A plain description, starting with the part that is not in doubt

Add the whole numbers in order and keep a running total: 1, then 3, then 6, then 10, then 15. That is going in one direction only. Every term you add is positive and larger than the last, so the total after terms is , and whatever bound you care to name is passed once is large enough. The series has no sum. That is the first thing this page shows, it is the first claim in the ledger, and nothing below revises it.

You are probably here because of a sentence that says otherwise. It is worth saying at once what is actually true. There are several standard procedures, each with a careful definition, which take a series that does not converge and assign a number to it anyway. On some series they agree with ordinary addition. On some series they agree with each other and not with ordinary addition, because ordinary addition has no answer to give. And there is a , the Riemann zeta function, which is not a series at all but agrees with one where that series . Smooth away the tail of and the constant left behind is ; the zeta function takes the value at . Both of those are true, and both need the words around them.

The laboratory has three panels. The first draws the , which is the truth about the series and looks like nothing at all: a line leaving the top of the frame. The second averages those partial sums, which rescues and does nothing whatever for . The third does the two things that actually reach : it evaluates a power series just inside where it , and it smooths the series with a gentle cutoff and removes the part that blows up.

02

Why it starts to make sense

What a summation method is for

Here is the shift that makes all of this ordinary rather than mystical.

A series is a list of numbers with plus signs between them. Written down, it is not yet a number: turning it into one requires a rule, and the rule everybody learns is take the of the . That rule is excellent and it is not the only possible one. It is a choice, and it has two properties we would want from any choice: it agrees with finite addition when the list is finite, and it is linear, so that summing gives twice the first answer plus the second.

Now ask for other rules with those same two properties. There are many, and the two on this page are the oldest.

Averaging. Instead of asking where the go, ask where their running averages go. Every series has convergent averages with the same , so nothing is lost. And some gain: the partial sums of flap between 1 and 0 forever, but their averages are , closing steadily on . Averaging damps oscillation. That is exactly what it is for, and it is exactly what it is good for.

Discounting. Instead of adding , add for some a little below 1, so that later terms are counted a little less. The result is often a perfectly ordinary series with a closed form, and then you can ask what happens as rises back to 1. For the closed form is , which rises to . That is Abel summation, and note where the work happened: at the series genuinely converges and the closed form is genuinely its sum. Nothing is being smuggled. The only extra step is taking a at the end.

Now try both on and watch them fail. Averaging gives , which runs away as fast as the did. Discounting gives , which has a pole at and grows without bound. Neither method assigns this series a value. Whatever produces has to be something else, and the third panel is where that something else lives.

03

The key idea

What the number is actually the value of

Here is the sentence worth carrying away.

is not the sum of . It is the constant term that survives when the series is smoothed and its divergent part is removed, and it is the value of a continued at a point where its defining series does not converge. Those two turn out to be the same number, and that agreement is the interesting fact.

Take the smoothing first, because the laboratory can show it. Switch off the tail gently instead of sharply: sum rather than . For any positive this , and there is an elementary closed form for it,

Expand that in powers of and you get

Three pieces, and each behaves differently as shrinks. The first blows up, which is the divergence, still there, in its proper place. The last vanishes. In between sits a constant that neither blows up nor vanishes, and that constant is . Subtract the blowing-up part and watch what is left: at it is , at it is , falling toward from above. That is the headline panel, computed in exact fixed-point arithmetic rather than floating point, because the number being looked for sits in the fourth place of a difference between two quantities of size ten thousand.

The other route is the zeta . The series for and defines a function there; that function extends uniquely to an analytic function on the whole plane except at ; and the extended function's value at is . Substituting into the series gives , which is why the two get confused, but the extension is not the series and does not claim to be. That continuation is not performed on this page. Nothing in a browser continues an analytic function. It is cited, and the ledger says so.

What this page does reach on its own is the step next door. The alternating version becomes at , whose Abel sum is , computed here in exact . And , so at the is and . The arithmetic is a division. The identity holding at is the continuation again, and it is cited too.

04

Formal statement

Precisely what is being claimed

Let be a , its , and the running averages.

  1. For , , so the series diverges. Proved, here, in full.
  2. For , for even and for odd , so . Proved, here, and computed in exact rationals for .
  3. For , . Cesàro summation fails on this series. Proved, here.
  4. For , , and this tends to as . So the Abel sum of is . Proved, here, with the closed form checked against the truncated series under a rigorous tail bound at twenty values of .
  5. holds for all by , and at gives . Proved in the literature and cited. The continuation is not performed here; the only step taken on this page is the division by .
  6. as . Proved in the literature and cited; demonstrated here numerically at 20 places over seven values of , by two independent computations.
  7. for the of . Proved in the literature and cited. Not performed here, and no computation on this page establishes it.

Statement 1 is not superseded by any of the others. Statements 2, 3 and 4 are about summation methods; 6 is about a smoothed series; 5 and 7 are about a that is not a series. The line people quote, which sets equal to with no qualifier at all, is not any of these, and statement 1 is why.

05

Proof

Of the parts that admit one here

The series diverges. By , : true at , and adding to gives . Given any bound , take ; then . So the are eventually above every bound and the series has no sum.

Grandi's series is Cesàro summable to . The alternate , so . For even this is and exactly; for odd it is and . Both tend to , so .

Cesàro summation fails on . Here , so

and dividing by gives . This is in , so it passes every bound and the means diverge. Indeed , so the averaging did not even change the order of growth.

The Abel sum of is . For the gives , which may be differentiated term by term inside its disc of . Doing so and multiplying by gives . This is a continuous on , so the as is its value at 1, namely .

The laboratory checks the closed form rather than trusting it. Truncating at terms leaves a tail bounded by with , an exact , and the test suite asserts that the closed form and the truncation differ by no more than that bound at twenty different rational .

Why is refused. Abel summation is defined as , a over points strictly inside the disc. Substituting into happens to give , the correct value, which is precisely the danger: the same in divides by zero, and a step that is only valid when you already know the answer is not a step. The laboratory therefore refuses the endpoint and prints the reason.

What is not proved here. Two things, and they are the two that carry the number to the zeta . The expansion is a Laurent expansion of , cited to Tao; this page evaluates it at seven values of in fixed-point arithmetic and shows the leftover falling toward , which is a demonstration and not a derivation. And the of to , together with the identity holding there, is cited to Riemann and to Titchmarsh. Nothing in this browser continues a function past where its series , and no number printed on this page would change if the continuation were different.

06

Limits and frontier

Where this page stops being able to help

What this laboratory computes. and Cesàro means of three series, in exact arithmetic on BigInt, for up to 120 terms with nothing rounded. Abel closed forms at exact , checked against truncated power series under a rigorous rational tail bound. And the smoothed sum at seven values of , in BigInt at 20 places with 25 guard digits, computed twice by unlike routes so that the agreement means something. There is no floating-point number anywhere in the mathematics.

What a demonstration at seven values of is worth. Not much on its own, and the ledger says so. Seven points falling toward is consistent with a of and equally consistent with a limit of that happens to be something else, and no number of further points would settle it. The reason to believe the constant is exactly is the expansion, which is cited. What the seven points genuinely establish is that the code implements the expansion it claims to, since two independent routes to the same number agree to nineteen places, and that is worth having.

The exact path does not give , and that is instructive. Smoothing with instead of stays entirely inside the rationals, and the sum is exactly : no constant term at all. Nothing is broken. That cutoff is for , and expanding in powers of recovers the missing . Which quantity counts as the divergent part is part of the statement, and a reader who assumes is obviously the right thing to subtract in any parametrisation gets zero here instead. The constant is universal across smooth cutoffs; the head is not.

Where the mathematics is settled and where the sentence is not. The mathematics is entirely settled and has been for over a century. Every result named on this page is a , and the frontier is elsewhere: the interesting open questions about are about its zeros, not its value at . What is not settled is the sentence, which continues to circulate with the qualifier removed, and in that shortened form it contradicts the first claim in the ledger. If you take one thing from this page, take the habit of asking what a stated equality is an equality of.

Read this next to 1, 2, 4, 8, 16, and Then Not 32. There a pattern is overwhelming and then simply wrong at the sixth step. Here a formula is famous and correct, and about something other than what it looks like. Both pages are about the same discipline applied at different moments: pinning down the claim before believing it.

What is actually established

Every statement on this page, with its status, its exact scope, and the date that status was last checked.

Proved

1 + 2 + 3 + 4 + ... diverges: its partial sums are n(n+1)/2 and they exceed any bound.

Scope
The series of positive integers, in the ordinary sense of the limit of its partial sums. Proved here in full, for every bound, and listed first because every other claim on this page is a qualification of it rather than a challenge to it.
Why
The kth partial sum is 1 + 2 + ... + k = k(k+1)/2, which is proved by induction in one line and checked in the test suite against the running total for the first several hundred k. Given any bound B, choose k larger than 2B; then k(k+1)/2 is larger than k/2, which is larger than B. So no bound holds the partial sums, they have no limit, and the series has no sum. Nothing later on this page contradicts that, and nothing later on this page is a way of adding these numbers up. Each of the other claims is about a different object: an average of partial sums, a power series evaluated inside its disc of convergence, a smoothed sum with its divergent part removed, or a function defined by continuation.
Status checked
Proved

Grandi's series 1 − 1 + 1 − 1 + ... is Cesàro summable to 1/2: the running averages of its partial sums converge to 1/2.

Scope
The alternating series of ones, under Cesàro summation specifically. Proved here in full by exhibiting the closed form of the kth average, and demonstrated in exact rational arithmetic for the first thousand terms in the test suite.
Why
The partial sums are 1, 0, 1, 0, ... The average of the first k of them is 1/2 when k is even, since half the entries are 1, and (k+1)/(2k) when k is odd. Both expressions tend to 1/2, so the averages converge and the Cesàro sum is 1/2. Every number in that argument is an integer or a fraction of integers, and the laboratory computes them as exact rationals on BigInt with nothing rounded. What is not being claimed is that 1 − 1 + 1 − 1 + ... adds up to 1/2: the partial sums do not converge, and Cesàro summability is a property of the averaged sequence. The value of showing it first is that it makes the shape of every later claim recognisable, since each is likewise a limit of something built out of the series rather than a limit of the series.
Status checked
Proved

The Abel sum of 1 − 2 + 3 − 4 + ... is 1/4, since Σ (−1)^(n−1) n x^n = x/(1 + x)^2, which tends to 1/4 as x rises to 1 from below.

Scope
The alternating series of integers, under Abel summation specifically, and every one of the exact rational values of x/(1 + x)^2 the laboratory prints. Proved here and computed here: the closed form is checked against the truncated power series with a rigorous rational tail bound at twenty different values of x. The further step from this to ζ(−1) is a separate matter and is cited rather than performed, as the next claims say.
Why
Differentiating the geometric series 1/(1 + x) = Σ (−1)^n x^n term by term inside its disc of convergence and multiplying by x gives Σ (−1)^(n−1) n x^n = x/(1 + x)^2, valid for |x| < 1. Letting x rise to 1 gives 1/(1 + 1)^2 = 1/4, and that limit is by definition the Abel sum. The laboratory evaluates the closed form at exact fractions and compares it against the truncated series, with the discarded tail bounded above by t^(N+1)((N+1) − Nt)/(1 − t)^2, a rational number rather than an estimate. The reason this claim matters beyond itself is the identity η(s) = (1 − 2^(1−s))·ζ(s), where η is the alternating Dirichlet series that becomes 1 − 2 + 3 − 4 + ... at s = −1. At s = −1 the factor is 1 − 2^2 = −3, so η(−1) = 1/4 gives ζ(−1) = −1/12. That step is the analytic continuation of both series past the half-plane where they converge, it is a theorem of complex analysis and not of arithmetic, and it is NOT performed on this page. It is cited to Hardy and to Titchmarsh, and the arithmetic the laboratory does with it is the single division by −3 and nothing else.
Status checked
Proved

The smoothed sum Σ n·e^(−nε) equals 1/ε^2 − 1/12 + O(ε^2), so the smoothed sum minus its divergent part tends to −1/12 as ε shrinks.

Scope
The sum of n against the exponential cutoff e^(−nε), for positive ε, as ε tends to zero. The identity Σ n·e^(−nε) = 1/(4·sinh^2(ε/2)) is elementary and is used here; the expansion of that expression as 1/ε^2 − 1/12 + ε^2/240 − ... is a standard Laurent expansion, cited to Tao. Demonstrated on this page numerically at the stated precision, over a ladder of seven values of ε, and not derived here.
Why
Writing q = e^(−ε), the sum Σ n·q^n is the geometric derivative q/(1 − q)^2, and multiplying numerator and denominator by q^(−1) turns the denominator into (q^(−1/2) − q^(1/2))^2 = 4·sinh^2(ε/2). Expanding 1/(4·sinh^2(ε/2)) in powers of ε gives 1/ε^2 − 1/12 + ε^2/240 − ..., where the −1/12 is the constant term. Subtracting the divergent head 1/ε^2 therefore leaves a quantity that approaches −1/12 from above, the gap being ε^2/240 to leading order. The laboratory computes this in BigInt fixed point rather than in floating point, because the interesting number is the fourth decimal place of a difference between two quantities of size ten thousand, and it computes it twice by unlike routes: once by adding the terms n·e^(−nε) one at a time until they fall below the working scale, and once by evaluating the sinh closed form. The test suite asserts that the two agree to within ten units in the twentieth decimal place. What Tao's account adds, and what this page states rather than establishes, is that the −1/12 is not an artefact of choosing e^(−nε): any sufficiently smooth cutoff gives the same constant term, while the divergent head depends on the cutoff. The exact rational path on this page makes that concrete in the other direction, since the cutoff (1 − ε)^n gives exactly 1/ε^2 − 1/ε and no constant term at all, because it is e^(−nε') for a different ε'.
Computation (approximate)
Seven values of ε from 1/2 down to 1/200. The exponential path is computed in BigInt fixed point at 20 decimal places of reported precision with 25 further guard digits carried through the working, by two independent routes: a term-by-term sum, which runs to about 21,000 terms at the smallest ε, and the closed form 1/(4·sinh^2(ε/2)). No floating point and no Math.exp appear anywhere in the computation. The two routes are asserted in the test suite to agree to within ten units in the twentieth decimal place, and the leftover after subtracting 1/ε^2 is asserted to decrease monotonically and to stay above −1/12. This is a demonstration at seven values of ε, not a derivation of the expansion. Algorithm regularised-sums-1.
Status checked
Proved

ζ(−1) = −1/12 for the analytic continuation of the Dirichlet series Σ n^(−s) beyond the half-plane where it converges.

Scope
The Riemann zeta function, meaning the unique analytic continuation of Σ n^(−s) to the complex plane apart from a simple pole at s = 1. Proved in the literature and cited here. It is explicitly NOT performed on this page: nothing in this browser continues a function, and no computation shown here establishes this value.
Why
The series Σ n^(−s) converges only for Re(s) > 1, and at s = −1 it is literally 1 + 2 + 3 + ..., which the first claim on this page says diverges. Both statements are true because the symbol ζ(−1) does not denote that series. It denotes the value at −1 of the unique analytic function that agrees with the series where the series converges, and whose existence and uniqueness come from the functional equation Riemann established in 1859. Evaluating it at −1 gives −1/12. What this page does with that number is arithmetic and nothing more: given η(−1) = 1/4, which the Abel computation above genuinely reaches, the identity η(s) = (1 − 2^(1−s))·ζ(s) at s = −1 divides by 1 − 2^2 = −3 to give −1/12. The identity is proved where both series converge and is carried to s = −1 by continuation, which is the step being cited. A reader should take away that ζ(−1) = −1/12 is a fact about a continued function, and that the familiar line which drops the continuation and simply equates the series 1 + 2 + 3 + ... with −1/12 is not a shorthand for it but a different statement, which is false.
Status checked
Proved

Cesàro summation fails for 1 + 2 + 3 + ...: the Cesàro means are (k+1)(k+2)/6 and diverge as fast as the partial sums do.

Scope
The series of positive integers, under Cesàro summation specifically. Proved here in full by a closed form, and computed in exact rational arithmetic in the laboratory and the test suite. It is the failure preset on this page.
Why
The kth partial sum is k(k+1)/2. Adding those up for k = 1 to K gives K(K+1)(K+2)/6, a standard identity checked here against the exact running total, and dividing by K leaves (K+1)(K+2)/6. That is quadratic in K, so it exceeds every bound and the Cesàro means do not converge. Averaging is not too weak a method here by a narrow margin: the means are asymptotically a third of the partial sums, so they run away at the same order. The point of putting this in the ledger is that it separates two things a reader might otherwise merge. Cesàro summation genuinely assigns 1/2 to 1 − 1 + 1 − 1 + ..., and it genuinely assigns nothing at all to 1 + 2 + 3 + .... The value −1/12 does not come from anywhere near this method, and any account that reaches it by averaging has gone wrong somewhere.
Status checked

Sources

Review notes show which bibliographic details Mathomaly has checked and which remain unresolved. Checking a publication record does not independently verify its proof.

  1. G. H. Hardy, Divergent Series, Clarendon Press, Oxford, 1949. Link

    The standard account of what it means to assign a value to a series that does not converge, and of the relations between the methods. Chapter 1 sets out the discipline this page tries to keep: a summation method is a definition, several definitions can agree, and none of them turns a divergent series into a convergent one. Cited for the framework, for the Abel and Cesàro results, and for the relation between the eta and zeta functions.

    Bibliographic record checked. This is not an independent verification of the proof.

    Bibliographic review:

    AI-assisted bibliographic audit. Evidence type: library record.

    Library record confirms author, title and Clarendon Press, 1949.

  2. E. C. Titchmarsh, The Theory of the Riemann Zeta-Function, Clarendon Press, second edition revised by D. R. Heath-Brown, 1986. Link

    Treats the meromorphic continuation of the zeta function, with its pole at 1, and its values at negative integers. The laboratory cites rather than reconstructs the continuation.

    Bibliographic record checked. This is not an independent verification of the proof.

    Bibliographic review:

    AI-assisted bibliographic audit. Evidence type: source text.

    University-hosted book confirms 1986 revised edition; Heath-Brown revised the original Titchmarsh text.

  3. Bernhard Riemann, Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse, Monatsberichte der Berliner Akademie, 1859. Link

    The paper that continues the Dirichlet series beyond the half-plane where it converges and states the functional equation, which is what gives ζ a value at −1 at all. Cited as the origin of the object this page names in its last claim and does not construct.

    Bibliographic record checked. This is not an independent verification of the proof.

    Bibliographic review:

    AI-assisted bibliographic audit. Evidence type: source text.

    University historical archive identifies the title, author and November 1859 original publication.

  4. Terence Tao, The Euler-Maclaurin formula, Bernoulli numbers, the zeta function, and real-variable analytic continuation, Terence Tao's blog, What's new, 2010. Link

    Where the smoothed-sum picture used in this page's headline view is set out: for a smooth cutoff, the sum of n against that cutoff is a divergent term of order 1/ε^2 plus the constant −1/12 plus a vanishing remainder, and the constant does not depend on which smooth cutoff was chosen. Cited for the asymptotic expansion Σ n·e^(−nε) = 1/ε^2 − 1/12 + O(ε^2), which this page demonstrates numerically at a stated precision rather than derives.

    Bibliographic record checked. This is not an independent verification of the proof.

    Bibliographic review:

    AI-assisted bibliographic audit. Evidence type: source text.

    Author's article is the cited exposition; bibliographic check is not a reproduction of every asymptotic argument.

Connected by how they work, not by sharing a topic label.