Pascal's rule

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Loniousmonk (talk | contribs) at 16:24, 18 February 2007 (k must be less than n (n-1 choose n is undefined)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, Pascal's rule is a combinatorial identity about binomial coefficients. It states that for any natural number n we have

where and is a binomial coefficient.

Combinatorial proof

Pascal's rule has an intuitive combinatorial meaning. Recall that counts in how many ways can we pick a subset with b elements out from a set with a elements. Therefore, the right side of the identity is counting how many ways can we get a k-subset out from a set with n elements.

Now, suppose you distinguish a particular element 'X' from the set with n elements. Thus, every time you choose k elements to form a subset there are two possibilities: X belongs to the chosen subset or not.

If X is in the subset, you only really need to choose k-1 more objects (since it is known that X will be in the subset) out from the remaining n-1 objects. This can be accomplished in ways.

When X is not in the subset, you need to choose all the k elements in the subset from the n-1 objects that are not X. This can be done in .

We conclude that the numbers of ways to get a k-subset from the n-set, which we know is , is also the number .

Algebraic proof

We need to show

Let us begin by writing the left-hand side as

Getting a common denominator and simplifying, we have

See also

Sources

External links

  • "Central binomial coefficient". PlanetMath.
  • "Binomial coefficient". PlanetMath.
  • "Pascal's triangle". PlanetMath.