1 1 vote A man has $9$ friends: $4$ boys and $5$ girls. In how many ways can he invite them, if there have to be exactly $3$ girls in the invitees ________ Quantitative Aptitude cat2016 quantitative-aptitude permutation-combination numerical-answer + – go_editor 14.2k points 1.5k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote A man can invite exactly $3$ girls from $5$ girls $=\;^{5}C_{3} = \frac{5!}{2!3!} = \frac{5 \times 4 \times 3!}{2 \times 1 \times 3!}=10$ ways Now, boys can be invited $0,1,2,3, \text{(or)}\;4$ Number of ways boys can be invited $ = \;^{4}C_{0} + \;^{4}C_{1} + \;^{4}C_{2} + \;^{4}C_{3} + \;^{4}C_{4} = 1 + 4 + 6 + 4 +1 = 16$ ways $\therefore$ The total number of ways $ = 10 \times 16 = 160$ ways. Correct Answer $:160$ $\textbf{PS:}$ $\;^{n}C_{0} + \;^{n}C_{1} + \;^{n}C_{2} + \dots + \;^{n}C_{n} = 2^{n}$ The number of ways to pick $‘r\text{’}$ unordered element from an $‘n\text{’}$ element set is $\;^{n}C_{r} = \frac{n!}{(n-r)!r!}$ Anjana5051 answered Jan 28, 2022 • edited Jan 31, 2022 by Lakshman Bhaiya Anjana5051 12.0k points comment Share Follow 0 reply Please log in or register to add a comment.