Math 2.0

Sequences, series, summability Special summability methods Concept

Lambert summation

Summary

Lambert summation is a summability method built on Lambert series ∑nanxn1−xn\sum n a_n \frac{x^n}{1 - x^n}, multiplied by 1−x1 - x, with x→1x \to 1 from below. It is regular, so it gives the usual sum to every convergent series. It is closely tied to the prime number theorem. The series ∑n≥1μ(n)/n\sum_{n \ge 1} \mu(n)/n is Lambert summable to 00 by a short computation, and a Tauberian theorem upgrades this to convergence.

Further reading

  1. Web https://en.wikipedia.org/wiki/Lambert_summation
About this page
TagW8H1WX0JHG
URIm2://W8H1WX0JHG
Kindconcept
WritingW0 stub
MSC40G10, 11M45
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

Definitions