Definition:Bernoulli Numbers/Recurrence Relation

This page has been identified as a candidate for refactoring of medium complexity. In particular: Separate the 2 definitions out into their own pages and prove equivalence with an equivalence proof. Take care to correctly present them in the transcluded pages (main page, equivalence proof) Until this has been finished, please leave {{Refactor}} in the code. New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code.

Definition

The Bernoulli numbers $B_n$ are a sequence of rational numbers defined by the recurrence relation:

$B_n = \begin {cases} 1 & : n = 0 \\ \ds - \sum_{k \mathop = 0}^{n - 1} \binom n k \frac {B_k} {n + 1 - k} & : n > 0 \end {cases}$

or equivalently:

$B_n = \begin {cases} 1 & : n = 0 \\ \ds - \frac 1 {n + 1} \sum_{k \mathop = 0}^{n - 1} \binom {n + 1} k B_k & : n > 0 \end {cases}$

Also see

• Equivalence of Definitions of Bernoulli Numbers

• Results about the Bernoulli Numbers can be found here.