|
Author |
Message |
|
TAGS:
|
|
|
CEO
Joined: 21 Jan 2007
Posts: 2797
Location: New York City
Followers: 5
Kudos [?]:
132
[0], given: 4
|
There are four distinct pairs of brothers and sisters. In [#permalink]
02 Dec 2007, 14:57
Question Stats:
0% (00:00) correct
0% (00:00) wrong based on 0 sessions
There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it?
|
|
|
|
|
|
|
Intern
Joined: 10 Aug 2007
Posts: 23
Followers: 0
Kudos [?]:
0
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
02 Dec 2007, 21:35
[quote="spider"][quote="bmwhype2"]There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it?[/quote]
Is the answer 32?[/quote]
How did you come up with 32? Could you please help explain the work?
|
|
|
|
|
|
CEO
Joined: 29 Mar 2007
Posts: 2618
Followers: 13
Kudos [?]:
142
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
03 Dec 2007, 00:22
bmwhype2 wrote: There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it?
I get 4. 8!/4!4! = 70
Then we have
BS12, BS13, BS14, BS15, BS16 1's done
BS23, BS24, BS25, BS26 2's
BS34, BS35, BS36
BS45, BS46
BS56
total 15 ways. So 15*4=60 b/c total of 4 sibling pairs.
Now we have to count BSBS amounts. 4!/2!2! = 6.
so 70-66=4
I have no idea if this is right though. Is this a made up problem or an official problem?
|
|
|
|
|
|
CEO
Joined: 21 Jan 2007
Posts: 2797
Location: New York City
Followers: 5
Kudos [?]:
132
[0], given: 4
|
|
|
|
|
|
|
CEO
Joined: 29 Mar 2007
Posts: 2618
Followers: 13
Kudos [?]:
142
[0], given: 0
|
bmwhype2 wrote:
I thought so looks a lot like Challenge 2 question 5
|
|
|
|
|
|
Manager
Joined: 13 Jun 2007
Posts: 51
Followers: 1
Kudos [?]:
2
[0], given: 0
|
8C4 - (4x6C2 - 4C2)
Explanation
8C4 includes all the combinations = 70
4x6C2 includes all the combinations which is turn includes all the two pairs twice i.e. A1A2B1B2 and B1B2A1A2
so only need to subtract once the 4C2
In this scenario brute force seems easier. I don't think i would have figured out to subtract only once the 4C2 it in the GMAT under pressure
|
|
|
|
|
|
Intern
Joined: 28 Aug 2007
Posts: 37
Followers: 0
Kudos [?]:
0
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
04 Dec 2007, 07:26
bmwhype2 wrote: There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it?
8*6*4*2 / 4! = 384/24 = 16
Just brute force it, on first place you can put 8, on second you can put 6 (excluding 1 sibling) on third you can put 4 (exclude) 2 siblings... then divide by the number of permutations as position doesnt matter.
Whats the answer?
|
|
|
|
|
|
Manager
Joined: 11 Aug 2007
Posts: 67
Followers: 1
Kudos [?]:
4
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
04 Dec 2007, 08:53
antihero wrote: bmwhype2 wrote: There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it? 8*6*4*2 / 4! = 384/24 = 16 Just brute force it, on first place you can put 8, on second you can put 6 (excluding 1 sibling) on third you can put 4 (exclude) 2 siblings... then divide by the number of permutations as position doesnt matter. Whats the answer?
yeap, the answer is 16. you can find the exact same question in challenges ( http://www.gmatclub.com/tests/m/02/#q5) but with the committee of 3
|
|
|
|
|
|
CEO
Joined: 21 Jan 2007
Posts: 2797
Location: New York City
Followers: 5
Kudos [?]:
132
[0], given: 4
|
i'm not even sure of the answer. maybe walker can help out.
4 pairs = 4*2 = 8 people total
8C4 = 8!/4!4! = 70 total outcomes
Total – unfavorable = favorable
Unfavorable outcomes
Assuming one pair of twins in the committee, we have two spaces left. Since we plugged a pair of twins in the committee, we have 8-2= 6 people to fill 2 spaces.
6C2 = 6!/2!4! = 15 ways to fill the two remaining slots
We only filled the slots with one pair, and we have to account for arrangements of the pairs. Now, we have 4 pairs. 4*15= 60 total arrangements
When we place members into the remaining slots, there may be an additional set of twins. There are 2 remaining slots to which we can fit a pair of twins. If it were one remaining slot, we cannot fit a pair of twins, so we wouldn’t have to account for duplicates.
Now we account for the number of duplicates.
# of duplicates = Total arrangements - # of unique combinations
To find the # of duplicates of twins, we need treat a pair of twins as one unit.
This means the 4 slots are really 2 slots.
Total ways of arranging four pairs of twins in two slots
4P2 = 4*3 = 12 total ways
Total # of unique combinations
Choosing two pairs out of 4 pairs
= 4C2
= 6
Therefore, # of duplicates = 12 - 6 = 6 duplicates
70 – 60 + 6 = 16
|
|
|
|
|
|
CEO
Joined: 21 Jan 2007
Posts: 2797
Location: New York City
Followers: 5
Kudos [?]:
132
[0], given: 4
|
walker wrote: N=4C4*(2C1)^4=1*2^4=16 thanks. saved me much time
_________________
You tried your best and you failed miserably. The lesson is 'never try'. -Homer Simpson
|
|
|
|
|
|
VP
Joined: 22 Nov 2007
Posts: 1108
Followers: 6
Kudos [?]:
80
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
02 Jan 2008, 04:36
I understand why is 384 upside....but why 4! downside? please help me
|
|
|
|
|
|
SVP
Joined: 07 Nov 2007
Posts: 1842
Location: New York
Followers: 20
Kudos [?]:
291
[0], given: 5
|
Re: combinatorics - siblings [#permalink]
25 Aug 2008, 14:16
bmwhype2 wrote: There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it? = (8C1*6C1*4C1*2C1)/ 4!= 16
_________________
Your attitude determines your altitude Smiling wins more friends than frowning
|
|
|
|
|
|
Director
Joined: 14 Aug 2007
Posts: 747
Followers: 6
Kudos [?]:
65
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
11 Mar 2009, 23:28
another method
The commitee of 4 , NOT having siblings can be formed in following ways:
0 Sisters and 4 brothers = 4C4 =1 + 1 sister and 3 brothers = 4C1*3C3 = 4 [ 3C3 because selected sister's brother can not be among 3 bros] + 2 sisters and 2 brothers = 4C2* 2C2 = 6 [ again 2C2 because brothers of 2 selected sisters can not be on commitee] + 3 sisters and 1 brother = 4C3* 1C1 = 4 [ only one brother whose sister is not on commitee can be selected] + 4 sisters and 0 brothers = 4C4 = 1
= 16 total ways.
|
|
|
|
|
|
Senior Manager
Joined: 08 Jan 2009
Posts: 338
Followers: 2
Kudos [?]:
42
[0], given: 5
|
Re: combinatorics - siblings [#permalink]
13 Mar 2009, 20:23
The method of selection similar to probability i Walker List : 7-t58640. Just sharing for additional info.
|
|
|
|
|
|
Senior Manager
Joined: 06 Jul 2007
Posts: 288
Followers: 3
Kudos [?]:
24
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
25 Mar 2009, 12:48
x2suresh wrote: bmwhype2 wrote: There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it? = (8C1*6C1*4C1*2C1)/ 4!= 16suresh, could you please elaborate your calculation?
|
|
|
|
|
|
Intern
Joined: 24 Aug 2009
Posts: 4
Followers: 0
Kudos [?]:
0
[0], given: 0
|
Re: combinatorics - siblings [#permalink]
28 Aug 2009, 04:25
The four distinct pairs of brothers and sisters:
Aa Bb Cc Dd
We have to choose one from each set. We can do it: 2 * 2 * 2 * 2 = 16 ways
|
|
|
|
|
|
Manager
Joined: 30 Jun 2009
Posts: 52
Followers: 1
Kudos [?]:
3
[0], given: 2
|
Re: combinatorics - siblings [#permalink]
28 Aug 2009, 05:14
I have another result...could someone tell me where my logic is false?
Total possible combinations is 70 there are only 4 combinations possible for siblings B1S1, B2S2, B3S3 and B4S4
so for me there are 70-4 = 66
Can someone comment, correct? Thx
|
|
|
|
|
|
Senior Manager
Joined: 29 Jul 2009
Posts: 316
Followers: 4
Kudos [?]:
157
[0], given: 9
|
Re: combinatorics - siblings [#permalink]
28 Aug 2009, 05:35
I approached the question in the following way
Let's say that we have four pairs = {Aa,Bb,Cc,Dd} capital letters represent the boys and small letters the girls, no offense.
A committee will be formed just by one member of each pair so the committee will be
A or a for the first person, B or b for the second and so on since you have two choices for each position 2*2*2*2 = 16 ways
|
|
|
|
|
|
Manager
Joined: 05 Jun 2009
Posts: 115
Followers: 2
Kudos [?]:
13
[0], given: 4
|
Re: combinatorics - siblings [#permalink]
04 Sep 2009, 23:47
To make a committee consist of 4 member out of 4 pair of siblings .lets say A1A2 B1B2 D1D2 E1E2 we have to select one out of each sibling pair no of selection for each pair =2c1=2 we need to select this way from each pair=2C1 (to select from A1A2) * 2C1 (to select from B1B2)*2C1 (D1D2) *2C1(E1E2) =2C1^4=2^4=16
|
|
|
|
|
|
Manager
Joined: 27 Oct 2008
Posts: 188
Followers: 1
Kudos [?]:
42
[0], given: 3
|
Re: combinatorics - siblings [#permalink]
27 Sep 2009, 21:58
There are four distinct pairs of brothers and sisters. In how many ways can a committee of 4 be formed and NOT have siblings in it?
Soln: 2C1 * 2C1 * 2C1 * 2C1 = 16 ways
|
|
|
|
|
|
|
Re: combinatorics - siblings
[#permalink]
27 Sep 2009, 21:58
|
|
|
|
|
|
|
|
|
|
|