Acceleration of the computation of Bernoulli numbers (Q1102314): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Frits Beukers / rank | |||
Property / reviewed by | |||
Property / reviewed by: Frits Beukers / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Irregular Primes to 125000 / rank | |||
Normal rank |
Latest revision as of 17:08, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Acceleration of the computation of Bernoulli numbers |
scientific article |
Statements
Acceleration of the computation of Bernoulli numbers (English)
0 references
1988
0 references
Using an idea of Ramanujan the author constructs an interesting recurrence relation for the Bernoulli numbers \(B_ 0\), \(B_ 1\), \(B_ 2,..\). This relation yields for a fixed, but otherwise arbitrary, \(q\in\mathbb N\) a linear relation between the numbers \(B_{k-q}\), \(B_{k-3q},\ldots\). with coefficients which can be computed economically. The recurrence provides alternative ways to test whether a given prime is irregular.
0 references
irregular primes
0 references
recurrence relation
0 references
Bernoulli numbers
0 references