As the title indicates, this post is going to look at proving some binomial coefficient identities via integration.

**The first set of identities** starts with the expression

Now, evaluate this expression in two ways:

- Do the integration,
- Swap the sum and the integral, and apply the binomial theorem to the sum.

We get

By choosing different values of and we can obtain different binomial coefficient identities.

For example, using produces

(For another quick proof, see my answer to “How can I compute ?”)

With , we get

(See also the answers to “How to prove ?” André Nicolas gives a slight variation on this proof, Arturo Magidin proves the identity by manipulating properties of the binomial coefficients, and I give a probabilistic/combinatorial argument.)

If we take , we obtain

(These three examples are all from Chapter 3 of Charalambides’s *Enumerative Combinatoric*s [1]. He gives several other interesting binomial coefficient identities and discusses some different proof techniques as well.)

**Another method for proving binomial coefficient identities via integration** arises from the representation of the binomial coefficient as a beta function. The beta function is defined as The beta function also has a representation in terms of the gamma function, Thus, for integer and , we can write (Actually, this can be used to *define* the binomial coefficient for non-integer values of and . But we’ll stick with integer values of and for this post.)

The beta function representation of the binomial coefficient can sometimes lead to binomial coefficient identities, too. A beautiful example of this was recently given on math.SE by Eric Naslund. Suppose we want to find Using the beta function representation, we can rewrite this as

Now, substitute , followed by , and we obtain

Thus

For more identities involving sums of reciprocals of the central binomial coefficients, including some generating functions, see Sprugnoli’s paper [2]. (However, Sprugnoli explicitly avoids the use of integration.)

**References**

- Charalambos A. Charalambides,
*Enumerative Combinatorics*, Chapman & Hall/CRC, 2002. - Renzo Sprugnoli, “Sums of reciprocals of the central binomial coefficients,”
*Integers*6 (2006), Article A27.

Pingback: A Probabilistic Proof of a Binomial Coefficient Identity | A Narrow Margin

Pingback: Shifts, Finite Differences, and Binomial Transforms | A Narrow Margin