Occupancy theorem

Occupancy Theorem

Occupancy theorem

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

X 

All Updates


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

<math> = .</math>


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

<math> = .</math>


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 <math>15 choose 3</math>. The number of allocations where each player gets at least one card is <math>11 choose 3</math>, so the probability is <math>frac = frac</math>.

See also




Read More

No feeds found

All
Posting your question. Please wait!...


No updates available.
No messages found
Suggested Pages
Zid
Zid
Tell your friends >
about this page
 Create a new Page
for companies, colleges, celebrities or anything you like.Get updates on MyPage.
Create a new Page
 Find your friends
  Find friends on MyPage from