abhishek31 wrote:
Hi
firas92 can you further elaborate on the below point.
"Now the remaining 13 marbles must be distributed in such a way that any one can get any share
Consider the 13 marbles being separated by 3 separators such that there are four slots in all (representing the four brothers)
*************|||
We can arrange these 16 elements in \(\frac{16!}{13!3!}\) ways = 560 ways"
Thanks.
Hi
abhishek31That is just a visualization of the formula \((n+r−1)C(r−1)\) where \(n\) identical items are distributed among \(r\) participants such that any participant may receive any number of items.
In our case, the constraint we are given is that each brother must have at least 3 marbles. How the distribution proceeds after that is not constrained in any way. Which means, once each brother has 3 marbles, we can distribute the remaining in any ratio (13-0-0-0) or (10-1-1-1) or (5-5-2-1) and so on. And remember that there is only 1 way in which we can distribute 3 marbles to each brother because the marbles are all identical.
Now I have represented the 13 marbles as *************
Now let's create 4 slots using separators ||| (each slot representing one brother) - we have to use 3 separators to make 4 slots
____Slot 1___ | ___Slot 2___ | ___Slot 3___ | ___Slot 4___The way in which the separators are inserted determines the share. (For example
*************||| = 13,0,0,0;
****|****|**|*** = 4,4,2,3;
******|*******|| = 6,7,0,0; and so on)
The above are just 3 examples of many cases. So how many ways are there to insert the separators? To calculate this, we just have to find the number of permutations involving 13 identical marbles and 3 identical separators which is given by \(\frac{16!}{13!3!}=560ways\)
Hope this is clear!
_________________