Paint It Black—A Combinatorial Yawp

$20.00 plus tax (Refund Policy)

Buy Article:

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: February 1, 2008

More about this publication?
Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect 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