permutation and combination

Asked by soukarshadhar2006 | 31st Mar, 2010, 09:34: AM

Expert Answer:

Each person is entitled to receive at most n - 1 prizes is equivalent to saying a person cannot get all the prizes.

Number of prizes : n

Number of candiadtes: m

Total number of ways in which prizes can be distributed in a way when a candidate can gate all the prizes is nxnxnx....n=nways.

Total number of ways in which prizes can be distributed in a way when a candidate can gate  only one prizes is  n

So required number is nm-n

 

Answered by  | 31st Mar, 2010, 10:09: AM

Queries asked on Sunday & after 7pm from Monday to Saturday will be answered after 12pm the next working day.