Author 
Message 
TAGS:

Hide Tags

Senior Manager
Joined: 23 Mar 2011
Posts: 434
Location: India
GPA: 2.5
WE: Operations (Hospitality and Tourism)

Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
01 Feb 2012, 11:05
Question Stats:
50% (01:16) correct 50% (01:17) wrong based on 27 sessions
HideShow timer Statistics
Alicia lives in a town whose streets are on a grid system, with all streets running eastwest or northsouth without breaks. Her school, located on a corner, lies three blocks south and three blocks east of her home, also located on a corner. If Alicia s equally likely to choose any possible path from home to school, and if she only walks south or east, what is the probability she will walk south for the first two blocks?
_________________
"When the going gets tough, the tough gets going!"
Bring ON SOME KUDOS MATES+++  Quant Notes consolidated: http://gmatclub.com/forum/consoloditedquantguidesofforummosthelpfulinpreps151067.html#p1217652 My GMAT journey begins: http://gmatclub.com/forum/mygmatjourneybegins122251.html All about Richard Ivey: http://gmatclub.com/forum/allaboutrichardivey148594.html#p1190518



Math Expert
Joined: 02 Sep 2009
Posts: 46090

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
01 Feb 2012, 11:27
sdas wrote: Alicia lives in a town whose streets are on a grid system, with all streets running eastwest or northsouth without breaks. Her school, located on a corner, lies three blocks south and three blocks east of her home, also located on a corner. If Alicia s equally likely to choose any possible path from home to school, and if she only walks south or east, what is the probability she will walk south for the first two blocks? To get to the school Alicia should walk 3 times south and 3 times east: SSSEEE. Total # of routs to the school is # of permutation of SSSEEE, which is 6!/(3!3!)=20 (# of permutations of 6 letters out of which 3 S's and 3 E's are identical); Now, we wan to count all the routs which start with {SS}. So, {SS} is fixed and then there can be any combination of the rest 4 letters SEEE. So, all possible routs which start with {SS} equal to # of permutation of SEEE, which is 4!/3!=4 (# of permutations of 4 letters out of which 3 E's). P=4/20=1/5.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Joined: 23 Mar 2011
Posts: 434
Location: India
GPA: 2.5
WE: Operations (Hospitality and Tourism)

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
01 Feb 2012, 11:46
Thanks Bunuel: the only part I was making mistake was (SS) to be considered 1 and then SEEE as 4. I was considering it as (SS) = 1 + SEEE (4) total 5. Thats why I was going wrong.
_________________
"When the going gets tough, the tough gets going!"
Bring ON SOME KUDOS MATES+++  Quant Notes consolidated: http://gmatclub.com/forum/consoloditedquantguidesofforummosthelpfulinpreps151067.html#p1217652 My GMAT journey begins: http://gmatclub.com/forum/mygmatjourneybegins122251.html All about Richard Ivey: http://gmatclub.com/forum/allaboutrichardivey148594.html#p1190518



Intern
Joined: 03 Oct 2012
Posts: 29
WE: Other (Retail Banking)

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
15 Jan 2013, 05:20
Hello,
I have a question to Bunuel. the formula you are using is Combination's formula as it is 6!/(63)!*3!, and since Alice has to choose 3 Ss and 3Es, where order does not matter, it has to be Combination. but you are saying that "Total # of routs to the school is # of permutation of SSSEEE, which is 6!/(3!3!)=20 (# of permutations of 6 letters out of which 3 S's and 3 E's are identical)"[u][/u]. can you please explain whether it should be a combination or permutation formula?
I am having hard time understanding this problem. Manhattan guide explains it with anagram grid, but I am not grasping that model. I tried to solve it using Slot Method, but could not do it. I can't really get it with combination/permutation formulas either. can you please explain it in an easier way with more details?



Intern
Joined: 10 Jun 2013
Posts: 4

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
03 Jul 2013, 06:54
A slightly lengthier method would be:
Total number of ways to go home, considering that the order order matters = Options: SSSEEE Slots :  total permutations of 6 options in 6 slots: 6P6 = 6! = 6*5*4*3*2
Total ways to select "South" in the first 2 positions and anything else in the subsequent 4 positions = Options: SS ???? Slots:  
Permutations of 3 "S" in 2 slots AND Permutations of 4 Choices in 4 slots = 3P2 * 4P4 = 3! * 4! = 3*2*4*3*2
The probability is therefore:
3P2 * 4P4  = 6P6
3*2*4*3*2  = 1/5 6*5*4*3*2



Math Expert
Joined: 02 Sep 2009
Posts: 46090

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
03 Jul 2013, 07:50



Director
Joined: 17 Dec 2012
Posts: 635
Location: India

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
03 Jul 2013, 11:23
1. Alicia can choose only the following as the first two in the path: S1 S2, E1 E2, S1 E1 and E1 S1 2. The total number of paths starting with each of the above are 4,4,6 and 6 respectively 3. Therefore the probability that Alicia chooses two south as the first two is 4/20=1/5.
_________________
Srinivasan Vaidyaraman Sravna http://www.sravnatestprep.com/bestonlinegrepreparation.php
Improve Intuition and Your Score Systematic Approaches



Intern
Joined: 15 Aug 2011
Posts: 18
Location: United States
Concentration: Marketing, Technology
Schools: HBS '16, Kellogg 1YR '15, Ross '17, Haas EWMBA '15, Tuck '16, Duke '15, Anderson '16, Darden '15, Insead '14, Said'16, Cambridge, ISB '15
GPA: 3.6
WE: Project Management (Computer Software)

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
03 Jul 2013, 14:38
nintso wrote: Hello,
I have a question to Bunuel. the formula you are using is Combination's formula as it is 6!/(63)!*3!, and since Alice has to choose 3 Ss and 3Es, where order does not matter, it has to be Combination. but you are saying that "Total # of routs to the school is # of permutation of SSSEEE, which is 6!/(3!3!)=20 (# of permutations of 6 letters out of which 3 S's and 3 E's are identical)"[u][/u]. can you please explain whether it should be a combination or permutation formula?
I am having hard time understanding this problem. Manhattan guide explains it with anagram grid, but I am not grasping that model. I tried to solve it using Slot Method, but could not do it. I can't really get it with combination/permutation formulas either. can you please explain it in an easier way with more details? I have two keywords for Permutations and combinations  Arrangement and Selection. SELECTION means  CHOOSING 1, more or nothing. ( Combinations) ARRANGEMENT means  REORGANIZING or ORDER( Permutations) In this given problem, Alice should definitely take 3 souths and 3 Easts to reach her school. But in any 'ORDER' of her choice.... ==> I need to use Permutations and not combinations formula as I hear the word 'ORDER' so calculating the total number of permutations = \(6!/3!3!\)= 20 If Alice needs to take 2 Souths first, then the remaining 4 steps  1 South and 3 Easts can be rearranged (user Permutations) in = \(4!/3!\)= 4 Probability = \(4/20 = 1/5\)
_________________
"Hit KUDOS if you like my explanation"



Intern
Joined: 30 Nov 2013
Posts: 5
Location: Netherlands
GPA: 3.4
WE: Marketing (Consumer Products)

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
02 Dec 2013, 12:16
if the order does not matter, the solution with combinatorics is correct. however, the question itself is open to argument. route has a totally different meaning  it is more identical to a decision tree rather than a problem where the 3 Ss and 3 Es are identical SSSEEE. Therefore, Manhattan GMAT should reconsider this question before using it as an example. nintso wrote: Hello,
I have a question to Bunuel. the formula you are using is Combination's formula as it is 6!/(63)!*3!, and since Alice has to choose 3 Ss and 3Es, where order does not matter, it has to be Combination. but you are saying that "Total # of routs to the school is # of permutation of SSSEEE, which is 6!/(3!3!)=20 (# of permutations of 6 letters out of which 3 S's and 3 E's are identical)"[u][/u]. can you please explain whether it should be a combination or permutation formula?
I am having hard time understanding this problem. Manhattan guide explains it with anagram grid, but I am not grasping that model. I tried to solve it using Slot Method, but could not do it. I can't really get it with combination/permutation formulas either. can you please explain it in an easier way with more details?



Intern
Joined: 21 Sep 2016
Posts: 29

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
13 Aug 2017, 01:59
I'm rusty on combinatorics, so I solves this in a way I consider easier: 1st step: the girl is leaving her home. She can either walk south or east; 3/6 = 1/2 for both ways. Since she went south, now she has two more ways to go south, or three more ways to go east. But she still has to go south, so: (3/6) * (2/5) = 6/30 = 2/10 = 1/5.
Don't know if this methodology is right, or if I was lucky to get the correct answer even though going through a wrong method, but let me know.



Intern
Joined: 18 May 2016
Posts: 27

Re: Alicia lives in a town whose streets are on a grid system [#permalink]
Show Tags
21 May 2018, 03:13
Alicia's trip involves 3 movements south (SSS) and 3 movements east (EEE). We want to know the probability that her first 2 movements are SS. This question is no different from the following:
A bag contains three marbles labeled S and three marbles labeled E. If two marbles are randomly selected from the bag, what is the probability that both are labeled S?
P(SS) = 3/6 * 2/5 = 1/5.




Re: Alicia lives in a town whose streets are on a grid system
[#permalink]
21 May 2018, 03:13






