
Archives
 October 2017
 September 2017
 August 2017
 July 2017
 June 2017
 May 2017
 April 2017
 March 2017
 February 2017
 January 2017
 December 2016
 November 2016
 October 2016
 September 2016
 August 2016
 July 2016
 June 2016
 May 2016
 April 2016
 March 2016
 February 2016
 January 2016
 December 2015
 November 2015
 October 2015
 September 2015
 August 2015
 July 2015
 June 2015
 May 2015
 April 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 May 2012
 March 2012
 February 2012
 January 2012
 December 2011
 November 2011
 October 2011

Meta
Category Archives: combinatorics
Counting Poker Hands
For this post I’m going to go through a classic exercise in combinatorics and probability; namely, proving that the standard ranking of poker hands is correct. First, here are the standard poker hands, in ranked order. Straight flush: Five cards of … Continue reading
Posted in combinatorics, probability
Leave a comment
Two Methods for Proving an Alternating Binomial Identity
Recently I gave an optional homework problem in which I asked students to prove the following binomial identity: . (Here, I’m using the Iverson bracket notation in which if P is true and if P is false.) I intended for students to … Continue reading
Posted in binomial coefficients, combinatorics
Leave a comment
A Proof of Dobinski’s Formula for Bell Numbers
Dobinski’s formula entails the following infinite series expression for the nth Bell number : In this post we’ll work through a proof of Dobinski’s formula. We’ll need four formulas: The Maclaurin series for : . The formula for converting normal powers to falling … Continue reading
Posted in Bell numbers, sequences and series, Stirling numbers
2 Comments
Integrality of the Catalan Numbers via Kummer’s Theorem
Why is the nth Catalan number, , an integer? If you know one of its combinatorial interpretations, then the answer is clear, but how do you get integrality strictly from this formula? In this post I’m going to discuss how one can … Continue reading
Tiling Proofs for the Sum of Even or OddIndexed Binomial Coefficients
Two basic identities for the binomial coefficients are contained in the equation . There are multiple ways to prove these identities (even if you restrict yourself to combinatorial proofs). In this post I’m going to discuss a tiling or … Continue reading
Posted in binomial coefficients, combinatorics
Leave a comment
Combinatorial Proofs of Two HagenRothe Identities in Concrete Mathematics
There are two binomial coefficient identities in Concrete Mathematics that have bothered me for years: They look they should have combinatorial proofs, but I couldn’t for the life of me think of what those might be. (In Concrete Mathematics they are … Continue reading
Posted in combinatorics, lattice paths
Leave a comment
Vandermonde’s Identity from the Generalized Product Rule
Vandermonde’s Identity, is one of the more famous identities involving the binomial coefficients. A standard way to prove it is with the following combinatorial argument. How many ways are there to choose a committee of size r from a group of n men … Continue reading
Posted in binomial coefficients, calculus, combinatorics
Leave a comment