It is currently 18 Jan 2018, 13:43

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# In a city where all streets run east-to-west, all avenues run north-to

Author Message
TAGS:

### Hide Tags

Current Student
Joined: 02 Jul 2012
Posts: 211

Kudos [?]: 306 [2], given: 84

Location: India
Schools: IIMC (A)
GMAT 1: 720 Q50 V38
GPA: 2.6
WE: Information Technology (Consulting)
In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

14 Oct 2014, 22:50
2
KUDOS
19
This post was
BOOKMARKED
00:00

Difficulty:

75% (hard)

Question Stats:

54% (02:12) correct 46% (02:01) wrong based on 158 sessions

### HideShow timer Statistics

In a city where all streets run east-to-west, all avenues run north-to-south, 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

[Reveal] Spoiler:
Attachment:
File comment: Street Map

Street_Map.png [ 5.64 KiB | Viewed 7690 times ]
[Reveal] Spoiler: OA

_________________

Give KUDOS if the post helps you...

Kudos [?]: 306 [2], given: 84

Intern
Joined: 03 Sep 2014
Posts: 1

Kudos [?]: 2 [0], given: 27

Re: In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

15 Oct 2014, 04:52
2
This post was
BOOKMARKED
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.

Kudos [?]: 2 [0], given: 27

Senior Manager
Joined: 02 Mar 2012
Posts: 356

Kudos [?]: 94 [0], given: 4

Schools: Schulich '16
Re: In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

15 Oct 2014, 07: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

Kudos [?]: 94 [0], given: 4

Math Expert
Joined: 02 Sep 2009
Posts: 43323

Kudos [?]: 139431 [3], given: 12790

In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

15 Oct 2014, 10:46
3
KUDOS
Expert's post
5
This post was
BOOKMARKED
Thoughtosphere wrote:

In a city where all streets run east-to-west, all avenues run north-to-south, 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.

Similar questions to practice:
http://gmatclub.com/forum/every-morning ... 04236.html
http://gmatclub.com/forum/josh-has-to-r ... 99962.html
http://gmatclub.com/forum/as-per-the-gi ... 34453.html
http://gmatclub.com/forum/pat-will-walk ... 68374.html
http://gmatclub.com/forum/alicia-lives- ... 26920.html
http://gmatclub.com/forum/in-city-a-the ... 36949.html
http://gmatclub.com/forum/the-diagram-a ... 44271.html
https://gmatclub.com/forum/in-a-city-wh ... 94692.html

[Reveal] Spoiler:
Attachment:

Untitled.png [ 6.17 KiB | Viewed 6143 times ]

_________________

Kudos [?]: 139431 [3], given: 12790

Current Student
Joined: 02 Jul 2012
Posts: 211

Kudos [?]: 306 [0], given: 84

Location: India
Schools: IIMC (A)
GMAT 1: 720 Q50 V38
GPA: 2.6
WE: Information Technology (Consulting)
Re: In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

15 Oct 2014, 11:13
Bunuel wrote:
Thoughtosphere wrote:

In a city where all streets run east-to-west, all avenues run north-to-south, 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.

Similar questions to practice:
every-morning-casey-walks-from-her-house-to-the-bus-stop-104236.html
josh-has-to-run-an-electrical-wire-from-point-a-to-point-b-99962.html
as-per-the-given-figure-there-are-many-horizontal-and-134453.html
pat-will-walk-from-intersection-a-to-intersection-b-along-a-68374.html
as-per-the-given-figure-there-are-many-horizontal-and-134453.html
alicia-lives-in-a-town-whose-streets-are-on-a-grid-system-126920.html
in-city-a-the-streets-are-aligned-in-a-grid-where-the-east-136949.html
the-diagram-above-shows-the-various-paths-along-which-a-mous-144271.html

Thanks 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...

Kudos [?]: 306 [0], given: 84

Current Student
Joined: 02 Jul 2012
Posts: 211

Kudos [?]: 306 [0], given: 84

Location: India
Schools: IIMC (A)
GMAT 1: 720 Q50 V38
GPA: 2.6
WE: Information Technology (Consulting)
Re: In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

15 Oct 2014, 11: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...

Kudos [?]: 306 [0], given: 84

Math Expert
Joined: 02 Sep 2009
Posts: 43323

Kudos [?]: 139431 [0], given: 12790

Re: In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

30 Dec 2017, 00:00
UmangMathur wrote:

In a city where all streets run east-to-west, all avenues run north-to-south, 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

[Reveal] Spoiler:
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.
_________________

Kudos [?]: 139431 [0], given: 12790

Intern
Joined: 08 Sep 2016
Posts: 16

Kudos [?]: 3 [0], given: 10

In a city where all streets run east-to-west, all avenues run north-to [#permalink]

### Show Tags

07 Jan 2018, 15:24
Bunuel wrote:
UmangMathur wrote:

In a city where all streets run east-to-west, all avenues run north-to-south, 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

[Reveal] Spoiler:
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?

Kudos [?]: 3 [0], given: 10

In a city where all streets run east-to-west, all avenues run north-to   [#permalink] 07 Jan 2018, 15:24
Display posts from previous: Sort by