Juan has 4 distinct jars and a certain number of identical balls. The number of ways that he can distribute the balls into the jars such that each jar has at least one ball is 56. How many balls does he have?
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.
( ( m , n ) ) = ( k − 1 n + k − 1 )
( ( 5 , 4 ) ) = 5 6
Therefore, one for each jar plus five extras for a total of nine.
See also multiset number or stars and bars, which is not a reference to the CSA battle flag.
Put 1 ball in each jars first, total used 4 balls.
Then there are 56 ways to put the remaining n = N-4 balls in the 4 jars.
Using the stars and bars method, putting 3 bars in n+3 slots, to distribute the remaining n balls into 4 jars.
( 3 n + 3 ) = 5 6 → ( n + 1 ) ( n + 2 ) ( n + 3 ) = 3 3 6 → n + 1 = 6
N = n + 4 = 9
This sequence appears in Pascal's triangle
Problem Loading...
Note Loading...
Set Loading...
Using the stars and bars method, we essentially have an unknown number of balls, n :
∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗ ∗
and we have to distribute 3 bars (which act as separators between the jars) in between ( n − 1 ) spaces (because there cannot be empty jars).
An example would be like so:
∗ ∣ ∗ ∗ ∣ ∗ ∗ ∗ ∗ ∣ ∗ ∗
Therefore, ( n − 1 ) choose 3 = 5 6 , so n = 9 .