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

It is currently 19 Dec 2014, 23:57

Close

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

How many different shortest routes can one use moving from

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Intern
Intern
avatar
Joined: 06 Apr 2004
Posts: 40
Followers: 0

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

How many different shortest routes can one use moving from [#permalink] New post 17 May 2005, 12:29
1
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
How many different shortest routes can one use moving from town K to town M?
Attachments

pic.JPG
pic.JPG [ 3.03 KiB | Viewed 646 times ]

Manager
Manager
User avatar
Joined: 22 Apr 2005
Posts: 129
Location: Los Angeles
Followers: 1

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

 [#permalink] New post 17 May 2005, 15:06
Rectangle 4x2
To get from one point to another staying on shortest route you can only down or to the right.
Each shortest route can be described as a sequence:
(x0, x1, x2, x3) where xi >=0 - number of steps down on vertical i.
x0 + x1 + x2 + x3 = 2
Number of solutions to this equation is our answer.
2C4 + 1C4 = 10
Intern
Intern
avatar
Joined: 06 Apr 2004
Posts: 40
Followers: 0

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

 [#permalink] New post 19 May 2005, 01:37
amit_drummer wrote:
6!/(4!*2!)


15 is the correct answer. Could you please explain your solution?
Manager
Manager
avatar
Joined: 08 Mar 2005
Posts: 101
Followers: 1

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

 [#permalink] New post 25 May 2005, 04:06
yup. Its 15.

there are two steps for down (d) and 4 steps right (r)

so it can be ddrrrr.

just need to find the permutation of this. which is 6!/(4!*2!) = 15
Manager
Manager
avatar
Joined: 14 May 2005
Posts: 85
Location: San Francisco
Followers: 1

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

 [#permalink] New post 14 Jun 2005, 15:58
emilem wrote:
amit_drummer wrote:
6!/(4!*2!)


15 is the correct answer. Could you please explain your solution?


emilem:

I like the solution posted by Shaq in testmagic forum. It works for this problem too.

http://www.testmagic.com/forums/showthread.php?t=15550
  [#permalink] 14 Jun 2005, 15:58
    Similar topics Author Replies Last post
Similar
Topics:
24 Experts publish their posts in the topic How many different 5-person teams can be formed from a group gmatJP 12 22 Jun 2010, 18:14
OG11 No.195 How many routes from X to Y can Pat take? supermann 6 13 Jun 2008, 21:11
How many 3 different digit integer can be formed using 6 auniyal 7 15 May 2007, 10:52
How many different numbers can be made from reorganizing the andrehaui 4 18 Apr 2007, 06:14
How many different combinations can be made using the dipeshc4 3 01 Nov 2006, 03:20
Display posts from previous: Sort by

How many different shortest routes can one use moving from

  Question banks Downloads My Bookmarks Reviews Important topics  


cron

GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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®.