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

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

Combinations - from PR

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Senior | Next Rank: 100 Posts
Posts: 63
Joined: Sun May 20, 2007 10:29 am
Thanked: 3 times
by mleviko » Mon Feb 11, 2008 3:03 am
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
Smashed the GMAT: 760
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Senior | Next Rank: 100 Posts
Posts: 49
Joined: Sun Jul 01, 2007 5:56 pm
Thanked: 3 times

by smushkas » Mon Feb 11, 2008 3:25 am
This is a combination problem as you mentioned in the topic. Thus, we use the combination formula (order does not matter) to figure out what we need.
1) Programmers needed 3 out of 6 => 6! /[(6-3)! * 3!] = 120 / 6 = 20 ways
2) Managers needed 2 out of 4 => 4!/ [(4-2)! * 2!] = 12 / 2 = 6 ways

These 2 then multiplied, i.e. 20 * 6 = 120 ways of selection
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
GMAT Instructor
Posts: 1462
Joined: Thu Apr 09, 2015 9:34 amFollowed by: 22 members
Location: New York, NY
Thanked: 39 times

by Jeff@TargetTestPrep » Wed Dec 13, 2017 6:54 am
mleviko wrote: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
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1