permutation and combination
Asked by soukarshadhar2006 | 31st Mar, 2010, 09:34: AM
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=nm ways.
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
Kindly Sign up for a personalised experience
- Ask Study Doubts
- Sample Papers
- Past Year Papers
- Textbook Solutions
Verify mobile number
Enter the OTP sent to your number