Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Johann Faulhaber and sums of powers


Author: Donald E. Knuth
Journal: Math. Comp. 61 (1993), 277-294
MSC: Primary 11B83; Secondary 01A45, 01A55, 11B57
MathSciNet review: 1197512
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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}, \ldots ,{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 noninteger exponents, obtaining asymptotic series for $ {1^\alpha } + {2^\alpha } + \cdots + {n^\alpha }$ in powers of $ {n^{ - 1}}{(n + 1)^{ - 1}}$.


References [Enhancements On Off] (What's this?)

  • [1] A. W. F. Edwards, A quick route to sums of powers, Amer. Math. Monthly 93 (1986), no. 6, 451–455. MR 843189, 10.2307/2323466
  • [2] Johann Faulhaber, Academia Algebrœ, Darinnen die miraculosische Inventiones zu den höchsten Cossen weiters continuirt und profitiert werden, call number QA154.8 F3 1631a f MATH at Stanford University Libraries, Johann Ulrich Schönigs, Augspurg [sic], 1631.
  • [3] Ira Gessel and University of South Alabama Problem Group, Problems and Solutions: Solutions of Elementary Problems: E3204, Amer. Math. Monthly 95 (1988), no. 10, 961–962. MR 1541428, 10.2307/2322404
  • [4] Ira M. Gessel and Gérard Viennot, Determinants, paths, and plane partitions, Preprint, 1989.
  • [5] Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete mathematics, Addison-Wesley Publishing Company, Advanced Book Program, Reading, MA, 1989. A foundation for computer science. MR 1001562
  • [6] C. G. J. Jacobi, De usu legitimo formulae summatoriae Maclaurinianae, J. Reine Angew. Math. 12 (1834), 263-272.
  • [7] John Riordan, Combinatorial identities, John Wiley & Sons, Inc., New York-London-Sydney, 1968. MR 0231725
  • [8] L. Tits, Sur la sommation des puissances numériques, Mathesis 37 (1923), 353-355.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11B83, 01A45, 01A55, 11B57

Retrieve articles in all journals with MSC: 11B83, 01A45, 01A55, 11B57


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1993-1197512-7
Article copyright: © Copyright 1993 American Mathematical Society