Student Co-author

HMC Undergraduate

Document Type

Article

Department

Mathematics (HMC)

Publication Date

5-2011

Abstract

While formulas for the sums of kth binomial coefficients can be shown inductively or algebraically, these proofs give little insight into the combinatorics involved. We prove formulas for the sums of 3rd and 4th binomial coefficients via purely combinatorial arguments.

Comments

First published in The Fibonacci Quarterly, vol. 49, no. 2 (May 2011) by The Fibonacci Association.

This article is also available at http://www.fq.math.ca/49-2.html.

Rights Information

© 2011 The Fibonacci Association

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Share

COinS