Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!
11 Aug 2003, 07:42
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 0
sessions
History
Date
Time
Result
Not Attempted Yet
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?
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
11 Aug 2003, 23:52
Kudos
Bookmarks
Konstantin Lynov
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.
Answer: 20C5-17C2=15504-136=15368
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Moderators:
