Can anybody through a light on this? I am not able toget the answer.
In how many ways can we distribute "N" coins to 'K" children so that everyone gets atleast one.
thnx in advance.
should it be n!/k! ?
if not, why?
This is not a tutorial service.
You are expected to do your own research.
You should do a web search for such topics: Multi-sets or multi-selections.
Scroll down to find the discussion on multiset coefficients.