How many ways can you distribute 10 candies among 5 kids, if each kid must get at least one candy?
Since each kid must get "at least one candy each", we therefore have them distributed in this manner:
[10 - 1] C [5 - 1] =9 C 4 =126 ways.
Distribute one candy to each kids first.
5 candies are left, and I can distribute to them in any configuration.
I have 55 = 3125 ways to do so.
Is that on purpose?
Please explain. I do not understand what you have just said.
what you did
Oh, yes. Considering only the cases that satisfy the condition is quite troublesome, so I want to make sure that each kid gets one candy at the very beginning, so there will be less constraints to consider.
anyway, how's calc going for you?
anything interesting?
I have not been online for quite a while, and I have seldom logged on this site, so I don't know what's happening here.
There are not much difference since I last logged on.
What about your studies?
+9519 
