Math 2.0

Number theory Object

Bernoulli polynomials

Description

The Bernoulli polynomials are the polynomials Bn(x)∈ℚ[x]B_n(x) \in \Q[x], n≥0n \ge 0, given by the generating function t extet−1=∑n=0∞Bn(x)tnn!.\frac{t \, e^{x t}}{e^t - 1} = \sum_{n=0}^{\infty} B_n(x) \frac{t^n}{n!}. Equivalently, Bn(x)=∑k=0n(nk)Bk xn−kB_n(x) = \sum_{k=0}^{n} \binom{n}{k} B_k \, x^{n-k}, where BkB_k are the Bernoulli numbers with B1=−12B_1 = -\frac{1}{2}.

Remarks

The first values are B0(x)=1B_0(x) = 1, B1(x)=x−12B_1(x) = x - \frac{1}{2}, B2(x)=x2−x+16B_2(x) = x^2 - x + \frac{1}{6} and B3(x)=x3−32x2+12xB_3(x) = x^3 - \frac{3}{2} x^2 + \frac{1}{2} x. Each BnB_n is monic of degree nn, and Bn(0)=BnB_n(0) = B_n. They satisfy Bn′(x)=nBn−1(x)B_n'(x) = n B_{n-1}(x) and Bn(x+1)−Bn(x)=nxn−1B_n(x + 1) - B_n(x) = n x^{n-1} for n≥1n \ge 1. Summing the second identity gives the sums of powers: for p≥0p \ge 0 and m≥1m \ge 1, ∑k=0m−1kp=Bp+1(m)−Bp+1(0)p+1.\sum_{k=0}^{m-1} k^p = \frac{B_{p+1}(m) - B_{p+1}(0)}{p + 1}. Check with p=1p = 1, m=4m = 4: B2(4)−B2(0)2=122=6=0+1+2+3\frac{B_2(4) - B_2(0)}{2} = \frac{12}{2} = 6 = 0 + 1 + 2 + 3. They also satisfy Bn(1−x)=(−1)nBn(x)B_n(1 - x) = (-1)^n B_n(x).

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Bernoulli_polynomials
About this page
TagBXQKBJJGFG
URIm2://BXQKBJJGFG
Kindobject
WritingW0 stub
MSC11B68
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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