3i-Infotech
Company
Numerical Ability
Alligation or Mixture
In how many ways can 5 members be selected out of 10 members, so that any two particular members must always be excluded?
Read Solution (Total 6)
-
- here we have two exclude 2 from 10
then the remaining members are 8
we have to select 5 from 8
the no of ways to select 5 from 8 are 8C5
8*7*6*5*4/5*4*3*2*1=56
ans:56 ways - 8 years agoHelpfull: Yes(7) No(0)
- 2 members are excluded so 8c5
- 8 years agoHelpfull: Yes(2) No(0)
- 2 particular members are excluded so we have to select 5 out of 8 members .
that is =8C5 =56 - 8 years agoHelpfull: Yes(2) No(0)
- ans is 56
8c5=56 - 7 years agoHelpfull: Yes(1) No(0)
- direct formula
(n-k)C(r-k)
10-2C5-2
8C3=56 - 7 years agoHelpfull: Yes(0) No(1)
- here , we have to select 5 members from 10 members, in that we have to exclude 2 particular members.
so ways will be = 8c5 = 8c3 = [8*7*6]/[3*2*1] = 56. - 2 years agoHelpfull: Yes(0) No(0)
3i-Infotech Other Question