We are given 3 balls and 10 balls.
a. Suppose the boxes and the balls are all distinguishable. How many ways are there to put 10 balls into the boxes.
b. Suppose the boxes are indistinguishable, and the balls are also indistinguishable. How many ways are there to put 10 balls into the boxes?
Part a) is no different from asking "How many function are there from a set of ten to a set of 3"?
Originally Posted by Koeppel1
Part b) is more complicated. Here we must assume that at least one box is not empty. "How many ways can 10 be partitioned into three or fewer summonds"?
Here are some examples. .
That is not an easy task.