Question
Question: number of ways of distributing 21 different objects in boxes of size 3 7 11...
number of ways of distributing 21 different objects in boxes of size 3 7 11
3527160
Solution
The problem asks for the number of ways to distribute 21 different objects into three distinguishable boxes of sizes 3, 7, and 11. Since the boxes have different specified sizes, they are distinguishable.
We can solve this problem by considering the process of selecting objects for each box sequentially.
Step 1: Select 3 objects out of the 21 different objects to be placed in the box of size 3.
The number of ways to do this is given by the combination formula:
(321)=3!(21−3)!21!=3!18!21!
Step 2: From the remaining 21−3=18 objects, select 7 objects to be placed in the box of size 7.
The number of ways to do this is:
(718)=7!(18−7)!18!=7!11!18!
Step 3: The remaining 18−7=11 objects must be placed in the box of size 11.
The number of ways to do this is:
(1111)=11!(11−11)!11!=11!0!11!=1
Since the choices for each box are independent, the total number of ways to distribute the objects is the product of the number of ways at each step:
Total ways = (321)×(718)×(1111)
Total ways = 3!18!21!×7!11!18!×11!0!11!
We can see that the terms cancel out:
Total ways = 3!×7!×11!21!
This formula represents the number of ways to partition a set of 21 distinct objects into three ordered groups of sizes 3, 7, and 11. Since the boxes are distinguishable (by their sizes), assigning a specific group to a specific box of the corresponding size is a unique outcome. Thus, the number of ways to distribute the objects is indeed 3!7!11!21!.
The number of ways to distribute n distinct objects into k distinguishable boxes with capacities n1,n2,…,nk such that n1+n2+⋯+nk=n is given by the multinomial coefficient n1!n2!…nk!n!.
Here, n=21, n1=3, n2=7, n3=11. The boxes are distinguishable by their sizes.
The number of ways is 3!7!11!21!=(321)(718)(1111)=1330×2652×1=3527160.