BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

OG11-Q195

Expert replies
by RM » Fri Jul 06, 2007 3:43 pm
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. How many routes from X to Y can Pat take that have the minimum possible length?
Attachments
OG11-Ques195.gif
Q195
Join the discussion
Source: — Problem Solving |

by givemeanid » Fri Jul 06, 2007 4:11 pm
He goes up 3 times and moves right 2 times. Just by counting, I seem to be getting 10. What is OA?
So It Goes
Join the discussion

OA is 10

by RM » Fri Jul 06, 2007 4:49 pm
yeah the answer is 10. I was wondering if there is any mathematical way apart from counting to arrive at the solution.
Join the discussion

by givemeanid » Fri Jul 06, 2007 5:01 pm
Yes there is.

We essentially need a 5 letter word which will denote the path. The letters in the word should be R, R, U, U, U. The order matters and Rs and Us are indistinguishable.

To find the number of distinct permutations of a set of items with indistinguishable items, divide the factorial of the items in the set by the product of the factorials of the number of indistinguishable elements.

That is 5! / (2! * 3!) = 10.
So It Goes
Join the discussion

General Concept

by discreet » Fri Jul 06, 2007 11:17 pm
Again,To all my dear members,Here's a general concept that can be used for such type of questions.

I firmly believe that one must always attack the concept first rather than attacking a specific question.So,when I saw this problem,I started searching for a concept that I can use for this problem.

So,here it is : Refer image

This is a part of my personal Flashcards, sharing it now :D

There's one more similar problem : distance between 2 cities PS pblm...but that's a simpler one that can be easily deduced.
Attachments
Routes.JPG
Join the discussion

What are th number of the bottom right of C imply mathematically?
Join the discussion