Definition:Bernoulli Numbers/Recurrence Relation
Jump to navigation
Jump to search
This page has been identified as a candidate for refactoring. In particular:
Separate the 2 definitions out into their own pages and prove equivalence with an equivalence proof
Separate the 2 definitions out into their own pages and prove equivalence with an 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}$.
Definition
The Bernoulli numbers $B_n$ are a sequence of rational numbers defined by the recurrence relation:
- $B_n = \begin{cases} 1 & : n = 0 \\ \displaystyle - \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 \\ \displaystyle - \frac 1 {n+1} \sum_{k \mathop = 0}^{n - 1} \binom {n+1} k B_k & : n > 0 \end{cases}$
Also see
- Results about the Bernoulli Numbers can be found here.