# Number of ways of dividing $n-m$ into parts of at most size $m$

How many ways can one divide $n-m$ into parts of at most size $m$?

The only way I've thought of doing this is by summing up all the ways from parts of size $1$ to size $m$. The problem is that I don't know the size of $m$ relative to $n$.

-
I tried to fix the misleading word "partitions" and got: "Edits must be at least 6 characters; is there something else to improve in this post?" Whose idea is that "feature"??? – Phira Apr 28 '11 at 17:36
missou: This question is a bit cryptic. Can you explicitly list the ways of dividing $n-m$ into (something) of at most size $m$ for some small numbers $n$ and $m$, so that we have a better idea of what you mean? – Michael Lugo Apr 28 '11 at 19:47
I agree with Michael Lugo. Your question isn't clear. Are we looking at dividing distinguishable objects into groups? or are we looking at integer partitions with added constraints on the size of the partition? – svenkatr Apr 28 '11 at 21:35
Please give an example with small $n$ and $m$, so that we can tell whether you want to take the order of the parts into account. – Phira Apr 28 '11 at 21:40

The number of partitions of $n-m$ into parts of size at most $m$ is the coefficient of $x^{n-m}$ in $$\frac{1}{(1-x)(1-x^2)\dots(1-x^m)}.$$