In a numerics project, I've encountered the apparent identity

[math]\sum_{i=0}^k (-1)^i {2s-i \choose s-i} {k \choose i} = {2s-k \choose s}[/math]

where [imath](0 \leq k \leq s)[/imath].

possibly with the generalization

[math]\sum_{i=0}^k (-1)^i {n-i \choose m-i} {k \choose i} = {n-k \choose m}[/math]

Does anyone know if any of these are known identities, or failing that, a good reference to identities of this flavour?

There was a very comprehensive list of binomial identities online earlier, but it appears to have disappeared some time in January this year.

## Alternating sum of product of binomial coefficients

**Moderators:** gmalivuk, Moderators General, Prelates

### Re: Alternating sum of product of binomial coefficients

The quintessential identity of this type is Vandermonde's identity. The general technique, failing a combinatorial proof, is to look at generating functions. Vandermonde's identity, for example, is a trivial consequence of the equality of generating functions (x + 1)^n (x + 1)^m = (x + 1)^{n+m}.

### Re: Alternating sum of product of binomial coefficients

Thanks. Using generalized binomial coefficients and Vandermonde's identity did the trick.

### Who is online

Users browsing this forum: No registered users and 7 guests