Author 
Message 
TAGS:

Hide Tags

VP
Joined: 22 Nov 2007
Posts: 1071

How many subordinates does Marcia have? [#permalink]
Show Tags
16 Dec 2007, 03:13
5
This post received KUDOS
45
This post was BOOKMARKED
Question Stats:
25% (01:35) correct 75% (01:27) wrong based on 1220 sessions
HideShow timer Statistics
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.
Official Answer and Stats are available only to registered users. Register/ Login.



CEO
Joined: 17 Nov 2007
Posts: 3525
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

B
1. Maybe I've not understood correctly but It seems to be insufficient.
2. nC2 describes this situation.
nC2=n(n1)/2=28 ==> n(n1)=56 ==> n=8



CEO
Joined: 17 Nov 2007
Posts: 3525
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

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?



SVP
Joined: 29 Aug 2007
Posts: 2457

Re: perms [#permalink]
Show Tags
16 Dec 2007, 13:08
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 200500 lists from at least 2 subordinates.
2: 28 ways = nc2 = n(n1)/2 = 8x7/2 = 28
so n = 8.
so is not it B?



GMAT Instructor
Joined: 04 Jul 2006
Posts: 1254
Location: Madrid

Re: perms [#permalink]
Show Tags
18 Dec 2007, 10:59
5
This post received KUDOS
1
This post was BOOKMARKED
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: 3525
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: perms [#permalink]
Show Tags
18 Dec 2007, 12:45
kevincan wrote: 2^n
Thanks for that! It's really simple!



VP
Joined: 22 Nov 2007
Posts: 1071

Re: perms [#permalink]
Show Tags
23 Dec 2007, 04:42
1
This post received KUDOS
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: 119

Re: perms [#permalink]
Show Tags
23 Dec 2007, 19:31
2
This post received KUDOS
1
This post was BOOKMARKED
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: 850

Re: perms [#permalink]
Show Tags
24 Dec 2007, 07:34
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: 3525
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: perms [#permalink]
Show Tags
24 Dec 2007, 08:20
10
This post received KUDOS
Expert's post
8
This post was BOOKMARKED
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(1subordinate lists)+1(empty list)
8. 120, 247,502



Senior Manager
Joined: 29 Jan 2007
Posts: 436
Location: Earth

Re: perms [#permalink]
Show Tags
14 Apr 2008, 18:14
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.



Intern
Joined: 19 Oct 2009
Posts: 3

Re: perms [#permalink]
Show Tags
20 Oct 2009, 00:45
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



Intern
Joined: 29 Nov 2009
Posts: 7

Re: perms [#permalink]
Show Tags
29 Nov 2009, 01: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.



Intern
Joined: 30 Oct 2009
Posts: 4

Re: perms [#permalink]
Show Tags
25 Feb 2010, 15:45
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: 361
Schools: LBS, INSEAD, IMD, ISB  Anything with just 1 yr program.

Re: perms [#permalink]
Show Tags
25 Feb 2010, 17:49
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!!!



Math Expert
Joined: 02 Sep 2009
Posts: 44290

How many subordinates does Marcia have? [#permalink]
Show Tags
25 Feb 2010, 18:24
13
This post received KUDOS
Expert's post
16
This post was BOOKMARKED
BarneyStinson 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.
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 as 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^nn1<500\), > \(n=8\). Sufficient. For (1): \(C^2_n=28\) > \(\frac{n(n1)}{2!}=28\) > \(n(n1)=56\) > \(n=8\). Sufficient. Answer: D.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Joined: 21 Jul 2009
Posts: 361
Schools: LBS, INSEAD, IMD, ISB  Anything with just 1 yr program.

Re: perms [#permalink]
Show Tags
25 Feb 2010, 19:19
[quote="Bunuel"][/quote] I feel so humbled that you care for me, Math God!!!
_________________
I am AWESOME and it's gonna be LEGENDARY!!!



Manager
Status: Essaying
Joined: 27 May 2010
Posts: 138
Location: Ghana
Concentration: Finance, Finance
GPA: 3.9
WE: Accounting (Education)

Re: How many subordinates does Marcia Have? 1) there are between [#permalink]
Show Tags
28 Nov 2011, 09:35
wOOW... I just learnt about Binomials from this thread thanks guys



Intern
Joined: 25 May 2013
Posts: 28

Re: perms [#permalink]
Show Tags
09 Jul 2013, 01:02
Bunuel wrote: BarneyStinson wrote: How many subordinates does Marcia Have? If (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.
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^nn1<500\), > \(n=8\). Sufficient. For (1): \(C^2_n=28\) > \(\frac{n(n1)}{2!}=28\) > \(n(n1)=56\) > \(n=8\). Sufficient. Answer: D. Hi I wanted to know how can the list be composed of zero subordinate and if there are other candidates as well who are not subordinate then answer will change. Please clarify Posted from my mobile device



Math Expert
Joined: 02 Sep 2009
Posts: 44290

Re: perms [#permalink]
Show Tags
09 Jul 2013, 01:16
akijuneja wrote: Bunuel wrote: BarneyStinson wrote: How many subordinates does Marcia Have? If (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.
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^nn1<500\), > \(n=8\). Sufficient. For (1): \(C^2_n=28\) > \(\frac{n(n1)}{2!}=28\) > \(n(n1)=56\) > \(n=8\). Sufficient. Answer: D. Hi I wanted to know how can the list be composed of zero subordinate and if there are other candidates as well who are not subordinate then answer will change. Please clarify Posted from my mobile device 2^n is the number of lists including lists with 1 subordinate and an empty set (list with 0 subordinates is an empty set, which simply means that Marcia does not have any subordinate). As for your other question, unfortunately I'm not sure I understand it.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics







Go to page
1 2
Next
[ 31 posts ]



