Applications of a recurrence for the Bernoulli numbers (Q1892578): Difference between revisions

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.