Occupancy Theorem

Occupancy theorem

to get instant updates about 'Occupancy Theorem' on your MyPage. Meet other similar minded people. Its Free!

X

Description:
In combinatorial mathematics, the occupancy theorem states that the number of ways of putting r indistinguishable balls into n buckets is

[itex] = .[/itex]

Furthermore, the number of ways of putting r indistinguishable balls into n buckets, leaving none empty is

[itex] = .[/itex]

Applications

This has many applications in many areas where the problem can be reduced to the problem stated above.

For example:Take 12 red and 3 yellow cards, shuffle them and deal them in such a way that all the red cards before the first yellow card go to player 1, between the 1st and 2nd second yellow cards go to player 2, and so on.

Q: Find Pr(Everyone has at least 1 card)

A: The number of allocations of 12 balls (red cards) to 4 buckets (players) is [itex]15 choose 3[/itex]. The number of allocations where each player gets at least one card is [itex]11 choose 3[/itex], so the probability is [itex]frac = frac[/itex].

No feeds found

All