The term "Bernoulli polynomial" has two definitions in use. The th Bernoulli polynomial is denoted here by
(Abramowitz and Stegun 1972), and the archaic form of
the Bernoulli polynomial by
(or sometimes
). When evaluated at zero,
these definitions correspond to the Bernoulli numbers,
|
(1)
| |||
|
(2)
|
The Bernoulli polynomials are an Appell sequence with
|
(3)
|
(Roman 1984, p. 31), giving the generating function
|
(4)
|
(Abramowitz and Stegun 1972, p. 804), first obtained by Euler (1738). The first few Bernoulli polynomials are
|
(5)
| |||
|
(6)
| |||
|
(7)
| |||
|
(8)
| |||
|
(9)
| |||
|
(10)
| |||
|
(11)
|
Whittaker and Watson (1990, p. 126) define an older type of "Bernoulli polynomial" by writing
|
(12)
|
instead of (12). This gives the polynomials
|
(13)
|
where
is a Bernoulli number, the first few of which
are
|
(14)
| |||
|
(15)
| |||
|
(16)
| |||
|
(17)
| |||
|
(18)
|
The Bernoulli polynomials also satisfy
|
(19)
|
and
|
(20)
|
(Lehmer 1988). For ,
|
(21)
|
so
|
(22)
|
for odd .
They also satisfy the relation
|
(23)
|
(Whittaker and Watson 1990, p. 127).
For rational values of ,
can be expressed for positive integers
in terms of Bernoulli and Euler numbers, for example
|
(24)
| |||
|
(25)
| |||
|
(26)
| |||
|
(27)
| |||
|
(28)
|
Bernoulli (1713) defined the polynomials in terms of sums of the powers of consecutive integers,
|
(29)
|
The Bernoulli polynomials satisfy the recurrence relation
|
(30)
|
(Appell 1882), and obey the identity
|
(31)
|
where
is interpreted as the Bernoulli number
. Another related identity is
|
(32)
|
where
is interpreted as the Bernoulli polynomial
.
Hurwitz gave the Fourier series
|
(33)
|
for positive integers and
, where the prime in
the summation indicates that the term
is omitted. Performing the sum under the same conditions
gives
|
(34)
|
where
is the polylogarithm function. Both representations
also hold at
and
for integers
(Dilcher). For
, the symmetric Fourier
series has value 0 at these endpoints, whereas
and
. The individual polylogarithm
terms
are singular, so the polylogarithm
formula does not apply there. Raabe (1851) found
|
(35)
|
A sum identity involving the Bernoulli polynomials is
|
(36)
|
for positive integers (Nörlund 1922). A sum identity due to S. M. Ruiz
is
|
(37)
|
where
is a nonnegative integer and
is a binomial coefficient. This follows because
is a monic polynomial of degree
, whose
th unit-step forward difference
equals
. The Bernoulli polynomials are also given by the formula
|
(38)
|
where
is a Stirling number of the second
kind and
is a falling factorial (Roman 1984, p. 94).
A general identity is given by
|
(39)
|
which simplifies to
|
(40)
|
(Roman 1984, p. 97). Gosper gave the identity
|
(41)
|
For a polynomial whose coefficients are
rational numbers, let
denote the least
common multiple of their denominators. For
, write
and
. Then
|
(42)
|
where
runs over the primes and
is the base-
digit sum of
(Kellner 2017, Kellner and Sondow 2017). The first few values
of
for
, 2, ... are 1, 1, 2, 1, 6, 2, 6, 3, 10, 2, ... (OEIS
A195441).
Let
denote the product of the distinct prime divisors
of
. The full denominator
satisfies
|
(43)
| |||
|
(44)
|
The first equality separates the constant coefficient from the other coefficients.
The second equality (Kellner and Sondow 2021) gives a factorization into three pairwise
relatively prime products,
|
(45)
|
where
is the product over primes
with
and
,
is the product over primes
with
and
, and
is the product over primes
with
and
. With
, the first few values of
are 1, 2, 6, 2, 30, 6, 42, 6, 30, 10, ... (OEIS A144845).
For , the derivative
has integer coefficients iff
, or equivalently
. The known positive indices with this
property are 1, 2, 4, 6, 10, 12, 28, 30, 36, 60 (OEIS A094960).
Kellner (2024) proved that there are finitely many such indices and conjectured that
these ten exhaust them.
The Nørlund polynomials generalize the Bernoulli polynomials, with
(Roman 1984, p. 93).