Question 471737: Permutation and combination.
============================
In how many ways can $16 be divided among 4 beggars so the no beggar shall receive less than $3.
Please Solve.
Found 2 solutions by sudhanshu_kmr, robertb:
Answer by sudhanshu_kmr(1152)   (Show Source):
You can put this solution on YOUR website!
Firstly give $3 to each beggars, then $4 are remaining..
(note: it is assumed that there are 16 coin of $1 )
number of ways to divide $4 among 4 = 7C3 = 35
= 35 ways.
Answer by robertb(5830)  (Show Source):
You can put this solution on YOUR website! There are only 5 possibilities to distribute 16 $1 bills to 4 people:
5,4,4,3
4,4,4,4
5,5,3,3
7,3,3,3
6,3,4,3
The 1st can be done in  ways,
The 2nd can be done in only 1 way,
The 3rd can be done in  ways,
The 4th can be done in  ways,
The 5th can be done in ways,
for a total of 12 + 1 + 6 + 4 + 12 = 35 ways.
|
|
|
