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.
Asked
Active
Viewed 68 times
0
-
3What are your thoughts? – pwerth Jan 21 '19 at 20:13
-
1 - (n * p(m - k + 1)) – Aleksei Solovev Jan 21 '19 at 20:40