Seven students are trying out for the school soccer team, on which there are three available positions: fullback, sweeper, and goalie. Each student can only try out for one position. The first two students are trying out for fullback. The next two students are trying out for sweeper. The remaining three students are trying out for goalie. However, the fourth student will only play if the second student is also on the team, and the third student will only play if the fifth student is on the team. How many possible combinations of students are there to fill the available positions?
A 3
B 5
C 7
D 10
E 12
Seven students are trying out for the school soccer team, on
This topic has expert replies
-
- Master | Next Rank: 500 Posts
- Posts: 187
- Joined: Tue Sep 13, 2016 12:46 am
Timer
00:00
Your Answer
A
B
C
D
E
Global Stats
- fskilnik@GMATH
- GMAT Instructor
- Posts: 1449
- Joined: Sat Oct 09, 2010 2:16 pm
- Thanked: 59 times
- Followed by:33 members
$$\left. \matrix{alanforde800Maximus wrote:Seven students are trying out for the school soccer team, on which there are three available positions: fullback, sweeper, and goalie. Each student can only try out for one position. The first two students are trying out for fullback. The next two students are trying out for sweeper. The remaining three students are trying out for goalie. However, the fourth student will only play if the second student is also on the team, and the third student will only play if the fifth student is on the team. How many possible combinations of students are there to fill the available positions?
A 3
B 5
C 7
D 10
E 12
{\rm{Full}}\,\,\,{\rm{:}}\,\,\,\,{\rm{2}}\,\,{\rm{students}}\,\,\left( {A,B} \right) \hfill \cr
{\rm{Swee}}\,\,\,{\rm{:}}\,\,\,{\rm{2}}\,\,{\rm{students}}\,\,\left( {C,D} \right) \hfill \cr
{\rm{Goal}}\,\,\,{\rm{:}}\,\,\,{\rm{3}}\,\,{\rm{students}}\,\,\left( {E,F,G} \right)\,\, \hfill \cr} \right\}\,\,\,\,\,{\rm{with}}\,\,{\rm{restrictions}}\,\,\,\left\{ \matrix{
\,D\,\,\, \Rightarrow \,\,\,B\,\,\,\left( * \right) \hfill \cr
\,C\,\,\, \Rightarrow \,\,\,E\,\,\,\left( {**} \right) \hfill \cr} \right.$$
$$?\,\,\,:\,\,\,\# \,\,\left( {{\rm{Full}}\,,\,\,{\rm{Swee}}\,,\,{\rm{Goal}}} \right)\,\,{\rm{choices}}$$
$${\rm{?}}\,\,\,{\rm{:}}\,\,\,{\rm{manual}}\,\,\underline {{\rm{organized}}} \,\,{\rm{work}}\,\,{\rm{technique}}\,\,\,\,\left\{ \matrix{
\,\left( {A,C,E} \right)\,\,\,\left( {**} \right)\,\,\,1. \hfill \cr
\,\left( {A,D,{\rm{no!}}} \right)\,\,\,\left( * \right) \hfill \cr
\,\left( {B,C,E} \right)\,\,\,\left( {**} \right)\,\,\,2. \hfill \cr
\,\left( {B,D,E} \right)\,\,\,\,\left( * \right)\,\,\,\,3.\, \hfill \cr
\,\left( {B,D,F} \right)\,\,\,\,\left( * \right)\,\,\,\,4. \hfill \cr
\,\left( {B,D,G} \right)\,\,\,\,\left( * \right)\,\,\,\,5. \hfill \cr} \right.\,\,\,\,\,\,\,\,\,\,\,\, \Rightarrow \,\,\,\,\,\,\,\,\,\,? = 5$$
This solution follows the notations and rationale taught in the GMATH method.
Regards,
Fabio.
Fabio Skilnik :: GMATH method creator ( Math for the GMAT)
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
English-speakers :: https://www.gmath.net
Portuguese-speakers :: https://www.gmath.com.br
- GMATGuruNY
- GMAT Instructor
- Posts: 15539
- Joined: Tue May 25, 2010 12:04 pm
- Location: New York, NY
- Thanked: 13060 times
- Followed by:1906 members
- GMAT Score:790
To keep track of the number of options for each position, draw a TREE.alanforde800Maximus wrote:Seven students are trying out for the school soccer team, on which there are three available positions: fullback, sweeper, and goalie. Each student can only try out for one position. The first two students are trying out for fullback. The next two students are trying out for sweeper. The remaining three students are trying out for goalie. However, the fourth student will only play if the second student is also on the team, and the third student will only play if the fifth student is on the team. How many possible combinations of students are there to fill the available positions?
A 3
B 5
C 7
D 10
E 12
Start with the MOST RESTRICTED position, which is SWEEPER.
If Sweeper = 3, then Goalie = 5.
If Sweeper = 4, then Fullback = 2.
Here's the tree so far:
Now complete the tree, drawing the number of options for the remaining position in each case:
The number of ways to choose the players is equal to the number of boxed outcomes on the right.
Total ways = 5.
The correct answer is B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
GMAT/MBA Expert
- [email protected]
- Elite Legendary Member
- Posts: 10392
- Joined: Sun Jun 23, 2013 6:38 pm
- Location: Palo Alto, CA
- Thanked: 2867 times
- Followed by:511 members
- GMAT Score:800
Hi alanforde800Maximus,
This question uses what's called "Formal Logic" (a concept that you would see repeatedly on the LSAT, but rarely on the GMAT). You can answer it with some drawings and careful note-taking.
Based on the information in the prompt, we have seven players (A,B,C,D,E,F,G). We're asked for the total groups of 3 that can be formed with the following restrictions:
1) Only 1 player per position
2) A and B are trying out for fullback
C and D are trying out for sweeper
E, F and G are trying out for goalie
3) D will only play if B is also on the team
C will only play if E is also on the team
The big restrictions are in the two 'formal logic' rules....
-We can put E with ANYONE, but we can only put in C if E is ALSO there.
-We can put B with ANYONE, but we can only put in D if B is ALSO there.
By extension....
D can NEVER be with A (because then B would not be in the group)
C can NEVER be with F or G (because then E would not be in the group)
As such, there are only a few possibilities. We can have...
ACE
BCE
BDE
BDF
BDG
Final Answer: B
GMAT assassins aren't born, they're made,
Rich
This question uses what's called "Formal Logic" (a concept that you would see repeatedly on the LSAT, but rarely on the GMAT). You can answer it with some drawings and careful note-taking.
Based on the information in the prompt, we have seven players (A,B,C,D,E,F,G). We're asked for the total groups of 3 that can be formed with the following restrictions:
1) Only 1 player per position
2) A and B are trying out for fullback
C and D are trying out for sweeper
E, F and G are trying out for goalie
3) D will only play if B is also on the team
C will only play if E is also on the team
The big restrictions are in the two 'formal logic' rules....
-We can put E with ANYONE, but we can only put in C if E is ALSO there.
-We can put B with ANYONE, but we can only put in D if B is ALSO there.
By extension....
D can NEVER be with A (because then B would not be in the group)
C can NEVER be with F or G (because then E would not be in the group)
As such, there are only a few possibilities. We can have...
ACE
BCE
BDE
BDF
BDG
Final Answer: B
GMAT assassins aren't born, they're made,
Rich