Paint It Black—A Combinatorial Yawp
Abstract:We begin by solving a problem posed from the Monthly. Show n Σ r=0 (−1)r(n r)(2n – 2r n – 1) = 0. We prove this combinatorially by pairing up objects that have an odd value of r with objects that have an even value of r. The proof, and its generalizations, lead to many new and interesting identities.
Document Type: Short Communication
Publication date: 2008-02-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