There are 6 members to be selected for a grou | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) Total number of members available $= 12$.Number of members to be selected $= 6$.Since a particular member must always be excluded,we effectively h

Vedclass · Accepted Answer

$462$

Vedclass · Answer

(C) Total number of members available $= 12$.Number of members to be selected $= 6$.Since a particular member must always be excluded,we effectively have to choose $6$ members from the remaining $(12 - 1) = 11$ members.The number of ways to select $6$ members from $11$ is given by the combination formula ${}^{n}C_{r} = \frac{n!}{r!(n-r)!}$.Substituting the values,we get ${}^{11}C_{6} = \frac{11!}{6!(11-6)!} = \frac{11!}{6! 	imes 5!}$.${}^{11}C_{6} = \frac{11 	imes 10 	imes 9 	imes 8 	imes 7 	imes 6!}{6! 	imes (5 	imes 4 	imes 3 	imes 2 	imes 1)} = \frac{11 	imes 10 	imes 9 	imes 8 	imes 7}{120} = 462$.Thus,the total number of ways is $462$.

There are $6$ members to be selected for a group to be sent abroad from a total of $12$ members. In how many ways can the selection be made such that a particular member is always excluded?

Similar Questions

If $^{2n}C_3 : ^nC_2 = 44:3$,then for which of the following values of $r$,the value of $^nC_r$ will be $15$?

If $C(n, 7) = C(n, 5)$,find $n$.

How many $4$-digit numbers are there with distinct digits?

There are $n$ white and $n$ black balls marked $1, 2, 3, ..., n$. The number of ways in which we can arrange these balls in a row so that neighbouring balls are of different colours are

Let $n(A) = 3$ and $n(B) = 3$ (where $n(S)$ denotes the number of elements in set $S$). Then,the number of subsets of $(A \times B)$ having an odd number of elements is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module