|
|
|
|
|
| Author |
Message |
![[Post New]](/templates/default/images/icon_minipost_new.gif) 2 Mar 2008 13:08:00 IST
|
|
|
Algorithm for the first question:
The students for whom there must be atleast 1 gift given are specified. So u dont need to select these 4 students. So, 6C4 doesnt come into picture.
The algorith to solve the problem is as follows:
- First distribute 9 gifts among 6 students without any restrictions
- then subtract the cases where atleast one of the 4 specified students dont get a gift. For this case, u need to use principle of inclusion and exclusion
Cheers
|
Satyaram B V,
General Secretary, Mandakini Hostel,
IIT Madras |
this reply: 0 points
(with 0 
in 0 votes ) [?]
|
|
You have to be logged on to rate
|
|
|
|
|
|
|
|
|
|
Moderation Team
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
