A Graph Theoretic Summation of the Cubes of the First n Integers
In this Math Bite we provide a combinatorial proof of the sum of the cubes of the first n integers by counting edges in complete bipartite graphs.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Short Communication
Publication date: 2009-12-01
More about this publication?
- Mathematics Magazine presents articles and notes on undergraduate mathematical topics in a lively expository style that appeals to students and faculty throughout the undergraduate years.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Information for Advertisers
- Terms & Conditions
- MAA Journals at ingentaconnect
- MAA Store
- Ingenta Connect is not responsible for the content or availability of external websites