|
Author |
Message |
|
TAGS:
|
|
|
VP
Joined: 22 Nov 2007
Posts: 1108
Followers: 6
Kudos [?]:
80
[1] , given: 0
|
How many subordinates does Marcia Have? 1) there are between [#permalink]
 16 Dec 2007, 03:13
1
This post received
KUDOS
Question Stats:
15% (01:49) correct
84% (07:30) wrong based on 6 sessions
How many subordinates does Marcia Have?
1) there are between 200 and 500 lists she could make consisting of the names of at least 2 of her subordinates.
2) there are 28 ways that she could decide which 2 subordinates she will recommend promoting.
I found it very hard..
|
|
|
|
|
|
|
CEO
Joined: 17 Nov 2007
Posts: 3591
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 230
Kudos [?]:
1298
[0], given: 346
|
B
1. Maybe I've not understood correctly but It seems to be insufficient.
2. nC2 describes this situation.
nC2=n(n-1)/2=28 ==> n(n-1)=56 ==> n=8
|
|
|
|
|
|
CEO
Joined: 17 Nov 2007
Posts: 3591
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 230
Kudos [?]:
1298
[0], given: 346
|
really D.
first condition:
7: N=7C7+7C6+7C5+7C4+7C3+7C2=119<200
8: N=8C8+8C7+8C6+8C5+8C4+8C3+8C2= 238
9: N=9C9+9C8+9C7+9C6+9C5+9C4+9C3+9C2=504>500
 but it is a terrible way. Any shortcuts?
|
|
|
|
|
|
CEO
Joined: 29 Aug 2007
Posts: 2530
Followers: 41
Kudos [?]:
357
[0], given: 19
|
marcodonzelli wrote: How many subordinates does Marcia Have?
1) there are between 200 and 500 lists she could make consisting of the names of at least 2 of her subordinates.
2) there are 28 ways that she could decide which 2 subordinates she will recommend promoting.
I found it very hard..
1: i am not sure how st 1 is sufficient as it says 200-500 lists from at least 2 subordinates.
2: 28 ways = nc2 = n(n-1)/2 = 8x7/2 = 28
so n = 8.
so is not it B?
|
|
|
|
|
|
GMAT Instructor
Joined: 04 Jul 2006
Posts: 1278
Location: Madrid
Followers: 9
Kudos [?]:
67
[3] , given: 0
|
3
This post received
KUDOS
marcodonzelli wrote: How many subordinates does Marcia Have?
1) there are between 200 and 500 lists she could make consisting of the names of at least 2 of her subordinates.
2) there are 28 ways that she could decide which 2 subordinates she will recommend promoting.
I found it very hard..
For (1) remember that ii is often easier to count the converse of what is asked. Of the 2^n subsets of a list of n objects, how many contain less than 2 objects?
|
|
|
|
|
|
CEO
Joined: 17 Nov 2007
Posts: 3591
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 230
Kudos [?]:
1298
[0], given: 346
|
kevincan wrote: 2^n
Thanks for that! It's really simple! 
|
|
|
|
|
|
VP
Joined: 22 Nov 2007
Posts: 1108
Followers: 6
Kudos [?]:
80
[0], given: 0
|
I actually didn't catch this expalantion..I have had another explanation as well, but even this one is not clear to me.... let's exclude from the 2^n lists, the only that have only one name and the 1 that has none, so 200<2^n - n - 1<500. so we have n=8.
Why do we have to consider 2^n lists? what's that mean: the n that have only one name and the one that has none...please help me!
|
|
|
|
|
|
Manager
Joined: 21 May 2007
Posts: 120
Followers: 1
Kudos [?]:
6
[0], given: 0
|
marcodonzelli wrote: I actually didn't catch this expalantion..I have had another explanation as well, but even this one is not clear to me.... let's exclude from the 2^n lists, the only that have only one name and the 1 that has none, so 200<2^n - n - 1<500. so we have n=8.
Why do we have to consider 2^n lists? what's that mean: the n that have only one name and the one that has none...please help me!
nc0 + nc1 + nc2 + nc3 + ..... + ncn = 2^n
How? If you are familiar with Binomial expansion of (a + b)^n, substitute a=1 and b=1
http://www.mathwords.com/b/binomial_theorem.htm
|
|
|
|
|
|
Director
Joined: 03 Sep 2006
Posts: 910
Followers: 5
Kudos [?]:
29
[0], given: 33
|
marcodonzelli wrote: How many subordinates does Marcia Have?
1) there are between 200 and 500 lists she could make consisting of the names of at least 2 of her subordinates.
2) there are 28 ways that she could decide which 2 subordinates she will recommend promoting.
I found it very hard..
2) is absolutely clear.
1)...I am not even able to comprehend the statement. I am not familiar with binomials, could someone please explain the "simple logic" behind 2^n.
I do understand that...... 2^n gives the number of combinations possible for n things.
But what does it have to do with lists? what is list implying in the question? and number of lists are not fixed in the question... it says it is varying from 200 to 500 ( in case we assume that 200 and 500 are the number of combinations)
Please help!
|
|
|
|
|
|
CEO
Joined: 17 Nov 2007
Posts: 3591
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 230
Kudos [?]:
1298
[1] , given: 346
|
1
This post received
KUDOS
LM wrote: 1)...I am not even able to comprehend the statement. I am not familiar with binomials, could someone please explain the "simple logic" behind 2^n.
I do understand that...... 2^n gives the number of combinations possible for n things.
But what does it have to do with lists? what is list implying in the question? and number of lists are not fixed in the question... it says it is varying from 200 to 500 ( in case we assume that 200 and 500 are the number of combinations)
Please help!
maybe my logic will help you.
1. we have n subordinates: S={1,2,3,4....,n}
2. each subordinate may be included or not be included in a list. ( two possibilities)
3. our list we can image like a={1,0,0,1,1,0,1,0,....1} - where 1 - in the list, 1 - out of the list.
4. How many lists we can compose? N=2*2*2......2=2^n
5. N is not any number and is from set: {2^1,2^2,2^3,...,2^n,...}
6. Now, we have 2^7=128,2^8=256,2^9=512
7. we should exclude n(1-subordinate lists)+1(empty list)
8. 120, 247,502
|
|
|
|
|
|
Senior Manager
Joined: 29 Jan 2007
Posts: 455
Location: Earth
Followers: 2
Kudos [?]:
36
[1] , given: 0
|
1
This post received
KUDOS
Boy. This was cool. I guess just reading answer gave me some cool missing insights. Sounds tough for exam though. Hope, now I get it  Thanks all contributors.
|
|
|
|
|
|
Manager
Joined: 21 Jun 2009
Posts: 158
Followers: 2
Kudos [?]:
3
[0], given: 1
|
Man, this is tough! What is the source of the question?
|
|
|
|
|
|
Intern
Joined: 19 Oct 2009
Posts: 3
Followers: 0
Kudos [?]:
0
[0], given: 0
|
The answer has to be B and not D as stated. Since a range is mentioned in A. when there is a range multiple answers arise which is against DS. Hence B, unless there is some other explaination. Please provide source of the question, to judge the questions authencity
|
|
|
|
|
|
Manager
Joined: 10 Sep 2009
Posts: 120
Followers: 2
Kudos [?]:
4
[0], given: 10
|
vote for D...
wow!! a tough one !
|
|
|
|
|
|
Intern
Joined: 29 Nov 2009
Posts: 7
Followers: 0
Kudos [?]:
0
[0], given: 54
|
sapbi wrote: The answer has to be B and not D as stated. Since a range is mentioned in A. when there is a range multiple answers arise which is against DS. Hence B, unless there is some other explaination. Please provide source of the question, to judge the questions authencity You are right for most cases, but here only n = 8 fits in the range of 200 to 500, so answer is D.
|
|
|
|
|
|
Senior Manager
Joined: 22 Dec 2009
Posts: 368
Followers: 9
Kudos [?]:
136
[0], given: 47
|
walker wrote:
maybe my logic will help you.
1. we have n subordinates: S={1,2,3,4....,n}
2. each subordinate may be included or not be included in a list. ( two possibilities)
3. our list we can image like a={1,0,0,1,1,0,1,0,....1} - where 1 - in the list, 1 - out of the list.
4. How many lists we can compose? N=2*2*2......2=2^n
5. N is not any number and is from set: {2^1,2^2,2^3,...,2^n,...}
6. Now, we have 2^7=128,2^8=256,2^9=512
7. we should exclude n(1-subordinate lists)+1(empty list)
8. 120,247,502
Little lost with the logic... can you explain me in more detail... Thanks, JT
_________________
Cheers!
JT...........
If u like my post..... payback in Kudos!! 
|Do not post questions with OA|Please underline your SC questions while posting|Try posting the explanation along with your answer choice|
|For CR refer Powerscore CR Bible|For SC refer Manhattan SC Guide|
~~Better Burn Out... Than Fade Away~~
|
|
|
|
|
|
Intern
Joined: 30 Oct 2009
Posts: 4
Followers: 0
Kudos [?]:
0
[0], given: 0
|
the easiest way i cld think of was to draw a pascals triangle first
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1 ..... 256
1 9 36 84 126 126 84 36 9 1 ..... 512
(i) adding all the elements in the individual row, only the last before row fall in the 200 to 500 category, so n=8
(ii) match nC2 = 28 in the above triangle and the only row that satisfies is last before row. so n=8
So, D is the answer
Shashi
|
|
|
|
|
|
Senior Manager
Joined: 21 Jul 2009
Posts: 371
Schools: LBS, INSEAD, IMD, ISB - Anything with just 1 yr program.
Followers: 11
Kudos [?]:
74
[0], given: 22
|
This is a very very interesting problem and the best explanation I could come with is this - Imagine you have nine open slots and nine digits from 1 to 9, repetition is allowed and you can fill those slots with the digits, it gives you 9^9 entire combinations. Similarly, you have n open slots and n candidates, each candidate can either fill the slot or not. So that gives 2 possibilities for each slot. For n slots, 2^n. This is practically, all the possible combinations of filling in those slots. Now given in stmt 1 is that - all such possible combinations range between 200 and 500. So 200 < 2^n < 500. Therefore, n = 8.
_________________
I am AWESOME and it's gonna be LEGENDARY!!!
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11505
Followers: 1790
Kudos [?]:
9507
[5] , given: 826
|
5
This post received
KUDOS
BarneyStinson wrote: This is a very very interesting problem and the best explanation I could come with is this -
Imagine you have nine open slots and nine digits from 1 to 9, repetition is allowed and you can fill those slots with the digits, it gives you 9^9 entire combinations.
Similarly, you have n open slots and n candidates, each candidate can either fill the slot or not. So that gives 2 possibilities for each slot. For n slots, 2^n. This is practically, all the possible combinations of filling in those slots.
Now given in stmt 1 is that - all such possible combinations range between 200 and 500. So 200 < 2^n < 500. Therefore, n = 8. Little correction: For (2) we have \{s_1,s_2,s_3,...s_n\}. Each subordinate (s_1,s_2,s_3,...s_n) has TWO options: either to be included in the list or not. Hence total # of lists - 2^n, correct. But this number will include n lists with 1 subordinate as well 1 empty list. As the lists should contain at least 2 subordinates, then you should subtract all the lists containing only 1 subordinate and all the lists containing 0 subordinate. Lists with 1 subordinate - n: \{s_1,0,0,0...0\}, \{0,s_2,0,0,...0\}, \{0,0,s_3,0,...0\}, ... \{0,0,0...s_n\}. List with 0 subordinate - 1: \{0,0,0,...0\}So we'll get 200<2^n-n-1<500, --> n=8. Sufficient. For (1): C^2_n=28 --> \frac{n(n-1)}{2!}=28 --> n(n-1)=56 --> n=8. Sufficient. Answer: D.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Senior Manager
Joined: 21 Jul 2009
Posts: 371
Schools: LBS, INSEAD, IMD, ISB - Anything with just 1 yr program.
Followers: 11
Kudos [?]:
74
[0], given: 22
|
[quote="Bunuel"][/quote] I feel so humbled that you care for me, Math God!!!
_________________
I am AWESOME and it's gonna be LEGENDARY!!!
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
close
