You are here

An Old Algorithm for the Sums of Integer Powers

by David M. Bloom (Brooklyn College of CUNY)

This article originally appeared in:
Mathematics Magazine
December, 1993

Subject classification(s): Discrete Mathematics | Algorithms
Applicable Course(s): 3.7 Discrete Math

An algorithm to obtain \(P_k(n) = 1 + 2^k + \ldots + n^k\) once \(P_k(n - 1)\) is known

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Average: 2.9 (20 votes)