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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

How many subordinates does Marcia have? [#permalink]

Show Tags

16 Dec 2007, 03:13

4

This post received KUDOS

27

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

95% (hard)

Question Stats:

23% (02:38) correct
77% (01:28) wrong based on 1072 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.

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.

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?

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!

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!

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)

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

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

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.

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. _________________

(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^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.

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

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. _________________

This is the kickoff for my 2016-2017 application season. After a summer of introspect and debate I have decided to relaunch my b-school application journey. Why would anyone want...

Check out this awesome article about Anderson on Poets Quants, http://poetsandquants.com/2015/01/02/uclas-anderson-school-morphs-into-a-friendly-tech-hub/ . Anderson is a great place! Sorry for the lack of updates recently. I...

Time is a weird concept. It can stretch for seemingly forever (like when you are watching the “Time to destination” clock mid-flight) and it can compress and...