The number of ways in which 16 sovereigns can be distrbuted among three applicants such that each applicant does not receive less than 3 sovereigns, is

The number of ways in which 13 gold coins can be distributed among three persons such that each one get at least two gold coins is

The number of ways in which 13 gold coins can be distributed among three persons such that each one gets at least two gold coins is

The number of ways in which 13 gold coins can be distributed among three persons such that each one gets at least two gold coins is

Assertion (A): The number of ways in which 4 sovereings can be given away when there are 6 applicants and any applicant may have either 0, 1, 2, 3 or 4 sovereigns is 126. Reason (R) : The number of ways that n sovereigns can be given away when there are k applicants and any applicant may have either 0,1,2,.... or n sovereigns is ""^((n+k-1))C_(k-1) . The correct answer is

The number of ways in which 52 cards can be distributed among four players, each receiving 13 cards, is

The number of ways in which 11 identical pencils can be distributed among 6 kids each receiving atleast one is

The number of ways in which 10 identical apples can be distributed among 6 children so that each child receives atleast one apple is :