A recent paper by R. Moniot investigates the problem of, given a
probability , finding a number
of red and blue balls such that, when drawing two balls without replacement, the probability of drawing
different colored balls is
.
In this paper we deepen our understanding of the case where
by finding bounds of the number of solutions for a given probability
with
and characterize “families” of probabilities that are guaranteed to have more
than two solutions. We also estimate the number of achievable probabilities in the
ranges
and
.
Finally, we show that the “recycling recurrence” only exists for
,
,
and
for .
PDF Access Denied
We have not been able to recognize your IP address
18.206.48.243
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.