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

What is the number of ways of partitioning a positive number $k\leq mn$ using non-increasing parts such that the number of parts can be at most $n$ and the value of each part can be at most $m$?

share|cite|improve this question

You are asking for the coefficients of the Gaussian or $q$-binomial coefficient. If $$ [n] := \frac{q^n-1}{q-1} $$ and $$ [n+1]! := [n+1]\cdot [n]!, \quad [0]!=1 $$ then you want the coefficient of $q^k$ in the $q$-binomial coefficient $$ \frac{[m+n]!}{[m]![n]!}. $$ There is no explicit formula. Googling on Gaussian binomial should lead to a proof.

share|cite|improve this answer

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.