Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 25 Jun 2016, 11:11

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

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

# pls provide the detailed solution

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
VP
Joined: 18 May 2008
Posts: 1287
Followers: 14

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

pls provide the detailed solution [#permalink]

### Show Tags

23 Jun 2008, 23:25
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

pls provide the detailed solution
Attachments

shortest path.doc [25.5 KiB]
Downloaded 247 times

 To download please login or register as a user

SVP
Joined: 17 Jun 2008
Posts: 1570
Followers: 11

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

Re: PS: shortest path [#permalink]

### Show Tags

23 Jun 2008, 23:48
C should be the answer.

If I name the various corners as follows

10 11 12
7 8 9
4 5 6
1 2 3

Then, the following are the possible routes (the shortest routes will be going horizontal and vertical only):

1-2-3-6-9-12
1-2-5-6-9-12
1-2-5-8-9-12
1-2-5-8-11-12
1-4-5-6-9-12
1-4-5-8-9-12
1-4-5-8-11-12
1-4-7-8-9-12
1-4-7-8-11-12
1-4-7-10-11-12

If there is any short cut to this, please let me know.
Current Student
Joined: 12 Jun 2008
Posts: 287
Schools: INSEAD Class of July '10
Followers: 7

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

Re: PS: shortest path [#permalink]

### Show Tags

24 Jun 2008, 01:48
Answer is indeed 10.

To go from X to Y, you have to take 5 segments. 3 vertical segments and 2 horizontal segments in any order you want.

So this is just a matter of choosing (for instance) which of the 2 segments amongst the 5 will be horizontal segments.

Number is $$2C5=\frac{5!}{3!*2!}=10$$
VP
Joined: 18 May 2008
Posts: 1287
Followers: 14

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

Re: PS: shortest path [#permalink]

### Show Tags

24 Jun 2008, 03:14
Wow Oski ! u rock! Answer is 10 indeed. thanks a lot!
Oski wrote:
Answer is indeed 10.

To go from X to Y, you have to take 5 segments. 3 vertical segments and 2 horizontal segments in any order you want.

So this is just a matter of choosing (for instance) which of the 2 segments amongst the 5 will be horizontal segments.

Number is $$2C5=\frac{5!}{3!*2!}=10$$
Re: PS: shortest path   [#permalink] 24 Jun 2008, 03:14
Display posts from previous: Sort by

# pls provide the detailed solution

 post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group and phpBB SEO Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.