Counting problem: Placing identical balls into unique bins with capacity constraint

I recently encountered a real-life scenario where I need to enumerate all the possible combinations. The problem could be framed as follows:

Suppose there are 14 identical balls and 5 unique bins that can hold 6 balls each. What are the total number of ways to place the 14 balls into the 5 bins?

Using a divide and conquer strategy (basically I first look at what happens when there are only 2 unique bins, then 4 unique bins, and finally 5), I manage to come up with an upper bound of 3060. But I have no idea how to handle the constraint that each bin can only hold 6 balls.

Re: Counting problem: Placing identical balls into unique bins with capacity constrai

Quote:

Originally Posted by

**light1985** I recently encountered a real-life scenario where I need to enumerate all the possible combinations. The problem could be framed as follows:

Suppose there are 14 identical balls and 5 unique bins that can hold 6 balls each. What are the total number of ways to place the 14 balls into the 5 bins?.

Look at this webpage.

The coefficient of is the actual answer.

P.S Edit

Here is a strictly *Discrete Mathematics* answer, in the "back-of-the-book" format.

.

Now WHY?

Re: Counting problem: Placing identical balls into unique bins with capacity constrai

Quote:

Originally Posted by

**Plato** Look at this webpage.
The coefficient of

is the actual answer.

P.S Edit

Here is a strictly

*Discrete Mathematics* answer, in the "back-of-the-book" format.

.

Now WHY?

Thanks, I figured out what each of the terms represents.