An employer has 6 applicants for a programming...

[swerve]

An employer has 6 applicants for a programming position and 4 applicants for a manager position. If the employer must hire 3 programmers and 2 managers, what is the total number of ways the employer can make the selection?

a) 1,490
b) 132
c) 120
d) 60
e) 23

The OA is C.

Please, can any expert explain this PS question for me? I have many difficulties to understand why that is the correct answer. Thanks.

[Brent@GMATPrepNow]

An employer has 6 applicants for a programming position and 4 applicants for a manager position. If the employer must hire 3 programmers and 2 managers, what is the total number of ways the employer can make the selection?

a) 1,490
b) 132
c) 120
d) 60
e) 23

Take the task of selecting employees and break it into stages.

Stage 1: Select 3 programmers to hire
Since the order in which we select the programmers does not matter, we can use combinations.
We can select 3 programmers from 6 programmers in 6C3 ways (20 ways)
So, we can complete stage 1 in 20 ways

If anyone is interested, we have a free video on calculating combinations (like 6C3) in your head: https://www.gmatprepnow.com/module/gmat ... /video/775

You can also watch a demonstration of the FCP in action: https://www.gmatprepnow.com/module/gmat ... /video/776

Then you can try solving the following questions:

EASY
- https://www.beatthegmat.com/what-should- ... 67256.html
- https://www.beatthegmat.com/counting-pro ... 44302.html
- https://www.beatthegmat.com/picking-a-5- ... 73110.html
- https://www.beatthegmat.com/permutation- ... 57412.html
- https://www.beatthegmat.com/simple-one-t270061.html


MEDIUM
- https://www.beatthegmat.com/combinatoric ... 73194.html
- https://www.beatthegmat.com/arabian-hors ... 50703.html
- https://www.beatthegmat.com/sub-sets-pro ... 73337.html
- https://www.beatthegmat.com/combinatoric ... 73180.html
- https://www.beatthegmat.com/digits-numbers-t270127.html
- https://www.beatthegmat.com/doubt-on-sep ... 71047.html
- https://www.beatthegmat.com/combinatoric ... 67079.html


DIFFICULT
- https://www.beatthegmat.com/wonderful-p- ... 71001.html
- https://www.beatthegmat.com/permutation- ... 73915.html
- https://www.beatthegmat.com/permutation-t122873.html
- https://www.beatthegmat.com/no-two-ladie ... 75661.html
- https://www.beatthegmat.com/combinations-t123249.html


Cheers,
Brent

[Jeff@TargetTestPrep]

An employer has 6 applicants for a programming position and 4 applicants for a manager position. If the employer must hire 3 programmers and 2 managers, what is the total number of ways the employer can make the selection?

a) 1,490
b) 132
c) 120
d) 60
e) 23

The programmers can be selected in 6C3 = 6!/3![(6-3)!] = (6 x 5 x 4)/3! = (6 x 5 x 4)/(3 x 2) = 20 ways.

The managers can be selected in 4C2 = 4!/[2!(4-2)!] = (4 x 3)/2! = 6 ways.

Thus, the total number of ways to select the group is 20 x 6 = 120.

Answer: C