Data is stored in $n$ memory blocks. A user reads the blocks in random order (uniform distribution). Find the probability that each block was read no more than $k$ times, provided that there were a total of $m$ readings.
$\begingroup$
$\endgroup$
2
-
3$\begingroup$ What are your thoughts? $\endgroup$– pwerthCommented Jan 21, 2019 at 20:13
-
$\begingroup$ 1 - (n * p(m - k + 1)) $\endgroup$– Aleksei SolovevCommented Jan 21, 2019 at 20:40
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
The problem seems to be equivalent to : place randomly $m$ balls into $n$ urns, find the probability that no urn has more than $k$ balls.
answered Jan 21, 2019 at 21:12