BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

To fill a number of vacancies, an employer must hire 3

Expert replies
by AAPL » Wed Aug 29, 2018 4:42 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty

Princeton Review

To fill a number of vacancies, an employer must hire 3 programmers from among 6 applicants and 2 managers from among 4 applicants. What is the total number of ways in which she can make her selection?

A. 1,490
B. 132
C. 120
D. 60
E. 23

OA C.
Join the discussion
Source: — Problem Solving |

by GMATGuruNY » Wed Aug 29, 2018 5:01 am
AAPL wrote:Princeton Review

To fill a number of vacancies, an employer must hire 3 programmers from among 6 applicants and 2 managers from among 4 applicants. What is the total number of ways in which she can make her selection?

A. 1,490
B. 132
C. 120
D. 60
E. 23
Number of ways to choose 3 programmers from 6 applicants = 6C3 = (6*5*4)/(3*2*1) = 20.
Number of ways to choose 2 managers from 4 applicants = 4C2 = (4*3)/(2*1) = 6.
To combine the options above, we multiply:
20*6 = 120.

The correct answer is C.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion

by Jeff@TargetTestPrep » Wed Sep 05, 2018 9:43 am
AAPL wrote:Princeton Review

To fill a number of vacancies, an employer must hire 3 programmers from among 6 applicants and 2 managers from among 4 applicants. What is the total number of ways in which she can make her selection?

A. 1,490
B. 132
C. 120
D. 60
E. 23
This is a combination problem since the order of selecting the applicants for each job title does not matter.

3 programmers from 6 applicants can be hired in 6C3 ways:

6C3 = 6!/3!(6-3)! = (6 x 5 x 4)/3! = (6 x 5 x 4)/(3 x 2 x 1) = 20

2 managers from 4 applicants can be hired in 4C2 ways:

4C2 = 4!/2!(4-2)! = (4 x 3)/2! = (4 x 3)/(2 x 1) = 6

Thus, the total number of ways in which she can make her selection is 20 x 6 = 120.

Answer: C

Jeffrey Miller
Head of GMAT Instruction
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews
Join the discussion