Bernoulli Number
Related searches:bernoulli numbers, bernoulli numbers problem,bernoulli numbers solved, bernoulli numbers puzzle, bernoulli
From Wikipedia, the free encyclopedia
In mathematics, the Bernoulli numbers are a sequence of rational numbers with deep
connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers.
In Europe, they were first studied by Jakob
Bernoulli, after whom they were named by Abraham de Moivre. In
Japan, perhaps earlier, they were independently discovered by Seki Kōwa. They appear in the Taylor series expansions of
the tangent
and hyperbolic
tangent functions, in the Euler–Maclaurin formula,
and in expressions for certain values of the Riemann zeta function.
In note G
of Ada Lovelace's notes on the Analytical
Engine from 1842, Lovelace describes an algorithm
for generating Bernoulli numbers with Babbage's machine [~ 1].
As a result, the Bernoulli numbers have the distinction of being the
subject of the first computer program.
- 1 Introduction
- 2 Values of the Bernoulli numbers
- 3 Efficient computation of Bernoulli numbers
- 4 Reconstruction of 'Summae Potestatum'
- 5 Different viewpoints and conventions
- 6 Application of the Bernoulli number
- 7 Combinatorial definitions
- 8 Asymptotic approximation
- 9 Integral representation and continuation
- 10 The relation to the Euler numbers and π
- 11 An algorithmic view: the Seidel triangle
- 12 A combinatorial view: alternating permutations
- 13 Generalizations by polynomials
- 14 Arithmetical properties of the Bernoulli numbers
- 15 Use of Bernoulli numbers in topology
- 16 Assorted identities
- 17 See also
- 18 References
- 19 External links
No comments:
Post a Comment
TrendsWave ~