Math 2.0

Sequences, series, summability Special summability methods Concept

Ramanujan summation

Summary

Ramanujan summation assigns a value to a series ∑n≥1f(n)\sum_{n \ge 1} f(n) by taking the constant term in the Euler–Maclaurin formula for its partial sums. The value is expressed through f(0)f(0), the odd derivatives of ff at 00 and the Bernoulli numbers. It gives 1+2+3+⋯=−1121 + 2 + 3 + \cdots = -\frac{1}{12} and 1+1+1+⋯=−121 + 1 + 1 + \cdots = -\frac12, the values ζ(−1)\zeta(-1) and ζ(0)\zeta(0) of the Riemann zeta function. Unlike most summability methods, it is neither regular nor stable under shifting the index.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ramanujan_summation
About this page
TagE3SRYCE5VN
URIm2://E3SRYCE5VN
Kindconcept
WritingW0 stub
MSC40G99, 11B68
SpecializesSummability method
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions