Last visit was: 18 Nov 2025, 20:21 It is currently 18 Nov 2025, 20:21
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
marcodonzelli
Joined: 22 Nov 2007
Last visit: 22 Aug 2014
Posts: 627
Own Kudos:
3,192
 [128]
Posts: 627
Kudos: 3,192
 [128]
12
Kudos
Add Kudos
116
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
Given Kudos: 99,964
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,087
 [41]
20
Kudos
Add Kudos
21
Bookmarks
Bookmark this Post
User avatar
walker
Joined: 17 Nov 2007
Last visit: 25 May 2025
Posts: 2,398
Own Kudos:
10,717
 [20]
Given Kudos: 362
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Expert
Expert reply
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Posts: 2,398
Kudos: 10,717
 [20]
13
Kudos
Add Kudos
7
Bookmarks
Bookmark this Post
General Discussion
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 18 Apr 2022
Posts: 958
Own Kudos:
729
 [7]
Given Kudos: 6
Location: Madrid
Posts: 958
Kudos: 729
 [7]
6
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
marcodonzelli
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?
User avatar
marcodonzelli
Joined: 22 Nov 2007
Last visit: 22 Aug 2014
Posts: 627
Own Kudos:
3,192
 [2]
Posts: 627
Kudos: 3,192
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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!
User avatar
parsifal
Joined: 21 May 2007
Last visit: 10 Sep 2008
Posts: 80
Own Kudos:
113
 [5]
Posts: 80
Kudos: 113
 [5]
4
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
marcodonzelli
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
https://www.mathwords.com/b/binomial_theorem.htm
User avatar
LM
Joined: 03 Sep 2006
Last visit: 04 Apr 2015
Posts: 444
Own Kudos:
Given Kudos: 33
Posts: 444
Kudos: 7,671
Kudos
Add Kudos
Bookmarks
Bookmark this Post
marcodonzelli
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!
User avatar
BarneyStinson
Joined: 21 Jul 2009
Last visit: 24 Sep 2010
Posts: 217
Own Kudos:
500
 [1]
Given Kudos: 22
Concentration: World Domination, Finance, Political Corporatization, Marketing, Strategy
Schools:LBS, INSEAD, IMD, ISB - Anything with just 1 yr program.
Posts: 217
Kudos: 500
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
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.
User avatar
BarneyStinson
Joined: 21 Jul 2009
Last visit: 24 Sep 2010
Posts: 217
Own Kudos:
Given Kudos: 22
Concentration: World Domination, Finance, Political Corporatization, Marketing, Strategy
Schools:LBS, INSEAD, IMD, ISB - Anything with just 1 yr program.
Posts: 217
Kudos: 500
Kudos
Add Kudos
Bookmarks
Bookmark this Post
[quote="Bunuel"][/quote]

I feel so humbled that you care for me, Math God!!! :-) :-)
User avatar
akijuneja
Joined: 25 May 2013
Last visit: 21 Oct 2013
Posts: 24
Own Kudos:
Given Kudos: 16
Posts: 24
Kudos: 128
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
BarneyStinson
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^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.

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
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,087
 [1]
Given Kudos: 99,964
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,087
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
akijuneja
Bunuel
BarneyStinson
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^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.

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.
avatar
suhaschan
Joined: 10 Dec 2013
Last visit: 20 Aug 2014
Posts: 11
Own Kudos:
Given Kudos: 61
Status:Preparing for GMAT
Location: India
Concentration: Marketing, Leadership
GMAT 1: 530 Q46 V18
WE:Other (Media/Entertainment)
GMAT 1: 530 Q46 V18
Posts: 11
Kudos: 8
Kudos
Add Kudos
Bookmarks
Bookmark this Post
From 1, how did we get n(n-1)/2! ?? Shouldn't it be n!/(n-2)!*2 ?? Can someone please explain!
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 18 Nov 2025
Posts: 105,355
Own Kudos:
778,087
 [1]
Given Kudos: 99,964
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,355
Kudos: 778,087
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
suhaschan
From 1, how did we get n(n-1)/2! ?? Shouldn't it be n!/(n-2)!*2 ?? Can someone please explain!

\(C^2_n\);

\(\frac{n!}{(n-2)!*2!}\);

\(\frac{(n-2)!*(n-1)*n}{(n-2)!*2!}\);

\(\frac{n(n-1)}{2!}\).

Does this make sense?
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 15 Nov 2025
Posts: 11,238
Own Kudos:
43,696
 [16]
Given Kudos: 335
Status:Math and DI Expert
Location: India
Concentration: Human Resources, General Management
GMAT Focus 1: 735 Q90 V89 DI81
Products:
Expert
Expert reply
GMAT Focus 1: 735 Q90 V89 DI81
Posts: 11,238
Kudos: 43,696
 [16]
10
Kudos
Add Kudos
6
Bookmarks
Bookmark this Post
marcodonzelli
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.


aniket5552 reference your PM


(1) There are between 200 and 500 lists she could make consisting of the names of at least 2 of her subordinates.
So atleast 2 means, she makes list of 2 people ,3 people ... till n people..
example- say 5 people are there, so she makes a list of 2 out of 5 do 5C2, 3 out of 5 so 5C3, 4 out of 5 so 5C4 and 5 out of 5 so 5C5 people in a list
Here let the number be n, so \(nC2+nC3+nC4+....nCn\) is what we are looking for...
Now you should remember the formula \(nC0+nC1+....nCn=2^n\)
So \(nC2+nC3+....nCn=2^n-nC0-nC1=2^n-n-1\)
This is between 200 and 500....
\(2^7=128\), so take next value 8.......
\(2^8=256\) so \(2^8-8-1=256-8-1=247\) Between 200 and 500 yes
Take next value \(2^9-9-1=512-9-1=502\).. outside the range
Only 1 value that is 8
Sufficient

(2) There are 28 ways that she could decide which 2 subordinates she will recommend promoting ..
\(nC2=28......n(n-1)=28*2......n(n-1)=56=8*7\) so n =8
Sufficient

D
User avatar
wensjoe
Joined: 16 Nov 2021
Last visit: 30 May 2023
Posts: 1
Own Kudos:
1
 [1]
Given Kudos: 233
Location: France
Schools: IESE'23 (A$)
Schools: IESE'23 (A$)
Posts: 1
Kudos: 1
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
marcodonzelli
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.


Wow, I understood this question in a completely different manner :
I understood it was about the number of different lists Marcia could form using the names of her subordinates,
so something like "arranging x number of names".

Statement 1) would give : 200 < # arrangements of x names < 500

-> arranging 5 names : 5! = 120
-> arranging 6 names : 6! = 720
-> arranging 6 names with 2 subordinates sharing the same name : 6!/2! = 360 => Bingo
Therefore there are in total 6 subordinates, sufficient.

Statement 2) would just be solving :
x!/x!(x-2)! = 28
x(x-1) = 56
x = 8
sufficient
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,589
Own Kudos:
Posts: 38,589
Kudos: 1,079
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Math Expert
105355 posts
496 posts