Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am trying to prove this equation directly, but so far without success (unless $B=1$).

$$\sum_{k=0}^{A} C_{A+B}^{B+k}C_{B+k-1}^{k}(-1)^{k}=1$$

I found it can be transformed into beta function, as


but is there any other more straight forward way to prove it?

share|cite|improve this question
Is $C_{m}^n$ a binomial coefficient often denoted as $\binom{m}{n}$ and having value $\frac{m!}{n!(m-n)!}$? – Dilip Sarwate Dec 30 '12 at 20:51
@DilipSarwate Yes, you are right. – Ziqian Xie Dec 30 '12 at 20:53
I found it can be transformed into beta function... Does this mean that you are able to prove this identity holds, using a beta identity? Or that you tried to prove it using a beta identity but failed? – Did Dec 30 '12 at 23:05
@did I am able to prove it that way, but I am trying to find another method. – Ziqian Xie Dec 30 '12 at 23:19
up vote 3 down vote accepted

Rewriting ${A+B\choose B+k}$ as ${A+B\choose A-k}$ and ${B+k-1\choose k}(-1)^k$ as ${-B\choose k}$, the sum on the LHS becomes $$ \sum_{k\geqslant0}{A+B\choose A-k}{-B\choose k}, $$ which is the $x^A$ term in the expansion of the product $$ (1+x)^{A+B}\cdot(1+x)^{-B}. $$ Since this product is also $(1+x)^A$, the $x^A$ term in its expansion is ${A\choose A}=1$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.