Johann Faulhaber and sums of powers

Abstract

Early 17th-century mathematical publications of Johann Faulhaber contain some remarkable theorems, such as the fact that the $r$-fold summation of $1^m,2^m,...,n^m$ is a polynomial in $n(n+r)$ when $m$ is a positive odd number. The present paper explores a computation-based approach by which Faulhaber may well have discovered such results, and solves a 360-year-old riddle that Faulhaber presented to his readers. It also shows that similar results hold when we express the sums in terms of central factorial powers instead of ordinary powers. Faulhaber's coefficients can moreover be generalized to factorial powers of noninteger exponents, obtaining asymptotic series for $1^{\alpha }+2^{\alpha }+...+n^{\alpha }$ in powers of $n^{-1}(n+1{)}^{-1}$.

Cited by in corpus (11)

• Geometrical aspects of the Lie Algebra S-Expansion Procedure
• Harmonic sums and polylogarithms at non-positive multi-indices
• Fast Algorithms of Bath Calculations in Simulations of Quantum System-Bath Dynamics
• Nonparametric estimation of the multivariate Spearman's footrule: a further discussion
• Level bounds for exceptional quantum subgroups in rank two
• Pseudo-inverses of difference matrices and their application to sparse signal approximation
• The Strong Maximal Rank Conjecture and higher rank Brill--Noether theory
• Continuous Approximation of the Ising Hamiltonian: Exact Ground States and Applications to Fidelity Assessment in Ising Machines
• Tight bounds on the mutual coherence of sensing matrices for Wigner D-functions on regular grids
• Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series
• Statistical static timing analysis via modern optimization lens: I. Histogram-based approach