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

By logarithmic differentiation, one can deduce that \[ n P_n = \sum_{j=1}^n \, \sigma(j) P_{n-j} \] where $P_n$ is the $n$-th partition number, and $\sigma(j)$ the sum of the divisors of $j$.

I see there is a nice proof with generating functions here. Is there also a combinatorial proof of this identity?

share|cite|improve this question
up vote 7 down vote accepted

The left hand side counts the number of Young diagrams of size $n$ with one square marked (the shape of the diagram gives a partition, and for every shape there are $n$ choices for the square to mark). Given $j$, the number $\sigma(j)$ counts the number of ways to arrange $j$ squares in a rectangle and mark one square in the top row of the rectangle (the shape $(j/d)\times d$ corresponds to the divisor $d$ of $j$, and is counted the $d$ times, the number of columns of the rectangle).

Now extract from a marked Young diagram the rectangle formed by the row containing the marked square and all further rows of the same size; if the rectangle has size $j$, then an unmarked Young diagram with $n-j$ squares remains. Conversely given an unmarked Young diagram with $n-j$ squares and a rectangle of $j$ squares with a square marked in its top row, whose length is some divisor $d$ of $j$, insert the rectangle into the Young diagram after the rows of length${}\leq j$.

share|cite|improve this answer
Wow, very cool. Thank you Marc! – Kally Feb 11 '12 at 8:04

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.