Balls and Urns!

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?


The answer is 150.

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.

5 solutions

Pranjal Jain
Oct 6, 2014

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 ! \frac{(m+n+p)!}{m! n!p!}

Two cases must be considered:

  • (3,1,1)

Number of ways of forming groups= 5 ! 3 ! 1 ! 1 ! 2 ! = 10 \frac{5!}{3!1!1!2!}=10

Ways of distributing the 3 groups= 10 × 3 ! = 60 10 \times 3!=\boxed{60}

  • (2,2,1)

Number of ways of forming groups= 5 ! 2 ! 2 ! 1 ! 2 ! = 15 \frac{5!}{2!2!1!2!}=15

Ways of distributing the 3 groups= 15 × 3 ! = 90 15 \times 3!=\boxed{90}

Therefore, total number of ways= 60 + 90 = 150 60+90=\boxed{150}

yes, did the same way mate. :D

Aritra Jana - 6 years, 7 months ago
Jochem Jonges
Jan 2, 2018

The total number of ways to distribute 5 distinct balls over 3 urns is 3 5 = 243 3^5=\boxed{243}

If we subtract distributions in which one or two urns remain empty, we are done. There are

  • 3 \boxed{3} distributions in which two urns remain empty
  • 3 ( 2 5 2 ) = 90 3\cdot (2^5-2) = \boxed{90} distributions in which 1 urn remains empty.

The desired number is: 243 90 3 = 150 243-90-3 = \boxed{150}

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| - | A1 \cup A2 \cup A3 | = |U| - | A1| - | A2| - | A3| \\ + | A1\cap A2 | + | A1\cap A3 | + | A2 \cap A3 | \\ - | A1 \cap A2 \cap A3 |.

U |U| = the # of distributions of the 5 distinct balls into the 3 distinct urns = 3 5 3^5

A 1 = A 2 = A 3 = 2 5 | A1 | = | A2 | = | A3 | = 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 | A1\cap A2 | = | A1\cap A3 | = | A2 \cap A3 | = 1^5 [The reason for this has been left to the reader as an exercise]

A 1 A 2 A 3 = 0 | A1 \cap A2 \cap A3 | = 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 :)

Krishna Ar - 6 years, 11 months ago

Log in to reply

Sorry, what is the product rule?

Agnishom Chattopadhyay - 6 years, 11 months ago

Log in to reply

Uhm!!!! As if you dont know this!!!!

Krishna Ar - 6 years, 11 months ago

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

Krishna Ar - 6 years, 11 months ago

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

Agnishom Chattopadhyay - 6 years, 11 months ago

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

Writo Mukherjee - 6 years, 11 months ago

Log in to reply

@Writo Mukherjee Wooh! That is hard :/

Agnishom Chattopadhyay - 6 years, 2 months ago

Could you tell us your solution? Interested to hear about your approach.

mathh mathh - 6 years, 11 months ago

Log in to reply

@mathh mathh - Hi!! My solution was more of casework based and it was using the application of combination without repetition.

Krishna Ar - 6 years, 11 months ago

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.

A Former Brilliant Member - 6 years, 2 months ago

Log in to reply

@Krishna Ar pls point out the mistake..I too did the same

Anik Mandal - 5 years, 3 months ago

Log in to reply

@Anik Mandal The mistake is that there would be some repetition which haven't been subtracted.

A Former Brilliant Member - 5 years, 2 months ago
Laurent Shorts
Feb 4, 2017

If the urn are not distinct, there would be { 5 3 } = 25 \begin{Bmatrix}5\\3\end{Bmatrix}=25 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 ! = 25 6 = 150 \begin{Bmatrix}5\\3\end{Bmatrix}·3!=25·6=\boxed{150}

Jaiveer Shekhawat
Sep 19, 2015

If you are interested in the proof, just leave a comment down here!!

jaiveer shekhawat - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...