{
  "id": "bernoulli-numbers",
  "title": "Bernoulli Numbers",
  "lang": "en",
  "source_lang": "en",
  "summary": "Bernoulli numbers are rational coefficients that connect sums of powers, series expansions, numerical summation, and special values of the Riemann zeta function.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Bernoulli number sequence"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/bernoulli-numbers/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/bernoulli-numbers/",
      "json": "https://aiwiki.page/zh/bernoulli-numbers.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Bernoulli numbers are a sequence of rational numbers \\(B_0,B_1,B_2,\\ldots\\) defined by the coefficients in the expansion of \\(t/(e^t-1)\\). First studied in connection with sums of integer powers, they occur throughout number theory, analysis, and numerical analysis. They provide exact formulas for finite sums, correction terms for approximating sums by integrals, and expressions for special values of the Riemann zeta function. Two conventions differ in the sign assigned to \\(B_1\\); this article uses \\(B_1=-\\tfrac12\\)."
    },
    {
      "heading": "Definition and initial values",
      "text": "The defining exponential generating function is\n\n\\[\\frac{t}{e^t-1} = \\sum_{n=0}^{\\infty}B_n\\frac{t^n}{n!}.\\]\n\nHere \\(e^t\\) is the exponential function, and \\(n!\\) denotes the factorial. The apparent singularity at \\(t=0\\) is removable, with limiting value \\(1\\). As an analytic expansion, the series converges for \\(|t|<2\\pi\\); it can also be interpreted purely algebraically as a formal power series.\n\nThe first values are:\n\n\\(n\\) | \\(B_n\\)\n0 | \\(1\\)\n1 | \\(-\\tfrac12\\)\n2 | \\(\\tfrac16\\)\n3 | \\(0\\)\n4 | \\(-\\tfrac1{30}\\)\n5 | \\(0\\)\n6 | \\(\\tfrac1{42}\\)\n7 | \\(0\\)\n8 | \\(-\\tfrac1{30}\\)\n9 | \\(0\\)\n10 | \\(\\tfrac5{66}\\)\n12 | \\(-\\tfrac{691}{2730}\\)\n\nAll odd-indexed Bernoulli numbers after \\(B_1\\) vanish:\n\n\\[B_{2m+1}=0\\qquad(m\\geq1).\\]\n\nThe nonzero even-indexed numbers alternate in sign:\n\n\\[(-1)^{m+1}B_{2m}>0 \\qquad(m\\geq1).\\]\n\nSign conventions\n\nAn alternative convention uses \\(B_1=+\\tfrac12\\), generated by\n\n\\[\\frac{t}{1-e^{-t}} = \\sum_{n=0}^{\\infty}\\widehat B_n\\frac{t^n}{n!}.\\]\n\nThe two sequences agree at every index except \\(1\\). This difference matters in formulas for sums of powers and values of the zeta function. Older works may also list only the nonzero even-indexed numbers, sometimes with their signs removed, so their indexing must be checked before comparing formulas."
    },
    {
      "heading": "Recurrence and elementary properties",
      "text": "Multiplying the defining series by \\(e^t-1\\) and comparing coefficients gives the recurrence relation\n\n\\[B_0=1,\\qquad \\sum_{k=0}^{n}\\binom{n+1}{k}B_k=0 \\quad(n\\geq1),\\]\n\nwhere \\(\\binom{n+1}{k}\\) is a binomial coefficient. Equivalently,\n\n\\[B_n=-\\frac{1}{n+1} \\sum_{k=0}^{n-1}\\binom{n+1}{k}B_k.\\]\n\nThis determines every Bernoulli number using exact rational arithmetic. For example,\n\n\\[1+2B_1=0, \\qquad 1+3B_1+3B_2=0,\\]\n\nyielding \\(B_1=-\\tfrac12\\) and \\(B_2=\\tfrac16\\).\n\nThe vanishing of the higher odd terms follows from the identity\n\n\\[\\frac{t}{e^t-1}+\\frac{t}{2} = \\frac{t}{2}\\frac{e^t+1}{e^t-1}.\\]\n\nThe right-hand side is unchanged when \\(t\\) is replaced by \\(-t\\), so its expansion contains only even powers."
    },
    {
      "heading": "Bernoulli polynomials and sums of powers",
      "text": "The Bernoulli polynomials extend the sequence by introducing a variable \\(x\\):\n\n\\[\\frac{te^{xt}}{e^t-1} = \\sum_{n=0}^{\\infty}B_n(x)\\frac{t^n}{n!}.\\]\n\nThey satisfy \\(B_n(0)=B_n\\), and their explicit polynomial form is\n\n\\[B_n(x)= \\sum_{k=0}^{n}\\binom{n}{k}B_kx^{n-k}.\\]\n\nTwo fundamental identities are\n\n\\[B_n'(x)=nB_{n-1}(x)\\]\n\nand\n\n\\[B_n(x+1)-B_n(x)=nx^{n-1} \\qquad(n\\geq1).\\]\n\nThe second identity makes Bernoulli polynomials discrete analogues of antiderivatives of powers. Summing it over consecutive integers causes the left-hand side to telescope, giving, for \\(p\\geq1\\) and positive integer \\(N\\),\n\n\\[\\sum_{k=0}^{N-1}k^p = \\frac{B_{p+1}(N)-B_{p+1}}{p+1}.\\]\n\nExpanding the polynomial yields a standard form of Faulhaber's formula:\n\n\\[\\sum_{k=0}^{N-1}k^p = \\frac{1}{p+1} \\sum_{j=0}^{p} \\binom{p+1}{j}B_jN^{p+1-j}.\\]\n\nFor example,\n\n\\[\\sum_{k=0}^{N-1}k^2 = \\frac{N^3}{3}-\\frac{N^2}{2}+\\frac{N}{6}.\\]\n\nThus Bernoulli numbers organize the coefficients of all power-sum polynomials into a single sequence."
    },
    {
      "heading": "Euler–Maclaurin summation",
      "text": "The Euler–Maclaurin formula relates a discrete sum to an integral, with Bernoulli numbers supplying endpoint corrections. For integers \\(a<b\\) and a sufficiently smooth function \\(f\\),\n\n\\[\\begin{aligned} \\sum_{k=a}^{b}f(k) ={}& \\int_a^b f(x)\\,dx +\\frac{f(a)+f(b)}{2}\\\\ &+ \\sum_{r=1}^{M} \\frac{B_{2r}}{(2r)!} \\left(f^{(2r-1)}(b)-f^{(2r-1)}(a)\\right) +R_M. \\end{aligned}\\]\n\nThe term \\(R_M\\) is a remainder involving a higher derivative of \\(f\\) and a periodic Bernoulli polynomial. Its size determines the accuracy of the truncated expression.\n\nThis formula explains why the same rational constants recur in summation problems, numerical integration, and asymptotic estimates. Applied to logarithms, it produces correction terms in Stirling's expansion:\n\n\\[\\log(n!) \\sim \\left(n+\\frac12\\right)\\log n-n +\\frac12\\log(2\\pi) + \\sum_{r=1}^{\\infty} \\frac{B_{2r}}{2r(2r-1)n^{2r-1}}.\\]\n\nThe symbol \\(\\sim\\) denotes an asymptotic expansion, not an assertion that the infinite series converges. For fixed \\(n\\), these correction terms eventually grow; useful approximations generally require truncation."
    },
    {
      "heading": "Riemann zeta function and growth",
      "text": "Bernoulli numbers are closely related to the Riemann zeta function. For every positive integer \\(m\\),\n\n\\[\\zeta(2m) = (-1)^{m+1} \\frac{B_{2m}(2\\pi)^{2m}}{2(2m)!}.\\]\n\nFor instance, \\(B_2=\\tfrac16\\) and \\(B_4=-\\tfrac1{30}\\) give\n\n\\[\\zeta(2)=\\frac{\\pi^2}{6}, \\qquad \\zeta(4)=\\frac{\\pi^4}{90}.\\]\n\nAt negative integers, values obtained by analytic continuation satisfy\n\n\\[\\zeta(-m)=(-1)^m\\frac{B_{m+1}}{m+1} \\qquad(m\\geq0).\\]\n\nConsequently,\n\n\\[\\zeta(0)=-\\frac12,\\qquad \\zeta(-1)=-\\frac1{12},\\qquad \\zeta(-3)=\\frac1{120}.\\]\n\nThe vanishing of \\(B_3,B_5,\\ldots\\) corresponds to the trivial zeros \\(\\zeta(-2),\\zeta(-4),\\ldots\\). These analytically continued values are not ordinary sums of the divergent series obtained by substituting negative integers into the original Dirichlet series.\n\nThe positive-even-value identity also gives\n\n\\[|B_{2m}| = \\frac{2(2m)!}{(2\\pi)^{2m}}\\zeta(2m).\\]\n\nSince \\(\\zeta(2m)\\to1\\),\n\n\\[|B_{2m}| \\sim \\frac{2(2m)!}{(2\\pi)^{2m}}.\\]\n\nThis factorial-scale growth helps explain the eventual divergence of many asymptotic expansions containing Bernoulli numbers."
    },
    {
      "heading": "Denominators and arithmetic structure",
      "text": "Although their numerators can become large, the denominators of the even-indexed Bernoulli numbers have a precise description. The von Staudt–Clausen theorem states that\n\n\\[B_{2m} + \\sum_{\\substack{p\\ \\mathrm{prime}\\\\p-1\\mid 2m}} \\frac1p\\]\n\nis an integer. Therefore, the denominator of \\(B_{2m}\\), when written in lowest terms, is\n\n\\[\\prod_{\\substack{p\\ \\mathrm{prime}\\\\p-1\\mid 2m}}p.\\]\n\nThe product ranges over prime numbers whose predecessors divide \\(2m\\), and every prime occurs only once. For example, \\(p-1\\mid12\\) for precisely \\(p=2,3,5,7,13\\), giving the denominator\n\n\\[2\\cdot3\\cdot5\\cdot7\\cdot13=2730\\]\n\nof \\(B_{12}\\).\n\nNumerators encode subtler information. An odd prime \\(p\\) is called an irregular prime if it divides the numerator, in lowest terms, of at least one of\n\n\\[B_2,B_4,\\ldots,B_{p-3}.\\]\n\nPrimes not satisfying this condition are called regular. This distinction arose in Ernst Kummer's work on Fermat's Last Theorem: he proved the theorem for regular prime exponents. Bernoulli-number congruences remain important in algebraic number theory."
    },
    {
      "heading": "Computation and numerical issues",
      "text": "The defining recurrence provides a straightforward method for computing a finite table. Its direct implementation requires quadratically many rational-arithmetic operations in the largest index, while the cost of individual operations increases as the numerators and denominators grow.\n\nFor large computations, methods may exploit:\n\n- the vanishing of odd-indexed terms;\n- the exact denominator formula;\n- computations in modular arithmetic, followed by reconstruction using the Chinese remainder theorem;\n- high-precision evaluation of the even zeta-value formula.\n\nExact arithmetic is important when numerators or divisibility properties are required. Direct use of the recurrence in floating-point arithmetic can suffer from cancellation, while the rapid growth of the values creates additional precision and range requirements."
    },
    {
      "heading": "Historical development",
      "text": "Bernoulli numbers are named after Jakob Bernoulli, whose Ars Conjectandi, published posthumously in 1713, presented them in connection with sums of powers. Related coefficients appeared independently in Seki Takakazu's Katsuyō Sanpō, published posthumously in 1712.\n\nLeonhard Euler established their connection with the zeta function and developed many of their analytic applications. The nineteenth century brought the von Staudt–Clausen denominator theorem and Kummer's investigations of congruences and regular primes, extending their importance from summation formulas to arithmetic."
    }
  ],
  "links": [
    "rational-number",
    "number-theory",
    "mathematical-analysis",
    "numerical-analysis",
    "generating-function",
    "exponential-function",
    "factorial",
    "power-series",
    "recurrence-relation",
    "binomial-coefficient",
    "polynomial",
    "integral",
    "derivative",
    "stirlings-approximation",
    "asymptotic-expansion",
    "riemann-zeta-function",
    "analytic-continuation",
    "prime-number",
    "fermats-last-theorem",
    "modular-arithmetic",
    "chinese-remainder-theorem",
    "floating-point-arithmetic",
    "leonhard-euler"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}