A Graph Theoretic Summation of the Cubes of the First $n$ Integers

by Joe DeMaio (Kennesaw State University) and Andy Lightcap (Kennesaw State University)

Mathematics Magazine
December, 2009

Subject classification(s): Algebra and Number Theory | Number Theory
Applicable Course(s): 4.3 Number Theory

A combinatorial proof of the sum of the cubes of the first $n$ integers is presented, by counting edges in complete bipartite graphs.

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.