Correct Answer - D
Since a biscuit can be given to any one of N beggars. Therefore, each biscuit can be distributed in N ways. So, the total number of ways of distributing n biscuits among N beggars is
N×N×..×N=Nn
n-times
Now, r biscuits can be given to a particular beggar in .nCr ways and the remaining (n-r) biscuits can be distributed to (N-1) beggars in (N-1)n-r ways. Thus, the number of ways in which a particular beggar receives r biscuits is
.nCr×(N-1)n-r
Hence, required probability =
.nCr×(N-1)n-r
Nn