Jun 19 10:00 PM PDT  11:00 PM PDT Join a FREE 1day workshop and learn how to ace the GMAT while keeping your fulltime job. Limited for the first 99 registrants. Jun 22 07:00 AM PDT  09:00 AM PDT Attend this webinar and master GMAT SC in 10 days by learning how meaning and logic can help you tackle 700+ level SC questions with ease. Jun 23 07:00 AM PDT  09:00 AM PDT Attend this webinar to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes.
Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 10 Mar 2014
Posts: 186

Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
12 Jan 2015, 23:19
Question Stats:
55% (03:02) correct 45% (02:24) wrong based on 358 sessions
HideShow timer Statistics
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
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Aug 2009
Posts: 7755

Re: Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
23 Dec 2017, 08:28
PathFinder007 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 three category.. 1) Full back  \(F_1 , F_2\).... NO restrictions 2) sweeper  \(S_3, S_4\)... \(S_3\) plays if \(G_5\) plays \(S_4\) plays if \(F_2\) plays so restrictions for BOTH 3) Goalie  \(G_5, G_6,G_7\)... No restrictions so lets look at the sweeper as the restrictions are therelet \(S_3\)play so ANY of two F and \(G_5\) in G .... so \(1*2*1=2\) ways let \(S_4\) play so \(F_2\) in F and ANY of three in G .... so \(1*1*3=3\) ways Total = 2+3=5 ways
_________________




EMPOWERgmat Instructor
Status: GMAT Assassin/CoFounder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 14351
Location: United States (CA)

Re: Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
13 Jan 2015, 00:13
Hi PathFinder007, 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 notetaking. 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: GMAT assassins aren't born, they're made, Rich
_________________
760+: Learn What GMAT Assassins Do to Score at the Highest Levels Contact Rich at: Rich.C@empowergmat.com*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****
Rich Cohen
CoFounder & GMAT Assassin
Special Offer: Save $75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee www.empowergmat.com/



Manager
Joined: 30 Apr 2017
Posts: 61

Re: Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
29 Oct 2017, 07:45
EMPOWERgmatRichC wrote: Hi PathFinder007, 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 notetaking. 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: GMAT assassins aren't born, they're made, Rich tough one! is there any algebraic solution for this? is it possible we see such a question n real Gmat???



Senior Manager
Joined: 29 Jun 2017
Posts: 451
GPA: 4
WE: Engineering (Transportation)

Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
Updated on: 23 Dec 2017, 10:34
soodia wrote: EMPOWERgmatRichC wrote: Hi PathFinder007, 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 notetaking. 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: GMAT assassins aren't born, they're made, Rich tough one! is there any algebraic solution for this? is it possible we see such a question n real Gmat??? Let me try > a1a2 for F a3a4 for S a47 for G a1 a2 a3 a4 a5 a6 a7 be the candidates { a4 will be there when a2 is there and a 3 when a5 is there => LOCK a2 and a5 in mind or paper} F S G a1a3a5,a6,a7 => 3 ways a2a4a6,a7 only => 2 ways total 5 ways  SHORT and SWEET 
_________________
Give Kudos for correct answer and/or if you like the solution.
Originally posted by sahilvijay on 23 Dec 2017, 08:10.
Last edited by sahilvijay on 23 Dec 2017, 10:34, edited 1 time in total.



Manager
Joined: 24 Sep 2018
Posts: 140

Re: Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
24 Sep 2018, 22:41
Let’s call the students A, B, C, D, E, F, and G. There are 2 options for fullback (A or B), 2 options for sweeper (C or D), and 3 options for goalie (E, F, or G). Normally that would give us 2 x 2 x 3 = 12 options. However, we have a second set of conditions. D can only play if B is used. And C will only play if E will also play. Since there are only 12 options, it’s easier to remove those that include D without B and C without E: There’s only 5 options left! ACE ACF ACG ADE ADF ADGBCE BCF BCGBDE BDF BDG If you chose (A), you may have crossed off too many options as you were going through them. If you chose (C), this is merely the sum of the original options, which is not how a combination is calculated. If you chose (D), this is still far too many options to satisfy both requirements. If you chose (E), this is the number of options had there not been additional requirements.
_________________
Please award kudos, If this post helped you in someway.



GMATH Teacher
Status: GMATH founder
Joined: 12 Oct 2010
Posts: 936

Seven students are trying out for the school soccer team, on which the
[#permalink]
Show Tags
17 Dec 2018, 04:43
PathFinder007 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
\(\left. \matrix{ {\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{:}}\,\,\,\underline {{\rm{organized}}}\,\,{\rm{manual}} \,\,{\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) Our highlevel "quant" preparation starts here: https://gmath.net




Seven students are trying out for the school soccer team, on which the
[#permalink]
17 Dec 2018, 04:43






