Five balls are to be places in three boxes. Each can hold all the five balls. In how many different ways can we place the balls so that no box remains empty, if balls are identical but boxes are different ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This solution has seriously opened my eyes! :D
Mine too!!!
I can't understand what are this gaps
Can you please explain using permutation instead of combination.
There are 3 different amounts of balls one can put in one box: 1, 2, and 3.
(This is because as the problem itself stated, no box remains empty, so the amount cannot be 0. Also it cannot be 4 or 5, because they imply that at least one box is empty.)
Therefore, there are 3! ways of arranging the balls.
Nice approach!
The balls could be placed in three boxes in the permutations of the configuration { 3 , 1 , 1 } or { 2 , 2 , 1 } = 3 + 3 = 6 .
{ 3 , 1 , 1 } means 1 s t box gets 3 balls, and, 2 n d and 3 r d box gets 1 ball each.
{ 2 , 2 , 1 } means 1 s t and 2 n d box gets 2 balls each, and 3 r d box gets 1 ball.
Since all boxes must have at least one ball in it, we can start with one ball in each box. This leaves us with 2 balls left, we can thus rephrase the question: in how many ways can we allocate 2 objects in 3 locations with repetition? That's 6.
The question is similar to finding the positive integral solutions of the equation a+b+c=5 which is simply 4C2 = 6
Problem Loading...
Note Loading...
Set Loading...
4 gaps exist between 5 balls in a row,
To separate them into 3 groups (Right, Center, Left)
We choose 2 gaps to place our separator.
make it 4 C 2 = 6