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

It is currently 29 Jul 2015, 23:12
GMAT Club Tests

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

Pat will walk from intersection X to intersection Y along a

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Manager
Manager
User avatar
Joined: 17 Dec 2005
Posts: 162
Followers: 1

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

Pat will walk from intersection X to intersection Y along a [#permalink] New post 15 Jun 2006, 19:04
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
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 confind to the square grid of four streets and three avenues. (If you draw a grid, you have 4 horizontal lines and 3 vertical lines. X is on your lower left and Y is on your upper right. This problem is #195 in OG11)

How many routes can Pat tale that have the min possible length?

a) 6

b) 8

c) 10

d) 14

e) 16

Does anyone have a logically method of solving this problem with simply writing out all the possiblity? What is the logically basis?

Thanks.

Mike
Kaplan Promo CodeKnewton GMAT Discount CodesManhattan GMAT Discount Codes
VP
VP
User avatar
Joined: 02 Jun 2006
Posts: 1266
Followers: 2

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

 [#permalink] New post 15 Jun 2006, 19:39
Given that Pat has to take a total of 5 steps reach from X to Y, and at each steps the shortest route can be attained by either moving Right or Up, the total routes
= # of steps to be taken x # of choices @ each step
= 5 x 2 = 10 ??
GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 07 Jul 2004
Posts: 5067
Location: Singapore
Followers: 24

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

 [#permalink] New post 15 Jun 2006, 21:20
The shortest routes all involve walking to the right twice, and up thrice.

So you can write the word RRUUU where R stands for right, and U stands for up.

Now the number of routes is just the number of permutations, which is 5!/3!2! = 10 ways.
SVP
SVP
avatar
Joined: 30 Mar 2006
Posts: 1737
Followers: 1

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

 [#permalink] New post 15 Jun 2006, 21:43
10.

Three routes up and two routes to the right.

Total = 5!/3!2! = 10
Manager
Manager
avatar
Joined: 09 May 2006
Posts: 99
Location: Bangalore, India
Followers: 2

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

 [#permalink] New post 15 Jun 2006, 22:12
Please refer to this post :
http://www.gmatclub.com/phpbb/viewtopic.php?t=30301

Giddi does a great job in explaing the approach to route problems.
  [#permalink] 15 Jun 2006, 22:12
Display posts from previous: Sort by

Pat will walk from intersection X to intersection Y along a

  Question banks Downloads My Bookmarks Reviews Important topics  


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