Last visit was: 17 Jul 2025, 05:56 It is currently 17 Jul 2025, 05:56
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 17 Jul 2025
Posts: 102,601
Own Kudos:
Given Kudos: 98,220
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,601
Kudos: 742,141
 [12]
Kudos
Add Kudos
12
Bookmarks
Bookmark this Post
User avatar
quantumliner
Joined: 24 Apr 2016
Last visit: 26 Sep 2018
Posts: 244
Own Kudos:
753
 [2]
Given Kudos: 48
Posts: 244
Kudos: 753
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 16 Jul 2025
Posts: 21,130
Own Kudos:
26,185
 [2]
Given Kudos: 296
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 21,130
Kudos: 26,185
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Hero8888
Joined: 29 Dec 2017
Last visit: 14 Apr 2019
Posts: 301
Own Kudos:
Given Kudos: 273
Location: United States
Concentration: Marketing, Technology
GMAT 1: 630 Q44 V33
GMAT 2: 690 Q47 V37
GMAT 3: 710 Q50 V37
GPA: 3.25
WE:Marketing (Telecommunications)
GMAT 3: 710 Q50 V37
Posts: 301
Kudos: 333
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ScottTargetTestPrep
Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?

A. 120
B. 252
C. 420
D. 792
E. 1320


We need to determine the number of ways Andrew can select a team with either Maria or Nathan.

If Maria is selected for the team but Nathan is not, the team can be selected in 10C4 ways (since Maria definitely makes the team and Nathan does not):

10C4 = (10 x 9 x 8 x 7)/4! = (10 x 9 x 8 x 7)/(4 x 3 x 2 x 1) = 10 x 3 x 7 = 210 ways

Since there are an additional 210 ways in which the team could be created (with Nathan and without Maria), Andrew can select the team in 210 + 210 = 420 ways.

Answer: C

Hi,

Can you check please why I get wrong result? Here is how I calculate:
Favorable outcomes=Total outcomes-Unfavorable outcomes (when Maria and Nathan are together in the team)
Favorable outcomes=12!/7!5!-10!/3!7! (we have placed Maria and Nathan to the team of five and need to add other 3 people from the rest of 10 students) = 672

Thanks.
User avatar
GMATYoda
Joined: 24 Sep 2018
Last visit: 18 Jan 2021
Posts: 105
Own Kudos:
Given Kudos: 14
Posts: 105
Kudos: 188
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Before you even get to the restriction on this problem, first identify that it is a combination problem - the order does not matter, but rather it's just about who's on the team. So prepare to use the Combinations formula: N!/K!(N−K!)

Whenever you encounter a combinations problem with restrictions, you have two major options:

Quote:
1) Solve for the number of unrestricted combinations, then find and subtract the number of restricted combinations. Here the restricted groups are "neither Nathan nor Maria is on the team" and "both Nathan and Maria are on the same team."

Quote:
2) Solve directly for the combinations that do not violate the restriction. Here that means considering two case: Maria is on the team and Nathan is not, or Nathan is on the team and Maria is not.

For this problem, note that the calculation will be the same for both options in #2: in each case, one spot is already "spoken for," one person is no longer eligible to be part of the pool of N candidates, and 10 people are left for the 4 remaining spots. Therefore it's best on this problem to proceed by solving directly for the combinations that do not violate the restriction.

That calculation will look like:

Maria is on the team, Nathan is not: 10 candidates for 4 remaining spots = 10!/4!6!=(10×9×8×7)/(4×3×2×1)

Nathan is on the team, Maria is not: the math is the same, with 10 candidates for 4 remaining spots. This is also 210

Therefore the correct answer is the sum of those two totals, 210+210=420

Choice C is correct.
User avatar
castiel
Joined: 16 Jan 2017
Last visit: 01 Aug 2019
Posts: 10
Own Kudos:
6
 [1]
Given Kudos: 51
Posts: 10
Kudos: 6
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hero8888
ScottTargetTestPrep
Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?

A. 120
B. 252
C. 420
D. 792
E. 1320


We need to determine the number of ways Andrew can select a team with either Maria or Nathan.

If Maria is selected for the team but Nathan is not, the team can be selected in 10C4 ways (since Maria definitely makes the team and Nathan does not):

10C4 = (10 x 9 x 8 x 7)/4! = (10 x 9 x 8 x 7)/(4 x 3 x 2 x 1) = 10 x 3 x 7 = 210 ways

Since there are an additional 210 ways in which the team could be created (with Nathan and without Maria), Andrew can select the team in 210 + 210 = 420 ways.

Answer: C

Hi,

Can you check please why I get wrong result? Here is how I calculate:
Favorable outcomes=Total outcomes-Unfavorable outcomes (when Maria and Nathan are together in the team)
Favorable outcomes=12!/7!5!-10!/3!7! (we have placed Maria and Nathan to the team of five and need to add other 3 people from the rest of 10 students) = 672

Thanks.

Your Favorable outcomes also include the scenario when Nathan & Maria both are not present. So you need to subtract that as well from Total outcomes.
Favorable outcomes=12!/7!5!-10!/3!7!-10!/5!5!(when both Nathan & Maria aren't present)=420
User avatar
GMATinsight
User avatar
Major Poster
Joined: 08 Jul 2010
Last visit: 17 July 2025
Posts: 6,377
Own Kudos:
15,601
 [1]
Given Kudos: 128
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Products:
Expert
Expert reply
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
Posts: 6,377
Kudos: 15,601
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?

A. 120
B. 252
C. 420
D. 792
E. 1320

METHOD-1

Total Team of 5 out of 12 candidates = 12C5 = 792
Total Team of 5 out of 12 candidates without Maria and Nathan = 10C5 = 252
Total Team of 5 out of 12 candidates with Maria and Nathan both = 10C3 = 120

Favourable Outcomes = 792 - 252-120 = 420

Answer: Option C

METHOD-2

Total Team of 5 out of 12 candidates with Maria and without Nathan = 10C4 = 210
Total Team of 5 out of 12 candidates with Nathan and without Maria = 10C4 = 210

Favourable Outcomes = 210+210 = 420

Answer: Option C
User avatar
arnkaprx
Joined: 30 May 2023
Last visit: 21 Apr 2025
Posts: 6
Own Kudos:
Given Kudos: 97
Posts: 6
Kudos: 6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ScottTargetTestPrep
Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?

A. 120
B. 252
C. 420
D. 792
E. 1320


We need to determine the number of ways Andrew can select a team with either Maria or Nathan.

If Maria is selected for the team but Nathan is not, the team can be selected in 10C4 ways (since Maria definitely makes the team and Nathan does not):

10C4 = (10 x 9 x 8 x 7)/4! = (10 x 9 x 8 x 7)/(4 x 3 x 2 x 1) = 10 x 3 x 7 = 210 ways

Since there are an additional 210 ways in which the team could be created (with Nathan and without Maria), Andrew can select the team in 210 + 210 = 420 ways.

Answer: C




Why does simply 11C5 work here? (we can't choose from M or N, so we take one and create 5 team members from the 11 people left?)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 17 Jul 2025
Posts: 102,601
Own Kudos:
Given Kudos: 98,220
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,601
Kudos: 742,141
Kudos
Add Kudos
Bookmarks
Bookmark this Post
arnkaprx
ScottTargetTestPrep
Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?

A. 120
B. 252
C. 420
D. 792
E. 1320

We need to determine the number of ways Andrew can select a team with either Maria or Nathan.

If Maria is selected for the team but Nathan is not, the team can be selected in 10C4 ways (since Maria definitely makes the team and Nathan does not):

10C4 = (10 x 9 x 8 x 7)/4! = (10 x 9 x 8 x 7)/(4 x 3 x 2 x 1) = 10 x 3 x 7 = 210 ways

Since there are an additional 210 ways in which the team could be created (with Nathan and without Maria), Andrew can select the team in 210 + 210 = 420 ways.

Answer: C

Why does simply 11C5 work here? (we can't choose from M or N, so we take one and create 5 team members from the 11 people left?)

We need to form teams of 5, which should include either Maria without Nathan, or Nathan without Maria.

As for your question, first ask yourself: who are you excluding from the 12 students to reduce the number to 11? If it's Maria, then you can form all 5-member teams from the remaining 11 students. However, this will not include teams where Maria is present and Nathan is not, but it will include teams where both Maria and Nathan are absent (for the team where Nathan is not chosen from 11). Similarly, if you exclude Nathan to reduce the count to 11, the issue remains the same. Therefore, it's necessary to use the approaches discussed earlier in this thread.

Hope it's clear.
Moderators:
Math Expert
102601 posts
PS Forum Moderator
697 posts