imslogic
Dear all: How would one solve two related derivative questions:
1. In how many ways can I distribute 10 identical sweets at a party among 2 or 3 friends?
2. In how many ways can 10 identical paintings be distributed between 2 collectors - Dave and Mona - if Dave should get at least 2 paintings?
Hi
KarishmaB, your expert view is always welcomed. Thank you!
Posted from my mobile deviceIn case of identical items the scenario is different.
Suppose X denote the items and we divide them with | signs. So if you need to distribute between 2 people you put 1
| If you want to distribute among 3, then keep 2 |'s like
XX | XX | X [ 1 way of distributing 5 identical items among 3 people- 2-2-1]Similarly, for distribution among n people, keep
n-1 |'s
Now, there's a beautiful explanation to figure out the number of ways in which n identical items can be distributed among r people :-Suppose n=6 and r=3
So, we shall put n X's ( 6 X's in this case) in different combinations between the (r-1) |'s ( 2 |'s)
So, there are some ways which we can think of right? Like:-
XX | XX | XX
X | XXX | XX
XXX | | XXXEmpty space means that person got nothing
But, in each possiblity, notice that the total number of X's and |'s is always constant - which is 6 X's and 2 |'s - so, total 8 items - within which there are 6 identical items of one type (X) and 2 identical items of second type (|'s)
Now, we know how to arrange those 8 items in such case, and number of ways of arranging them would be = \(\frac{8!}{6!*2!}\)
Which is in turn = 8
C2 = (n+r-1)C(r-1)So, if your question is - number of ways 10 identical items can be distributed among 2 people -- it is (10+2-1)
C(2-1) = 11C1 = 11If Dave has to get at least 2 items that makes the equation like :
(d+2)+m = 10 [ d>=0 ]
=> d+m = 8
=> so no. of ways = (8+2-1)
C(2-1)= 9C1 = 9 ways. Now you can solve your 1st queation:
In how many ways can I distribute 10 identical sweets at a party among 2 or 3 friends?
For 2 friends = 11C1 ways = 11 ways
For 3 friends = (10+3-1)C(3-1) = 12C2 = 66 ways