You are here

Faulhaber’s Triangle

by Mohammed Torabi-Dashti

This article originally appeared in:
College Mathematics Journal
March, 2011

Subject classification(s): Discrete Mathematics | Recursion | Numbers and Computation | Patterns and Sequences | Number Patterns
Applicable Course(s): 3.7 Discrete Math

Like Pascal’s triangle, Faulhaber’s triangle is easy to draw: all you need is a little recursion.  The author demonstrates that the rows are the coefficients of polynomials representing sums of integer powers.

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.

Average: 3 (4 votes)