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 Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

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

Combinatorics

Expert replies
by mpaudena » Mon Oct 19, 2009 10:50 pm
A certain law firm consists of 4 senior partners and 6 junior partners. How many different groups of 3 partners can be formed in which at least one member of the group is a senior partner? (Two groups are considered different if at least one group member is different.)

Answer and explanation please. Thanks in advance.
Join the discussion
Source: — Problem Solving |

Re: Combinatorics

by papgust » Tue Oct 20, 2009 12:43 am
mpaudena wrote:A certain law firm consists of 4 senior partners and 6 junior partners. How many different groups of 3 partners can be formed in which at least one member of the group is a senior partner? (Two groups are considered different if at least one group member is different.)

Answer and explanation please. Thanks in advance.
Here's my take,

Three scenarios would arise:

1. 1 SP & 2 JP OR
2. 2 SP & 1 JP OR
3. 3 SP & 0 JP

1. 4C1 * 6C2 = 19 * 3! (For diff arrangements inside the group) = 114

2. 4C2 * 6C1 = 36 * 3! = 216
3. 4C3 * 6C0 = 4 * 3! = 24

Therefore, 114+216+24= 354.

Can you let us know the OA? Hope my approach and answer are correct.
Join the discussion

by sanjana » Tue Oct 20, 2009 12:51 am
Whenever I see the word atleast 1 I always go for the rule

P(a)=1-p(a')

In counting 1 would be the number of groups with no restriction,

Without restriction
Picking 3 from 10 ppl : 10c3 = 120

Picking 3 without any Senior partner : 6c3 = 20

No of ways with atleast 1 SP = 120-20 = 100.
Join the discussion

by papgust » Tue Oct 20, 2009 12:55 am
Sanjana,
I feel that this applies only for probability. Not sure whether it can be applied to a combinations prob.
Join the discussion

by life is a test » Tue Oct 20, 2009 7:00 am
sanjana wrote:Whenever I see the word atleast 1 I always go for the rule

P(a)=1-p(a')

In counting 1 would be the number of groups with no restriction,

Without restriction
Picking 3 from 10 ppl : 10c3 = 120

Picking 3 without any Senior partner : 6c3 = 20

No of ways with atleast 1 SP = 120-20 = 100.
I also get 100, an alternative (longer!) way if it helps:
there are 3 different ways the partners can be arranged: (1) 1S 2J, (2) 2S 1J, (3) 3S 0J
(1) is 4C1 * 6C2 = 4*15 = 60
(2) is 4C2 * 6C1 = 6*6 = 36
(3) is 4C3 = 4

(1) + (2) + (3) = 100

OA pls?
Join the discussion

by sanjana » Tue Oct 20, 2009 7:05 am
papgust wrote:Sanjana,
I feel that this applies only for probability. Not sure whether it can be applied to a combinations prob.
Definitely not.. do try it out for some problems and u will see.
Join the discussion

by mpaudena » Tue Oct 20, 2009 1:37 pm
Sorry for the delay with OA. I didn't get an email for some reason.

Any way, Sanjana is correct. It is 100.
Join the discussion

by papgust » Tue Oct 20, 2009 6:43 pm
life is a test wrote: I also get 100, an alternative (longer!) way if it helps:
there are 3 different ways the partners can be arranged: (1) 1S 2J, (2) 2S 1J, (3) 3S 0J
(1) is 4C1 * 6C2 = 4*15 = 60
(2) is 4C2 * 6C1 = 6*6 = 36
(3) is 4C3 = 4

(1) + (2) + (3) = 100

OA pls?
I've almost done the same method, but unnecessarily multiplied by 3! with each scenario. Thought we should re-arrange 3 people within the group.

In combinatorics, when do we need to re-arrange like i did for this prob and when we must not? Pls help me understand
Join the discussion

by mpaudena » Wed Oct 21, 2009 4:45 am
[/quote]

I've almost done the same method, but unnecessarily multiplied by 3! with each scenario. Thought we should re-arrange 3 people within the group.

In combinatorics, when do we need to re-arrange like i did for this prob and when we must not? Pls help me understand[/quote]

I think your confused about the parenthetical, which says that the groups are different if one member is different. Here the order of the groups is not a factor so you don't have to rearrange the three. The order would matter if the problem said something like: "each group is considered different than another depending on the order that the members are chosen." Hope that helps.
Join the discussion

by papgust » Wed Oct 21, 2009 5:45 am
Yup. I understand now. Thanks for clarifying!
Join the discussion