Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 20 Jul 2008
Posts: 17

Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
03 Aug 2008, 19:22
Question Stats:
56% (01:39) correct 44% (02:02) wrong based on 1444 sessions
HideShow timer Statistics
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 above. How many routes from X to Y can Pat take that have the minimum possible length? A. Six B. Eight C. Ten D. Fourteen E. Sixteen PS45461.01 Attachment:
20190921_1430.png [ 23.4 KiB  Viewed 8888 times ]
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Sep 2009
Posts: 62498

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
21 Jan 2011, 16:56
ezinis wrote: bhushangiri wrote: haidzz wrote: Pat will walk from intersection A to intersection B along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from A to B can Pat take that have the minimum possible length? A. 6 B. 8 C. 10 D. 14 E. 16 (map is attached) Attachment: The attachment PS combinatorics.doc is no longer available This is a question from the OG11. Does anyone have a faster/easier solution?? Consider this a as coordinate plane with A as origin and B as (2,3). The shortest possible way is when you go take either right or up. (lefts and downs make repetitions and thus non shortest paths) now, to get to (2,3) form (0,0) you need min 5 steps. so you have to choose all the paths such that you have 2 steps out of 5 along x axis and getting to 3 of y axis. The number of ways = 5C2 =10 (or alternately all paths that have 3 steps along y and takes you to 2 of x. .. 5C3 = 10) Can you explicate your combinatorial method a bit more. For example, If I add another Avenue, eg, Avenue D, and another street, Street 5, I will have to go 3 steps right and 4 steps up to get to point C. Therefore, the total number of route will be 7C3 = 35? Am I correct? Attachment:
Q.png [ 25.04 KiB  Viewed 60251 times ]
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 above. How many routes from X to Y can Pat take that have the minimum possible length? A) 6 B) 8 C) 10 D) 14 E) 16 In order the length to be minimum Pat should only go UP and RIGHT: namely thrice UP and twice RIGHT. So combination of UUURR: # of permutations of 5 letters out of which there are 3 identical U's and 2 identical R's is 5!/3!2!=10. Answer: C. If there were 5 streets and 4 avenues then the answer would be combination of UUUURRR: # of permutations of 7 letters out of which there are 4 identical U's and 3 identical R's is 7!/4!3!=35. Similar questions: grockitsimilartoogquantqustion99962.htmlcaseyandthebus104236.html
_________________




Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 64
Location: Toronto

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
08 Jul 2010, 20:55
Quote: How do I get to it this > 5!/2!3! = 10 ???????? by using the formula for arranging n objects where some objects recur. We know that there are n! ways of arranging n distinct objects. So, for example, the number of words (both sensical and nonsensical) that can be made from the letters in this word: GMAT is 4!. What about the number of words that can be created from this word: DESERT? Well, we have 6 objects. If they were all distinct, there would be 6! ways of arranging all the letters, and thus 6! words would be made. HOWEVER, not all of the letters are distinct. In particular, "E" shows up twice. So, there are actually 6!/2! words we can create. What about this word: DESSERT? Now, we have 7 objects. But both "S" and "E" show up twice. So, there are 7!/(2!*2!) ways of arranging. And how about: DESSERTS? Now, there are 8!/(3!*2!) ways of arranging. What about this word: SSS Well, there are 3!/3! or 1 way of arranging all the letters. The formula for arranging n objects where some objects recur is: n!/(r!*s!) in which "r" and "s" are the number of times objects of a certain kind appear. So, with: UUURR, there are 5!/(3!*2!) ways of arranging.




Manager
Joined: 15 Jul 2008
Posts: 148

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
04 Aug 2008, 05:02
haidzz wrote: Pat will walk from intersection A to intersection B along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from A to B can Pat take that have the minimum possible length? A. 6 B. 8 C. 10 D. 14 E. 16 (map is attached) Attachment: PS combinatorics.doc This is a question from the OG11. Does anyone have a faster/easier solution?? Consider this a as coordinate plane with A as origin and B as (2,3). The shortest possible way is when you go take either right or up. (lefts and downs make repetitions and thus non shortest paths) now, to get to (2,3) form (0,0) you need min 5 steps. so you have to choose all the paths such that you have 2 steps out of 5 along x axis and getting to 3 of y axis. The number of ways = 5C2 =10 (or alternately all paths that have 3 steps along y and takes you to 2 of x. .. 5C3 = 10)



Manager
Joined: 22 Jul 2008
Posts: 93

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
04 Aug 2008, 06:25
It is a fairly simple problem if one recognizes that there's only one combination of 3 ycoordinates for every pair of xcoordinates. In simpler terms, you can go right in 2 paths, but there's only one unique set of 3 paths going upwards with those 2 paths. All we have to do is figure out in how many ways we can take 2 paths to the right. For each such path, there will be only 1 combination of 3 paths that will go up to B. Also note that there are 8 paths going to the right but we cannot do 8C2 because once you take the 1st path going to the right, all the other rightpaths above it become redundant. The number of paths we can take to the right is 1*4 + 1*3 + 1*2 + 1*1 = 10 paths.



Manager
Joined: 15 Jul 2008
Posts: 148

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
04 Aug 2008, 06:43
haidzz wrote: dude you're a genius! kudos to you. I'm really weak in Permutations, combinations and probability. How can I get better at it? Can you suggest a particular book other than GMAT books?
This site is pretty good... http://www.mansw.nsw.edu.au/members/ref ... no4yen.htmThanks to Durgesh79 for pointing me to this page. Awesome summary of all basic concepts. Also follow his solutions to combinatorial problems.. he comes up with real cool ways to tame these little pups.



Manager
Status: Waiting to hear from University of Texas at Austin
Joined: 24 May 2010
Posts: 58
Location: Changchun, China
Schools: University of Texas at Austin, Michigan State

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
08 Jul 2010, 18:55
Bringing up an old topic because it is giving me headaches. I understand breaking this down into 5 steps (2 Rights, 3 Ups) So right = R And Up = U So we need to see how many permutations include 2 Rights, and 3 Ups So I made a list Start to the right RRUUU RURUU RUURU RUUUR Start with by moving up URRUU URURU URUUR UURRU UURUR UUURR Obviously making a list is not the quickest way to solve this problem. How do I get to it this > 5!/2!3! = 10 ???????? It seems to be me are picking 5 out of 5? So we would have 5!/5!0! which equals 1



Manager
Status: Waiting to hear from University of Texas at Austin
Joined: 24 May 2010
Posts: 58
Location: Changchun, China
Schools: University of Texas at Austin, Michigan State

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
08 Jul 2010, 21:10
Quote: The formula for arranging n objects where some objects recur is: n!/(r!*s!) in which "r" and "s" are the number of times objects of a certain kind appear. Thanks for your help, just to make sure I understand if I had MISSISSIPPI The number of ways to arrange it would be 11! / (4!*4!*2!) = 34,650 ???



Kaplan GMAT Instructor
Joined: 21 Jun 2010
Posts: 64
Location: Toronto

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
08 Jul 2010, 21:12
TallJTinChina wrote: Quote: The formula for arranging n objects where some objects recur is: n!/(r!*s!) in which "r" and "s" are the number of times objects of a certain kind appear. Thanks for your help, just to make sure I understand if I had MISSISSIPPI The number of ways to arrange it would be 11! / (4!*4!*2!) = 34,650 ??? Haha! That's probably the best example one can come up with. Yes, that is indeed correct....thanks for making me count all the "I"s and "S"s!



Manager
Joined: 27 Oct 2009
Posts: 102
Location: Montreal
Schools: Harvard, Yale, HEC

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
21 Jan 2011, 16:42
bhushangiri wrote: haidzz wrote: Pat will walk from intersection A to intersection B along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from A to B can Pat take that have the minimum possible length? A. 6 B. 8 C. 10 D. 14 E. 16 (map is attached) Attachment: PS combinatorics.doc This is a question from the OG11. Does anyone have a faster/easier solution?? Consider this a as coordinate plane with A as origin and B as (2,3). The shortest possible way is when you go take either right or up. (lefts and downs make repetitions and thus non shortest paths) now, to get to (2,3) form (0,0) you need min 5 steps. so you have to choose all the paths such that you have 2 steps out of 5 along x axis and getting to 3 of y axis. The number of ways = 5C2 =10 (or alternately all paths that have 3 steps along y and takes you to 2 of x. .. 5C3 = 10) Can you explicate your combinatorial method a bit more. For example, If I add another Avenue, eg, Avenue D, and another street, Street 5, I will have to go 3 steps right and 4 steps up to get to point C. Therefore, the total number of route will be 7C3 = 35? Am I correct?



Manager
Joined: 27 Oct 2009
Posts: 102
Location: Montreal
Schools: Harvard, Yale, HEC

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
21 Jan 2011, 17:19
You're the best Bunuel, +1



Manager
Joined: 15 Apr 2011
Posts: 58

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
13 Apr 2012, 10:31
I didn't understand this part "In order the length to be minimum Pat should only go UP and RIGHT: namely thrice UP and twice RIGHT.". He could also go twice RIGHT and then thrice UP. I didn't follow how this was chosen.
_________________
http://mymbadreamz.blogspot.com



Math Expert
Joined: 02 Sep 2009
Posts: 62498

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
13 Apr 2012, 10:44
mymbadreamz wrote: I didn't understand this part "In order the length to be minimum Pat should only go UP and RIGHT: namely thrice UP and twice RIGHT.". He could also go twice RIGHT and then thrice UP. I didn't follow how this was chosen. Y is 3 moves UP and 2 moves RIGHT from X (Pat). Now, in order to minimize the route from X to Y only those moves should be taken, how else? But Pat can make these moves (3 Ups, 2 RIGHT) in several different ways: Up, Up, Up, Right, Right; Up, Up, Right, Up, Right; Right, Up, Up, Right, Up; ... Just look at the diagram to check. Now, how, many combinations of those moves are possible? # of combination of Up, Up, Up, Right, Right or combinations UUUPP is 5!/(3!2!)=10. Hope it's clear.
_________________



Intern
Joined: 21 May 2012
Posts: 11
Location: United States
Concentration: Finance, Real Estate
GPA: 3.86

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
29 Jul 2012, 15:35
Bunuel, great example & explanation! Thank you



Director
Joined: 22 Mar 2011
Posts: 581
WE: Science (Education)

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
30 Jul 2012, 02:24
haidzz wrote: Pat will walk from intersection A to intersection B along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from A to B can Pat take that have the minimum possible length? A. 6 B. 8 C. 10 D. 14 E. 16 (map is attached) Attachment: PS combinatorics.doc This is a question from the OG11. Does anyone have a faster/easier solution?? Looking at the map, we can see that a route of minimal length is any route that takes only steps up (U) and to the right(R), never to the left or down. Necessarily, such a route has two Right walks and three Up walks. One have to count all the orderings to have in a sequence of 5 walks 2Rs and 3Us. So, there are 5C2 possibilities for a minimal route, which is 5*4/2=10. Answer C
_________________
PhD in Applied Mathematics Love GMAT Quant questions and running.



Director
Joined: 29 Nov 2012
Posts: 675

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
21 Jan 2013, 01:47
Great explanation Bunuel, thanks a lot.



Manager
Joined: 15 Aug 2013
Posts: 223

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
23 Apr 2014, 18:25
Testluv wrote: Quote: How do I get to it this > 5!/2!3! = 10 ???????? by using the formula for arranging n objects where some objects recur. We know that there are n! ways of arranging n distinct objects. So, for example, the number of words (both sensical and nonsensical) that can be made from the letters in this word: GMAT is 4!. What about the number of words that can be created from this word: DESERT? Well, we have 6 objects. If they were all distinct, there would be 6! ways of arranging all the letters, and thus 6! words would be made. HOWEVER, not all of the letters are distinct. In particular, "E" shows up twice. So, there are actually 6!/2! words we can create. What about this word: DESSERT? Now, we have 7 objects. But both "S" and "E" show up twice. So, there are 7!/(2!*2!) ways of arranging. And how about: DESSERTS? Now, there are 8!/(3!*2!) ways of arranging. What about this word: SSS Well, there are 3!/3! or 1 way of arranging all the letters. The formula for arranging n objects where some objects recur is: n!/(r!*s!) in which "r" and "s" are the number of times objects of a certain kind appear. So, with: UUURR, there are 5!/(3!*2!) ways of arranging. This makes complete sense when we think about just the different permutations available with the various streets and avenues. I couldn't get myself to use this because I wasn't sure if this would totally eliminate the possibility of moving left or down instead of just up and right?How can we be certain that this wouldn't count the negative distances?



Math Expert
Joined: 02 Sep 2009
Posts: 62498

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
24 Apr 2014, 00:12
russ9 wrote: Testluv wrote: Quote: How do I get to it this > 5!/2!3! = 10 ???????? by using the formula for arranging n objects where some objects recur. We know that there are n! ways of arranging n distinct objects. So, for example, the number of words (both sensical and nonsensical) that can be made from the letters in this word: GMAT is 4!. What about the number of words that can be created from this word: DESERT? Well, we have 6 objects. If they were all distinct, there would be 6! ways of arranging all the letters, and thus 6! words would be made. HOWEVER, not all of the letters are distinct. In particular, "E" shows up twice. So, there are actually 6!/2! words we can create. What about this word: DESSERT? Now, we have 7 objects. But both "S" and "E" show up twice. So, there are 7!/(2!*2!) ways of arranging. And how about: DESSERTS? Now, there are 8!/(3!*2!) ways of arranging. What about this word: SSS Well, there are 3!/3! or 1 way of arranging all the letters. The formula for arranging n objects where some objects recur is: n!/(r!*s!) in which "r" and "s" are the number of times objects of a certain kind appear. So, with: UUURR, there are 5!/(3!*2!) ways of arranging. This makes complete sense when we think about just the different permutations available with the various streets and avenues. I couldn't get myself to use this because I wasn't sure if this would totally eliminate the possibility of moving left or down instead of just up and right?How can we be certain that this wouldn't count the negative distances? How can arrangements of Up's and Right's give Left and Down? The following post shows all the possible routs: patwillwalkfromintersectionatointersectionbalonga68374.html#p1073473Hope it helps.
_________________



Manager
Joined: 15 Aug 2013
Posts: 223

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
24 Apr 2014, 18:32
Bunuel wrote: russ9 wrote: This makes complete sense when we think about just the different permutations available with the various streets and avenues. I couldn't get myself to use this because I wasn't sure if this would totally eliminate the possibility of moving left or down instead of just up and right?
How can we be certain that this wouldn't count the negative distances?
How can arrangements of Up's and Right's give Left and Down? The following post shows all the possible routs: patwillwalkfromintersectionatointersectionbalonga68374.html#p1073473Hope it helps. Ahh  makes sense because we are trying to "minimize" the routed. If that wasn't the case then I guess this formula wouldn't apply.



Intern
Joined: 06 Jun 2014
Posts: 41

Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
Show Tags
16 Apr 2015, 16:43
I solved this problem using the Pascal's Triangle, however the permutation solution is a bit faster, of course only if you now how to set up the equation.




Re: Pat will walk from intersection X to intersection Y along a route that
[#permalink]
16 Apr 2015, 16:43



Go to page
1 2
Next
[ 29 posts ]



