Naresh has 10 friends, and he wants to invite 6 of them to a party. How many times will 3 particular friends never attend the party?
Explanation
1. Identify the given information:
Total number of friends (n) = 10
Number of friends to be invited (r) = 6
Number of particular friends who must never be invited = 3
2. Adjust the pool of friends:
Since those 3 particular friends cannot be chosen, we remove them from the total group of 10.
Remaining friends to choose from=10−3=7
3. Apply the combination formula:
Now, we need to choose 6 guests out of the remaining 7 friends. The number of ways to do this is given by the combination formula nCr or (rn):
(rn)=r!(n−r)!n!
Substituting our values (n=7 and r=6):
(67)=6!(7−6)!7!
(67)=6!×1!7×6!
(67)=7
Conclusion
There are exactly 7 times (or combinations) where those 3 particular friends will never attend the party.
Therefore, the correct option is B) 7.