If `n` biscuits are distributed among `N` beggars, find the chance that a particular beggar will get `r(

In how many ways can 15 identical blankets be distributed among six beggars such that everyone gets at least one blanket and two particular beggars get equal blankets and another three particular beggars get equal blankets.

If 10 objects are distributed at random among 10 persons, then find the probability that at least one of them will not get anything.

If 10 objects are distributed at random among 10 persons, then find the probability that at least one of them will not get anything.

7 distinct toys are distributed among 4 boys in such a way that any three get each 2 toys and forth gets 3 toys. Find No of ways.

In how many ways can 21 identical blankets be distributed among three beggars so that exactly two of them get equal number of blankets.

The number of ways of distributing 12 different objects among three person such that one particular person is always getting 6 objects and the remaining two persons are getting three objects each is

STATEMENT-1 :The total number of combinations of n thing by taking some or all is 2^(n) . STATEMENT -2 : 5 identical balls can be distributed among 10 identical boxes in only one way if not more than one ball can go into a box. STATEMENT-3 : In the permutations of n things taken r at a time , the number of permutations in which m particular things occur together is ""^(n - m)P_(r - m) * ""^(r)P_(m)

Assertion: The number of non -negative integral solutions of equation x_1+x_2+x_3+………+x_n=r is "^(r+n-1)C_r , Reason: The number of ways in which r identical things can be distributed among n persons is "^(r+n-1)C_r (A) Both A and R are true and R is the correct explanation of A (B) Both A and R are true R is not the correct explanation of A (C) A is true but R is false. (D) A is false but R is true.

Number of ways in which n different prizes can be distributed among m-persons (m lt n) if each is entitled to receive atmost (n-1) prizes is

n different toys have to be distributed among n children. Find the number of ways in which these toys can be distributed so that exactly one child gets no toy.