Computer Science – Discrete Mathematics
Scientific paper
2009-03-25
Computer Science
Discrete Mathematics
4 pages
Scientific paper
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.
No associations
LandOfFree
Sums of powers via integration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sums of powers via integration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sums of powers via integration will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-68481