Skip to main content

Paint It Black—A Combinatorial Yawp

Buy Article:

$20.00 plus tax (Refund Policy)

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?
  • 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
X
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