Source: Official Guide for the GMAT 12th Ed. Section 5.3 Problem Solving; #191

1

Pat will walk from Intersection X to Intersection

Pat will walk from Intersection X to Intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length? 6, 8, 10, 14, 16

1 Explanation

1

Gravatar Mike McGarry, Magoosh Tutor

Nov 7, 2012 • Comment

Add Your Explanation

You must have a Magoosh account in order to leave an explanation.

Learn More About Magoosh

Official GMAT Material

Official Guide for the GMAT 13th Ed.

Official Guide for the GMAT 12th Ed.


Section 5.3 Problem Solving

Improve Your Score

Magoosh GMAT is an affordable online course for studying the GMAT.

Learn More About Magoosh

Share Post

Email

Facebook