Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 02 Jul 2012
Posts: 197
Location: India
GPA: 2.6
WE: Information Technology (Consulting)

In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
14 Oct 2014, 23:50
Question Stats:
55% (02:08) correct 45% (02:01) wrong based on 175 sessions
HideShow timer Statistics
In a city where all streets run easttowest, all avenues run northtosouth, and all intersections are right angles as shown below, Jenn needs to walk from the corner of 1st Street and 1st Avenue to the corner of 6th Street and 3rd Avenue. If her friend Amanda is sitting on a bench on 4th Street halfway between 1st and 2nd Avenues, and Jenn chooses her path randomly from any route that will allow her to walk exactly seven blocks to her destination, what is the probability that Jenn will walk down 4th St. past Amanda? A. 1/42 B. 1/21 C. 1/7 D. 1/3 E. 1/2 Attachment: File comment: Street Map
Street_Map.png [ 5.64 KiB  Viewed 9651 times ]
Official Answer and Stats are available only to registered users. Register/ Login.
_________________
Give KUDOS if the post helps you...




Math Expert
Joined: 02 Sep 2009
Posts: 49300

In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
15 Oct 2014, 11:46
Thoughtosphere wrote: In a city where all streets run easttowest, all avenues run northtosouth, and all intersections are right angles as shown below, Jenn needs to walk from the corner of 1st Street and 1st Avenue to the corner of 6th Street and 3rd Avenue. If her friend Amanda is sitting on a bench on 4th Street halfway between 1st and 2nd Avenues, and Jenn chooses her path randomly from any route that will allow her to walk exactly seven blocks to her destination, what is the probability that Jenn will walk down 4th St. past Amanda? A. 1/42 B. 1/21 C. 1/7 D. 1/3 E. 1/2 Jenn needs to walk from red dot to green dot in seven moves. So, she should walk 5 blocks UP and 2 blocks LEFT: UUUUULL. She can do this in 7!/(5!2!) = 21 ways, which is the number of permutations of 5 U's and 2 L's. How many roots go through the black dot? To walk from red to blue Jenn needs to walk 3 blocks UP: UUU. So, 1 way. To walk from yellow to green Jenn needs to walk 2 blocks UP and 1 blocks LEFT: UUL. She can do this in 3!/2! = 3 ways. So, only 1*3 = 3 ways pass through black dot. Probability = 3/21 = 1/7. Answer: C. Similar questions to practice: http://gmatclub.com/forum/everymorning ... 04236.htmlhttp://gmatclub.com/forum/joshhastor ... 99962.htmlhttp://gmatclub.com/forum/asperthegi ... 34453.htmlhttp://gmatclub.com/forum/patwillwalk ... 68374.htmlhttp://gmatclub.com/forum/alicialives ... 26920.htmlhttp://gmatclub.com/forum/incityathe ... 36949.htmlhttp://gmatclub.com/forum/thediagrama ... 44271.htmlhttps://gmatclub.com/forum/inacitywh ... 94692.htmlAttachment:
Untitled.png [ 6.17 KiB  Viewed 7888 times ]
_________________
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




Intern
Joined: 04 Sep 2014
Posts: 1

Re: In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
15 Oct 2014, 05:52
All routs between (1,1) to (3,6) = 7!/(2!*5!) = 21 Routs which pass 4th st. between 1st and 2nd avenue = routs between (1,1) to (1,4) * routs between (2,4) to (3,6) = 1 * (3!/(2!*1!)) = 3 the probability that Jenn will walk down 4th St. past Amanda= 3 / 21 = 1 / 7
C is correct.



Senior Manager
Joined: 02 Mar 2012
Posts: 326

Re: In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
15 Oct 2014, 08:09
hi srezar,
i get ur approach..but can u explain graphically how u found the favourble outcomes(Routs which pass 4th st. between 1st and 2nd avenue = routs between (1,1) to (1,4) * routs between (2,4) to (3,6) = 1 * (3!/(2!*1!)) = 3)??
h



Manager
Joined: 02 Jul 2012
Posts: 197
Location: India
GPA: 2.6
WE: Information Technology (Consulting)

Re: In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
15 Oct 2014, 12:13
Bunuel wrote: Thoughtosphere wrote: In a city where all streets run easttowest, all avenues run northtosouth, and all intersections are right angles as shown below, Jenn needs to walk from the corner of 1st Street and 1st Avenue to the corner of 6th Street and 3rd Avenue. If her friend Amanda is sitting on a bench on 4th Street halfway between 1st and 2nd Avenues, and Jenn chooses her path randomly from any route that will allow her to walk exactly seven blocks to her destination, what is the probability that Jenn will walk down 4th St. past Amanda? A. 1/42 B. 1/21 C. 1/7 D. 1/3 E. 1/2 Attachment: Untitled.png Jenn needs to walk from red dot to green dot in seven moves. So, she should walk 5 blocks UP and 2 blocks LEFT: UUUUULL. She can do this in 7!/(5!2!) = 21 ways, which is the number of permutations of 5 U's and 2 L's. How many roots go through the black dot? To walk from red to blue Jenn needs to walk 3 blocks UP: UUU. So, 1 way. To walk from yellow to green Jenn needs to walk 2 blocks UP and 1 blocks LEFT: UUL. She can do this in 3!/2! = 3 ways. So, only 1*3 = 3 ways pass through black dot. Probability = 3/21 = 1/7. Answer: C. Similar questions to practice: everymorningcaseywalksfromherhousetothebusstop104236.htmljoshhastorunanelectricalwirefrompointatopointb99962.htmlasperthegivenfiguretherearemanyhorizontaland134453.htmlpatwillwalkfromintersectionatointersectionbalonga68374.htmlasperthegivenfiguretherearemanyhorizontaland134453.htmlalicialivesinatownwhosestreetsareonagridsystem126920.htmlincityathestreetsarealignedinagridwheretheeast136949.htmlthediagramaboveshowsthevariouspathsalongwhichamous144271.htmlThanks a lot Bunuel, I got his one. While searching for explanations, I came across another explanation. The destination can be reached in minimum steps by going 5 up and 2 L. Thus from the 7 choices, we need to choose how can we select the 5 Ups or the two downs So, it would be \(7C5 or 7C2 = 7! / (5! * 2!)\) Thanks
_________________
Give KUDOS if the post helps you...



Manager
Joined: 02 Jul 2012
Posts: 197
Location: India
GPA: 2.6
WE: Information Technology (Consulting)

Re: In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
15 Oct 2014, 12:16
Bunuel, Thanks a lot for sharing the similar types of questions, they come as life savers  help me understand the topic well...
_________________
Give KUDOS if the post helps you...



Math Expert
Joined: 02 Sep 2009
Posts: 49300

Re: In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
30 Dec 2017, 01:00
UmangMathur wrote: In a city where all streets run easttowest, all avenues run northtosouth, and all intersections are right angles as shown below, Jenn needs to walk from the corner of 1st Street and 1st Avenue to the corner of 6th Street and 3rd Avenue. If her friend Amanda is sitting on a bench on 4th Street halfway between 1st and 2nd Avenues, and Jenn chooses her path randomly from any route that will allow her to walk exactly seven blocks to her destination, what is the probability that Jenn will walk down 4th St. past Amanda? A. 1/42 B. 1/21 C. 1/7 D. 1/3 E. 1/2 Attachment: Street_Map.png VERITAS PREP OFFICIAL SOLUTION:C. Given the diagram, you should see that Jenn will make it to her destination by traveling 5 "up" blocks (from 1st to 6th St.) and 2 "left" blocks (from 1st to 3rd Ave.). How can you find all the routes? Using permutations  how many ways would you arrange 5 up and 2 left? 7!/(5!2!), which equals 21. Then to pass Amanda, she has to go up 1st Ave. to 4th St. and make her first left there, leaving 2 "up" streets and 1 "left" street left to go after she passes Amanda. That's 3 ways of the 21 (LUU, ULU, UUL) that will take her past Amanda, for an answer of 1/7.
_________________
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



Manager
Joined: 08 Sep 2016
Posts: 116

In a city where all streets run easttowest, all avenues run northto
[#permalink]
Show Tags
07 Jan 2018, 16:24
Bunuel wrote: UmangMathur wrote: In a city where all streets run easttowest, all avenues run northtosouth, and all intersections are right angles as shown below, Jenn needs to walk from the corner of 1st Street and 1st Avenue to the corner of 6th Street and 3rd Avenue. If her friend Amanda is sitting on a bench on 4th Street halfway between 1st and 2nd Avenues, and Jenn chooses her path randomly from any route that will allow her to walk exactly seven blocks to her destination, what is the probability that Jenn will walk down 4th St. past Amanda? A. 1/42 B. 1/21 C. 1/7 D. 1/3 E. 1/2 Attachment: Street_Map.png VERITAS PREP OFFICIAL SOLUTION:C. Given the diagram, you should see that Jenn will make it to her destination by traveling 5 "up" blocks (from 1st to 6th St.) and 2 "left" blocks (from 1st to 3rd Ave.). How can you find all the routes? Using permutations  how many ways would you arrange 5 up and 2 left? 7!/(5!2!), which equals 21. Then to pass Amanda, she has to go up 1st Ave. to 4th St. and make her first left there, leaving 2 "up" streets and 1 "left" street left to go after she passes Amanda. That's 3 ways of the 21 (LUU, ULU, UUL) that will take her past Amanda, for an answer of 1/7. Hi Bunuel, I solved this problem the same way you did but I got hung up at the end. The portion of the question that says "what is the probability that Jenn will walk down 4th St. past Amanda?' confused me for a second because I mapped out the path as being NNNW which came out to 4!/3!. That would have resulted in an answer of 4/21. Do we assume that she takes the left, knowing that she is really moving half the distance to the left? If the question read "If her friend Amanda is sitting on a bench on 4th Street and 2nd Avenue" would 4/21 have been correct?




In a city where all streets run easttowest, all avenues run northto &nbs
[#permalink]
07 Jan 2018, 16:24






