Recursion formulae for \(\sum_{m=1}^n m^k\) (Q1969405): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:23, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursion formulae for \(\sum_{m=1}^n m^k\) |
scientific article |
Statements
Recursion formulae for \(\sum_{m=1}^n m^k\) (English)
0 references
2 July 2000
0 references
Let \(S_k(n)=\sum_{m=1}^n m^k\). The authors prove that \(S_k(n)\) is a \((k+1)\)-th degree polynomial in \(n\) and show that the coefficients of \(S_k(n)\) can be used to obtain the expression of \(S_{k+1}(n)\). A formula for the Bernoulli numbers is also proposed.
0 references
recursion formula
0 references
sum of powers
0 references
Bernoulli numbers
0 references
