There are 20 workers in a firm. Five of them are to be sent : DS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 19 Jan 2017, 20:41

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

There are 20 workers in a firm. Five of them are to be sent

Author Message
Manager
Joined: 24 Jun 2003
Posts: 91
Location: Moscow
Followers: 1

Kudos [?]: 4 [0], given: 0

There are 20 workers in a firm. Five of them are to be sent [#permalink]

Show Tags

11 Aug 2003, 06:42
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

There are 20 workers in a firm. Five of them are to be sent on a mission. How many different groups could be formed, providing president, VP and accountant of the firm can't go all together among those five people?
Manager
Joined: 24 Jun 2003
Posts: 91
Location: Moscow
Followers: 1

Kudos [?]: 4 [0], given: 0

Re: Counting methods # 16 [#permalink]

Show Tags

11 Aug 2003, 22:52
Konstantin Lynov wrote:
There are 20 workers in a firm. Five of them are to be sent on a mission. How many different groups could be formed, providing president, VP and accountant of the firm can't go all together among those five people?

Close, but not quite.

Here is an approach:
There first part of the problem is done correctly by Mciato. We do need a total number of combinations and we need to decrease it by the number of groups where the President (P), Vice President (VP) and Accountant (A) serve together (a limiting condition).

The number of the teams that VP and P would serve together on is perhaps the hardest thing in this problem. Anyway, the trick is to count on how many teams P, VP and A will be. To do this, we need to imagine the group, and the five places in it: let’s assume that P is place #1 (since the order does not really matter), VP is # 2, A is # 3, and the two other places are available to the rest (17 total), so for the for the 4th place we can have 17 candidates, and the 5th place will be offered only to the remaining 16.
Thus, the total number of groups that P, VP and A would meet is 17C2 = 16*17/2*1=136.

_________________

Respect,

KL

Re: Counting methods # 16   [#permalink] 11 Aug 2003, 22:52
Display posts from previous: Sort by