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

 It is currently 04 May 2015, 22:39

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

# pls provide the detailed solution

Author Message
TAGS:
VP
Joined: 18 May 2008
Posts: 1300
Followers: 13

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

pls provide the detailed solution [#permalink]  23 Jun 2008, 22:25
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
pls provide the detailed solution
Attachments

shortest path.doc [25.5 KiB]

SVP
Joined: 17 Jun 2008
Posts: 1573
Followers: 12

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

Re: PS: shortest path [#permalink]  23 Jun 2008, 22:48

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: 6

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

Re: PS: shortest path [#permalink]  24 Jun 2008, 00:48

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: 1300
Followers: 13

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

Re: PS: shortest path [#permalink]  24 Jun 2008, 02:14
Wow Oski ! u rock! Answer is 10 indeed. thanks a lot!
Oski wrote:

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, 02:14
Similar topics Replies Last post
Similar
Topics:
provide specific details and examples 1 22 Jul 2014, 07:19
4 Detailed solution will be appreciated. Thanks 4 10 Jun 2008, 03:40
6 Detailed solution will be appreciated. Thanks 6 10 Jun 2008, 03:39
8 Detailed solution will be appreciated. Thanks 8 10 Jun 2008, 03:39
Detailed solution will be appreciated. Thanks 3 10 Jun 2008, 03:38
Display posts from previous: Sort by