Faulhaber's theorem on power sums

DOI10.1016/J.DISC.2008.07.027zbMATH Open1220.11027arXivmath/0606090OpenAlexW1995985109MaRDI QIDQ1025909FDOQ1025909

Authors: William Y. C. Chen, Amy M. Fu, Iris F. Zhang 

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We observe that the classical Faulhaber's theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression $a+b,a+2b,\mathrm{...},a+nb$ is a polynomial in $na+n(n+1)b/2$. While this assertion can be deduced from the original Fauhalber's theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, by utilizing the central factorial numbers as in the approach of Knuth, we derive formulas for $r$-fold sums of powers without resorting to the notion of $r$-reflexive functions. We also provide formulas for the $r$-fold alternating sums of powers in terms of Euler polynomials.

Full work available at URL: https://arxiv.org/abs/math/0606090

Recommendations

• Johann Faulhaber and Sums of Powers
• Why the Faulhaber polynomials are sums of even or odd powers of \((n+1/2)\)
• Some notes on alternating power sums of arithmetic progressions
• A Quick Route to Sums of Powers
• On the sum of \(k\)-th powers in terms of earlier sums

zbMATH Keywords

power sumBernoulli polynomialEuler polynomialalternating sum\(r\)-fold alternating power sum\(r\)-fold power sumFaulhaber's theorem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Bernoulli and Euler numbers and polynomials (11B68) Binomial coefficients; factorials; (q)-identities (11B65) Basic hypergeometric functions in one variable, ({}_rphi_s) (33D15)

Cites Work

• Binomial determinants, paths, and hook length formulae
• Title not available (Why is that?)
• Elliptic Faulhaber polynomials and Lame densities of states
• Johann Faulhaber and Sums of Powers
• Title not available (Why is that?)
• Sums of Powers of Integers
• A \(q\)-analogue of Faulhaber's formula for sums of powers
• A combinatorial proof of the sum of \(q\)-cubes
• On the {\(q\)}-analogue of the sum of cubes
• {\(q\)}-analogues of the sums of consecutive integers, squares, cubes, quarts and quints
• Combinatorial interpretations of the \(q\)-Faulhaber and \(q\)-Salié coefficients
• A Quick Route to Sums of Powers
• A new \(q\)-analogue of the sum of cubes

Cited In (14)

• A treaty of symmetric function: an approach in deriving general formulation for sums of power for an arbitrary arithmetic progression. I
• Euler sums of generalized alternating hyperharmonic numbers
• Explicit form of the Faulhaber polynomials
• Generalized alternating hyperharmonic number sums with reciprocal binomial coefficients
• Generalized hyperharmonic number sums with reciprocal binomial coefficients
• Applying Archimedes's method to alternating sums of powers
• Summation formulas of hyperharmonic numbers with their generalizations
• A refinement of Faulhaber's theorem concerning sums of powers of natural numbers
• Why the Faulhaber polynomials are sums of even or odd powers of \((n+1/2)\)
• The Generalization of Faulhaber's Formula to Sums of Arbitrary Complex Powers
• A \(q\)-analogue of Faulhaber's formula for sums of powers
• A note on polynomial expressions for sums of power of integers multiplied by exponential terms
• Summation formulas of \(q\)-hyperharmonic numbers
• Johann Faulhaber and Sums of Powers

This page was built for publication: Faulhaber's theorem on power sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025909)