Re: A Question on Balls and Bins
- From: jiahao_anti-addictgamer@xxxxxxxxxxx
- Date: 16 Mar 2007 03:00:20 -0700
On 16 Mar, 17:48, nivekkos...@xxxxxxxxx wrote:
Here's a seemingly simple question about balls and bins that I've been
struggling with. I'm hoping someone can help shed some light on this
problem:
Given k balls with m BLUE balls and (m-k) RED balls. Toss them
independently and uniformly at random into n bins. What is the
probability that there are no bins with both a BLUE and a RED ball?
I can express the probability as an messy sum involving Stirling
numbers of the second kind. But I can't seem to simplify it any
further. Is there a nice way to count things to yield a nice
expression at the end? Or is there an easy way to (non-trivially)
bound this probability?
Thanks.
I think there's a mistake .
(m - k ) RED BALLS ?
.
- Follow-Ups:
- Re: A Question on Balls and Bins
- From: Nivek
- Re: A Question on Balls and Bins
- From: Denis Feldmann
- Re: A Question on Balls and Bins
- References:
- A Question on Balls and Bins
- From: nivekkoster
- A Question on Balls and Bins
- Prev by Date: Re: Question on modular algebra
- Next by Date: Re: Cantor Confusion
- Previous by thread: A Question on Balls and Bins
- Next by thread: Re: A Question on Balls and Bins
- Index(es):
Relevant Pages
|