Bunuel
jatt86
1) There are 3 states and 3 students representing each state. In how many ways can 5 students be chosen such that at least one student is chosen from each state.
To choose 5 students so that atleast one student will represent each state can be done in two ways:
A. 3-1-1 (3 students from 1 state and 1 student from other two states)
3C1*3C3*3C1*3C1=27
3C1 - # of ways to choose 3-student state;
3C3 - # of ways to choose 3 students from 3-student state;
3C1 - # of ways to choose 1 student from the first 1-student state;
3C1 - # of ways to choose 1 student from the second 1-student state.
OR
B. 1-2-2 (1 student from 1 state and 2 students from other two states)
3C1*3C1*3C2*3C2=81
3C1 - # of ways to choose 1-student state;
3C1 - # of ways to choose 1 student from the 1-student state;
3C2 - # of ways to choose 2 students from the first 2-student state;
3C2 - # of ways to choose 2 students from the second 2-student state.
27+81=108.
Answer: 108.
Bunuel.
I used the same logic but can you please suggest where I am making the mistake in execution.
= Total of 5 people need to be selected
=One from each group*( selecting two people)
=one from each group*(two from same group + people of diff ex(ab,bc,ca))
=ABC(AA+BC)
=((3C1 x 3C1 x 3C1)/3) *( 3C1*2C2 +((6*4)/2))
=9*15
=135
#((3C1 x 3C1 x 3C1)/3) Selecting first three people ABC Three people from different group (divide by 3 to avoid repetition)
#3C1*2C2 Selecting remaining people two people selection of one group out of 3 * selecting 2 people out 2
# ((6*4)/2) Selecting remaining people two people (6 options for the first place *4 option for 2)/2(divided by 2 to remove repetition)