MHB Count Arrangements of 16 Balls in 4 Drawers-At Least 3 Each

  • Thread starter Thread starter CStudent
  • Start date Start date
  • Tags Tags
    Count
AI Thread Summary
To determine the number of ways to distribute 16 similar balls into 4 drawers with at least 3 balls in each, start by placing 3 balls in each drawer, leaving 4 balls to distribute freely. The problem then reduces to finding the number of ways to distribute these 4 indistinguishable balls into 4 drawers without restrictions. This can be calculated using the multiset coefficient, which is represented as $$\left(\!\!\!\binom{n}{k}\!\!\!\right)$$ and is equivalent to $$\binom{n+k-1}{k}$$. Thus, the solution involves applying this formula to find the total arrangements.
CStudent
Messages
14
Reaction score
0
Hey.

* How many ways we can insert 16 similar balls to 4 drawers such that in every drawer we have at least 3 balls?

So I know we have to insert at first 3 balls to every drawer and the remainder is 4 balls.
But how can I calculate the amount of possibilities to insert 4 balls to 4 drawers without any limit?

Thanks.
 
Physics news on Phys.org
The number of ways $k$ indistinguishable balls can be put into $n$ drawers is equal to the number of multisets of cardinality, or size, $k$ consisting of $n$ distinct elements. (I explain why below.) This number is often denoted by $$\left(\!\!\!\binom{n}{k}\!\!\!\right)$$ and is called a multiset coefficient. Just like the binomial coefficient $$\binom{n}{k}$$ equals the number of subsets, or combinations in combinatorics parlance, of size $k$ taken from a set of size $n$, the multiset coefficient $$\left(\!\!\!\binom{n}{k}\!\!\!\right)$$ equals the number of multisets, or combinations with repetitions, of size $k$ whose elements come from a set of size $n$. Note that unlike the number of combinations, in the latter case $k$ can be greater than $n$ because elements in a multiset can be repeated.

There is a one-to-one correspondence between multisets of size $k$ drawn from a set of size $n$ and $n$ drawers that have $k$ balls combined inside them. For example, if $n=4$ and $k=5$, the multiset $\{1,1,3,4,4\}$ corresponds to the situation where drawer 1 has two balls, drawer 3 has one ball and drawer 4 has two balls.

Finally, $$\left(\!\!\!\binom{n}{k}\!\!\!\right)=\binom{n+k-1}{k}$$. This is explained in Wikipedia and in the linked article there.
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top