Applications of a recurrence for the Bernoulli numbers (Q1892578): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jnth.1995.1062 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083424528 / rank | |||
Normal rank | |||
Latest revision as of 19:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of a recurrence for the Bernoulli numbers |
scientific article |
Statements
Applications of a recurrence for the Bernoulli numbers (English)
0 references
19 June 1995
0 references
The author provides an easy proof of the recurrence \[ B_m= {1\over {n(1- n^m)}} \sum^{m-1}_{k =0} n^k {m \choose k} B_k \sum^{n-1}_{j=1} j^{m-k}, \] where \(\{B_m\}\) are the Bernoulli numbers. The author uses this formula to present proofs of theorems on Bernoulli numbers due to Staudt-Clausen, Carlitz, Frobenius and Ramanujan. An analogous recurrence for Genocchi numbers is given, which is used to present new proofs of theorems on Genocchi numbers of Lehmer, Ramanujan and Kummer. In some cases, earlier results are extended.
0 references
recurrence
0 references
Bernoulli numbers
0 references
Genocchi numbers
0 references
