Question
Wed March 31, 2010 By: Soukarsha Dhar

permutation and combination

Expert Reply
Wed March 31, 2010

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

 

Home Work Help