Sums of powers via integration
| dc.creator | Dashti, M. Torabi | |
| dc.date | 2009-03-25 | |
| dc.date.accessioned | 2026-07-07T12:56:30Z | |
| dc.date.available | 2026-07-07T12:56:30Z | |
| dc.description | Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing coefficients of Faulhaber formulae is presented. The correctness of the algorithm is proved by giving a recurrence relation on Faulhaber formulae. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/0903.4358 | |
| dc.identifier | http://arxiv.org/abs/0903.4358 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/224604 | |
| dc.subject | Discrete Mathematics | |
| dc.title | Sums of powers via integration | |
| dc.type | text |