I have a distribution problem.
How many ways can we distribute r identical objects into n distinct boxes with at least TWO in each box?.
I know the number of total ways is C(r+n-1,r) and with at least one in each box is C(r-1,n-1).
The opposite of at least two would be at least one and none, right?. But then what if, say, one box was empty, or two boxes empty and the rest distributed accordingly?.
How many ways can we distribute r identical objects into n distinct boxes with at least TWO in each box?.
I know the number of total ways is C(r+n-1,r) and with at least one in each box is C(r-1,n-1).
The opposite of at least two would be at least one and none, right?. But then what if, say, one box was empty, or two boxes empty and the rest distributed accordingly?.