Events & Promotions
| Last visit was: 06 Sep 2026, 03:06 |
It is currently 06 Sep 2026, 03:06 |
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Sep 0609:30 AM EDT
-12:30 PM EST
Top scores are possible when you enroll in a powerful EA course, taught live online + 6 months access to TTP OnDemand video courses included! Perfect class schedule and easy course access for working professionals. Class starts Sundays Sept. 6, 2026.
Sep 0712:01 AM PDT
-11:59 PM PDT
On the 7th, GMAT Club Tests will be Free! Including all the Quizzes, Questions, and Tests. 12 AM - 11:59 PM PDT
Sep 0201:00 PM EDT
-11:59 PM EDT
Take 30% off all study plans with code COURSEWORK - Expires on Monday 9/7
Sep 0410:00 AM EDT
-11:59 PM EDT
We’ve worked incredibly hard to build TTP into the best test prep experience possible, and it would mean a lot to us to win Newsweek’s 2026 Readers’ Choice Award for Best Test Prep. If TTP has helped you, we’d be incredibly grateful for your vote.- Sep 07
10:00 AM PDT
-11:00 AM PDT
A complete walkthrough of GMAT Club’s free 12-week GMAT study plan: what you study each week, how progress and goals are tracked, how the error log works, and how your practice unlocks paid tools at no cost. - Sep 09
07:00 AM PDT
-10:00 AM PDT
Meet AdComs and explore top Master’s programs - MiM, MiF, MSc, MSBA and more. - Application Fee Waivers - Free 1-Week of GMAT Club Tests: - Master's Application Toolkit - Grand Prize Giveaway - Sep 09
10:00 AM PDT
-11:00 AM PDT
Three MBA applications. Three rejections. No interview invites. A year later, Aman was admitted to Cambridge Judge, SMU, and IMD. In this episode of MBA Admit Stories, Aman shares how he rebuilt his MBA application... 
Sep 1507:00 PM EDT
-09:00 PM EST
Elite scores are possible when you enroll in a powerful GMAT course, taught live online + 6 months access to TTP OnDemand video courses included! Class starts Tues/Thurs Sept. 15, 2026 - Nov. 15, 2027, 7:00pm-9:00pm EST
Sep 2108:00 PM EDT
-10:00 PM EDT
Boost your GMAT score in less than one month in a live online class + 6 months access to TTP OnDemand video courses included! Class starts Mon, Tues, Wed, Thur, Fri Sept. 21, 2026 - Oct. 9, 2027, 7:00pm-10:00pm EST
21 Mar 2011, 20:13
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
100%
(02:03)
wrong
based on 4
sessions
History
Date
Time
Result
Not Attempted Yet
In city A, the streets are aligned in a grid (see attachment), where the east-west roads are called 1st Rd, 2nd Rd, 3rd Rd, etc, increasing in number as one moves northward. The north-south roads are called 1st Ave, 2nd Ave, 3rd Ave, etc, increasing in number as one moves eastward. There is a park that runs from 5th Ave to 7th Ave and from 3rd Rd to 5th Rd, as pictured. If Bill needs to walk from the corner of 2nd Rd and 3rd Ave to the corner of 6th Rd and 8th Ave in the shortest possible time without walking through the park, how many different routes could he take?
1. 45
2. 54
3. 66
4. 98
5. 19
OPEN DISCUSSION OF THIS QUESTION IS HERE: in-city-a-the-streets-are-aligned-in-a-grid-where-the-east-136949.html
1. 45
2. 54
3. 66
4. 98
5. 19
OPEN DISCUSSION OF THIS QUESTION IS HERE: in-city-a-the-streets-are-aligned-in-a-grid-where-the-east-136949.html
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Problem Solving (PS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
Hello)
This is not an easy question and I hope everyone not to have it on the exam)
Actually this problem is connected with wide and very interesting field of mathematics - graph theory(trees, cycles, 7 bridges of Konigsberg etc.). Probably you have heard about it. If no and you are interested - see here.
https://en.wikipedia.org/wiki/Graph_theory
However, I will try to explain it to you without any extra knowledge.
Obviously, the shortest way is to go to the right and up. I think it is easy to understand. So, the total lenght of the trip is 9 steps. Since you go from the LeftDown to RightUp corner, then you always will go through one of the "key" points, as I call them. See, i circle them in red in the picture.
Now let calculate, how many routes are there to the point 1. Obviously, there is 1 such route. I show it in yellow.
Now let calculate how many routes are there to the point 2. There are 4 such routes. You could easily understand these looking at the picture. I show these routes in yellow, green, blue and red.
How many routes are there from the origin to the 3 point? 6! See the picture.
How many routes to the 4 point? There are 4. Everything is on the picture.
And finally there is only one route to the 5 point. I hope you understand this easily.
And now let do the second part of work. Let calculate, how many options you have going from each of these 5 points to the final point - RightUp corner!
For the 1 point there is only 1 such route - going to the right.
For the 2 point there are 5 routes. See the picture, please.
From the 3 and 4 points there are 4 routes, They are quite similar, so I will show the picture only for one case.
Finally, from the point 5 there are 5 routes to the end, it is like the point 2, so I do not add the picture.
Now we are close to the answer!
What we need is to calculate how many routes, going through each of the 5 "key" points, is there. As you guess we should just multiply the number of routes from the first and second parts.
So, there are 1*1=1 routes going through point 1.
4*5=20 routes going through point 2
6*4=24 routes through point 3
4*4=16 routes through point 4
1*5=5 routes through point 5
The final answer is 1+20+24+16+5=66!
Obviously, this is not the best or shortest way to solve this, but I hope it will help to realise better the essence of the
problem. I sorry for the "quality" of pictures, but I have not much time to draw them)
This is not an easy question and I hope everyone not to have it on the exam)
Actually this problem is connected with wide and very interesting field of mathematics - graph theory(trees, cycles, 7 bridges of Konigsberg etc.). Probably you have heard about it. If no and you are interested - see here.
https://en.wikipedia.org/wiki/Graph_theory
However, I will try to explain it to you without any extra knowledge.
Obviously, the shortest way is to go to the right and up. I think it is easy to understand. So, the total lenght of the trip is 9 steps. Since you go from the LeftDown to RightUp corner, then you always will go through one of the "key" points, as I call them. See, i circle them in red in the picture.
Now let calculate, how many routes are there to the point 1. Obviously, there is 1 such route. I show it in yellow.
Now let calculate how many routes are there to the point 2. There are 4 such routes. You could easily understand these looking at the picture. I show these routes in yellow, green, blue and red.
How many routes are there from the origin to the 3 point? 6! See the picture.
How many routes to the 4 point? There are 4. Everything is on the picture.
And finally there is only one route to the 5 point. I hope you understand this easily.
And now let do the second part of work. Let calculate, how many options you have going from each of these 5 points to the final point - RightUp corner!
For the 1 point there is only 1 such route - going to the right.
For the 2 point there are 5 routes. See the picture, please.
From the 3 and 4 points there are 4 routes, They are quite similar, so I will show the picture only for one case.
Finally, from the point 5 there are 5 routes to the end, it is like the point 2, so I do not add the picture.
Now we are close to the answer!
What we need is to calculate how many routes, going through each of the 5 "key" points, is there. As you guess we should just multiply the number of routes from the first and second parts.
So, there are 1*1=1 routes going through point 1.
4*5=20 routes going through point 2
6*4=24 routes through point 3
4*4=16 routes through point 4
1*5=5 routes through point 5
The final answer is 1+20+24+16+5=66!
Obviously, this is not the best or shortest way to solve this, but I hope it will help to realise better the essence of the
problem. I sorry for the "quality" of pictures, but I have not much time to draw them)
22 Mar 2011, 13:34
Kudos
Bookmarks
bhandariavi
Good effort bagrettin. thanks and kudos.
After struggling a lot, this is my way of approaching this problem;
I am going to represent Avenues with suffix A and Roads with suffix R
e.g. (3A,2R) is the intersection of 3rd Avenue and 2nd Road.
Total number of shortest ways from (3A,2R) to (8A,6R) will be \(C^{9}_{5} = \frac{9!}{5!4!} = 126\). Think it like a string "EEEEENNNN" 5 blocks east and 4 blocks north and a total of 9 blocks.
Now we need to subtract the routes that are actually not there because of the park;
We just need to consider 2 intersections for that;
(6A,3R), (5A,4R)
Ways to get to (6A,3R) from (3A,2R) = \(C^{4}_{3}=4\)
"From (6A,3R) to (6A,5R) via (6A,4R)" AND "From (6A,3R) to (7A,4R) via (6A,4R)" are two routes that need to be subtracted.
All we need to do now is to find out the number of ways to reach (8A,6R) from (6A,5R) & (7A,4R)
Ways from (6A,5R) to (8A,6R) = \(C^{3}_{2}=3\)
Ways from (7A,4R) to (8A,6R) = \(C^{3}_{1}=3\)
Number of ways to be subtracted = 4*3+4*3 = 12+12=24
Similarly, we can repeat it for intersection (5A,4R)
Ways to reach (5A,4R) from (3A,2R) = \(C^{4}_{2} = 6\)
"From (5A,4R) to (6A,5R) via (6A,4R)" AND "From (5A,4R) to (7A,4R) via (6A,4R)" are two routes that need to be subtracted.
All we need to do now is to find out the number of ways to reach (8A,6R) from (6A,5R) & (7A,4R)
We already found that;
Ways from (6A,5R) to (8A,6R) = \(C^{3}_{2}=3\)
Ways from (7A,4R) to (8A,6R) = \(C^{3}_{1}=3\)
Number of ways to be subtracted= 6*3+6*3 = 18+18=36
Total number of ways to be subtracted = 24+36=60
Number of possible shortest ways = 126-60 = 66.
Ans: "C"
22 Mar 2011, 18:25
Kudos
Bookmarks
Thanks fluke & bagrettin.
Awesome!
