Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 27 May 2017, 22: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

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

# Pat will walk from intersection X to intersection Y along a

Author Message
Senior Manager
Joined: 12 Mar 2006
Posts: 365
Schools: Kellogg School of Management
Followers: 3

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

Pat will walk from intersection X to intersection Y along a [#permalink]

### Show Tags

13 Mar 2007, 23:30
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

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?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16

Attachments

fig1.doc [23 KiB]

Director
Joined: 13 Dec 2006
Posts: 512
Location: Indonesia
Followers: 6

Kudos [?]: 223 [0], given: 0

### Show Tags

13 Mar 2007, 23:56

My method is conventional, but I know it can be solved by conventional method as well.

Faster way is in 5 steps (u need to number every intersection)

Now through corner it may go through 2 ways, from first point horizontally it can go through 3 ways, from first point vertically it will will through 3 ways, from second point vertically it will go through 2 ways.

In toto it will go through 10 ways.

regards,

Amardeep
Director
Joined: 06 Feb 2006
Posts: 898
Followers: 3

Kudos [?]: 112 [1] , given: 0

### Show Tags

14 Mar 2007, 00:35
1
KUDOS
My way:

In any situation Pat would have to walk 3 streets up and 2 streets to the right, total 5 streets.

Use combinatorics:

5!/2!*3!=10
Director
Joined: 13 Dec 2006
Posts: 512
Location: Indonesia
Followers: 6

Kudos [?]: 223 [0], given: 0

### Show Tags

14 Mar 2007, 00:50
Hey good one...
Its like number of ways of arranging 5 letters AAANN

regards,

Amardeep Sharma
14 Mar 2007, 00:50
Display posts from previous: Sort by