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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions
Start free 5-day trial
Read 559 reviewsTarget Test Prep

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

combination

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Legendary Member
Posts: 876
Joined: Thu Apr 10, 2008 8:14 am
Thanked: 13 times
by ketkoag » Wed Apr 08, 2009 4:45 am
A certain university will select 1 of 7 candidates eligible to fill a position in the mathematics department and 2 of 10 candidates eligible to fill 2 identical positions in the computer science department. If none of the candidates is eligible for a position in both departments, how many different sets of 3 candidates are there to fill the 3 positions?
A. 42
B. 70
C. 140
D. 165
E. 315

OA: E
Now i got the answer right. i've solved it by (10 * 9 * 7)/2.
please lemme know whether there is other way to solve it. or please lemme know any other example similar to this so that we can clear the concept thru problems.
thanks
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Legendary Member
Posts: 1035
Joined: Wed Aug 27, 2008 10:56 pmFollowed by: 1 member
Thanked: 104 times

by scoobydooby » Wed Apr 08, 2009 5:30 am
1 candidate for maths can be chosen in 7C1 or 7 ways.
2 candidates for computer sc. can be chosen in 10C2 or 45 ways.

total number of ways in which 3 candidates can be chosen is 45*7=315 ways (independent events)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 322
Joined: Fri Mar 27, 2009 3:56 pm
Thanked: 24 times
GMAT Score:710

by mike22629 » Wed Apr 08, 2009 8:45 am
Not sure if you did this, but the only way to make the calculation easier is to further simply by make the 10 in the numerator 5, and canceling out the 2 in the denominator.
Other than that, your approach is probably the fastest way.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1