There are five distinct balls and three distinct urns. Each urn can contain all five balls. In how many ways can the balls be placed in the urns such that no urn remains empty?
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.
yes, did the same way mate. :D
The total number of ways to distribute 5 distinct balls over 3 urns is 3 5 = 2 4 3
If we subtract distributions in which one or two urns remain empty, we are done. There are
The desired number is: 2 4 3 − 9 0 − 3 = 1 5 0
Let property
P1 be a distribution of the balls such that urn 1 has ≥ 1 ball.
P2 be a distribution of the balls such that urn 2 has ≥ 1 ball.
P3 be a distribution of the balls such that urn 3 has ≥ 1 ball.
Let set
A1 be the set of distributions that do not have P1.
A2 be the set of distributions that do not have P2.
A3 be the set of distributions that do not have P3.
Then, we want ∣ U ∣ − ∣ A 1 ∪ A 2 ∪ A 3 ∣ = ∣ U ∣ − ∣ A 1 ∣ − ∣ A 2 ∣ − ∣ A 3 ∣ + ∣ A 1 ∩ A 2 ∣ + ∣ A 1 ∩ A 3 ∣ + ∣ A 2 ∩ A 3 ∣ − ∣ A 1 ∩ A 2 ∩ A 3 ∣ .
∣ U ∣ = the # of distributions of the 5 distinct balls into the 3 distinct urns = 3 5
∣ A 1 ∣ = ∣ A 2 ∣ = ∣ A 3 ∣ = 2 5 [The reason for this has been left to the reader as an exercise]
∣ A 1 ∩ A 2 ∣ = ∣ A 1 ∩ A 3 ∣ = ∣ A 2 ∩ A 3 ∣ = 1 5 [The reason for this has been left to the reader as an exercise]
∣ A 1 ∩ A 2 ∩ A 3 ∣ = 0 [Not possible, is it?]
Now, plug back the values to the equation above
Uhm! Good solution but you must mention the application and usage of product rule clearly instead of leaving them as exercise for readers beacuse at level-3 i dont think Many would be clear abou this :)
Log in to reply
Sorry, what is the product rule?
Ah...Now you've started writing godly solutions! Let me read through this and then vote you up...but one thing...why did u use this method when combinations without repetitions was easier? Another- did ya learn this in school? @Agnishom
Log in to reply
Casework confuses me, so I avoided it. But you have that solution, so why not post it?
The School of Life? Of course
Log in to reply
this solution is good for small distributions..see if you can find the generalised one for larger distributions . try this https://brilliant.org/community-problem/the-minimum-number-of-kings/?group=pkstOBI4KZlK&ref_id=321067
Log in to reply
@Writo Mukherjee – Wooh! That is hard :/
Could you tell us your solution? Interested to hear about your approach.
Log in to reply
@mathh mathh - Hi!! My solution was more of casework based and it was using the application of combination without repetition.
In my method can you tell me where I am wrong. @Krishna Ar @Agnishom Chattopadhyay @Pranjal Jain . N.o of ways for choosing 3 ball then arranging them = 5C2 * 3!=60.
N.o of ways of arranging the left two balls are= 3+3!=9 Therefore total number of ways of arranging = 60 * 9=540.
Log in to reply
@Krishna Ar pls point out the mistake..I too did the same
Log in to reply
@Anik Mandal The mistake is that there would be some repetition which haven't been subtracted.
If the urn are not distinct, there would be { 5 3 } = 2 5 ways to do that (see Stirling number of the second kind ).
As the urn are distinct, we can multiply by the permutations of the three urns.
{ 5 3 } ⋅ 3 ! = 2 5 ⋅ 6 = 1 5 0
If you are interested in the proof, just leave a comment down here!!
Problem Loading...
Note Loading...
Set Loading...
Group theory will help us here....
The number of ways to divide m+n+p objects into three groups having m,n, and p objects is m ! n ! p ! ( m + n + p ) !
Two cases must be considered:
Number of ways of forming groups= 3 ! 1 ! 1 ! 2 ! 5 ! = 1 0
Ways of distributing the 3 groups= 1 0 × 3 ! = 6 0
Number of ways of forming groups= 2 ! 2 ! 1 ! 2 ! 5 ! = 1 5
Ways of distributing the 3 groups= 1 5 × 3 ! = 9 0
Therefore, total number of ways= 6 0 + 9 0 = 1 5 0