科研之友
微信
新浪微博
Facebook
分享链接
摘要
We give a combinatorial proof for an identity involving an alternating sum of products of multichoose numbers. In our proof, we construct a sign-reversing involution on certain ordered pairs of words, then count the leftovers. We also outline two alternative proofs, one using hypergeometric functions and the other using mechanical summation.
- 出版日期2016-2
