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

The number of partitions of n is equal to the # of the partitions of 2n divided into n parts.

I know that the number of partitions of any integer n into i parts equals the number of partitions of n with the largest part i, but do not know where to go from here, especially how to prove via bijection - any help is appreciated!

(Supp. problem in my intro. combinatorics class)

share|cite|improve this question

HINT: Let $\pi$ be a partition of $2n$ into $n$ parts. Throw away one element from each part of $\pi$, and you get a partition of $n$.

share|cite|improve this answer
Wow much simpler than what I was thinking of doing. Thanks so much! – user63101 Feb 20 '13 at 9:33
@user63101: You’re very welcome. – Brian M. Scott Feb 20 '13 at 9:34

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.