compute Bernoulli numbers and polynomials
nonnegint; the index of the required Bernoulli number or polynomial
algebraic; the expression at which the Bernoulli polynomial is evaluated
(optional) equation of the form singleton = value, where value is true or false (default: false)
The bernoulli(n) function computes the nth Bernoulli number. Bernoulli numbers come from the coefficients in the Taylor expansion of x/(e^x - 1).
The bernoulli(n, x) function computes the nth Bernoulli polynomial, in the expression x.
The nth Bernoulli number is defined as bernoulli(n, 0).
The nth Bernoulli polynomial, Bn⁡x, is defined by the exponential generating function:
The mode parameter controls whether or not the bernoulli routine computes additional Bernoulli numbers in parallel with the requested one. For example, if your computer has 4 cores, then the commands bernoulli(1000) and bernoulli(1000, singleton=false) will compute (and store) bernoulli(1002), bernoulli(1004), and bernoulli(1006). Since in practice nearly all computations which use Bernoulli numbers require many of them, and require them in sequence, this results in considerable efficiency gains. The commands bernoulli(1000, singleton) and bernoulli(1000, singleton=true) (which are equivalent) will result in only the 1000th Bernoulli number being computed.
The mode option has no effect if your computer has only a single core.
The first 15 Bernoulli numbers are listed in the following table. It can be noted that Bn = 0_ for all odd 1<n.
The mode parameter was introduced in Maple 16.
For more information on Maple 16 changes, see Updates in Maple 16.
Download Help Document
What kind of issue would you like to report? (Optional)