Question:

Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five balls. In how many ways can we place the balls so that no box remains empty?

Updated On: Jul 6, 2022
  • $50$
  • $100$
  • $150$
  • $200$
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Let the boxes be marked as $A, B$ and $C$. We have to ensure that no box remains empty and all five balls have to put in. There will be two possibilities : (i) Any two box containing one ball each and $3$ rd box containing $3$ balls. Number of ways $ = A (1) \,B(1)\,C(3) =\, ^{5}C_{1} \cdot\, ^{4}C_{1} \cdot\,^{3}C_{3} $ $= 5 \cdot 4 \cdot 1$ $ = 20$ (ii) Any two box containing $2$ balls each and third containing $1$ ball, the number of ways $ = A(2)\, B(2)\, C(1) =\, ^{5}C_{2} \cdot\, ^{3}C_{2} \cdot\, ^{1}C_{1}$ $ = 10 \times 3 \times 1 $ $= 30$ Since, the box containing $1$ ball could be any of the three boxes $A, B, C$. Hence, the required number of ways $= 30 \times 3 = 90$. Hence, total number of ways $= 60 + 90$ $ = 150$.
Was this answer helpful?
0
0

Concepts Used:

Permutations and Combinations

Permutation:

Permutation is the method or the act of arranging members of a set into an order or a sequence. 

  • In the process of rearranging the numbers, subsets of sets are created to determine all possible arrangement sequences of a single data point. 
  • A permutation is used in many events of daily life. It is used for a list of data where the data order matters.

Combination:

Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.

  • Combination refers to the combination of about n things taken k at a time without any repetition.
  • The combination is used for a group of data where the order of data does not matter.