Skip to main content

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

Buy Article:

$12.00 plus tax (Refund Policy)

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
No Metrics

Document Type: Short Communication

Publication date: 2009-12-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more