Recursion formulae for \(\sum_{m=1}^n m^k\) (Q1969405): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5834078 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3999482 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5287501 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Sum of the kth Powers of the First n Integers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5605185 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4171/zaa/933 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052892042 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 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
