You have 12 identical urns and 6 white and 6 black balls to choose from. Now you choose two urn and fill 4 balls in these two and requirement is each urn contains at most 3 balls. After this label 1 to 10 on the rest of 10 urns. Then Choose 2 urns after labeling, remember their numbers, and destroy these 2 urns. Now labeling the number you remembered on the 2 urns you chose previously. Then put the rest 8 balls in the rest of 8 urns 1 in each urn. How many ways to do this so the 10 urns that are not destroyed can form an arrangement which is unique from one another? This gives you the same result as our original problem. If you approach with the exact sequence of events I described, it would be a bit more complicated than Dr. Peterson’s but a lot simpler than yours.
Last edited: