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.
It appears that you are browsing the GMAT Club forum unregistered!
Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club
Registration gives you:
Tests
Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.
Applicant Stats
View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more
Books/Downloads
Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Pat will walk from intersection A to intersection B along a [#permalink]
03 Aug 2008, 19:22
2
This post received KUDOS
23
This post was BOOKMARKED
00:00
A
B
C
D
E
Difficulty:
55% (hard)
Question Stats:
58% (02:06) correct
42% (01:18) wrong based on 484 sessions
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?
Re: PS: Combinatorics [#permalink]
04 Aug 2008, 05:02
7
This post received KUDOS
1
This post was BOOKMARKED
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 OG-11. 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)
Re: PS: Combinatorics [#permalink]
04 Aug 2008, 06:25
It is a fairly simple problem if one recognizes that there's only one combination of 3 y-coordinates for every pair of x-coordinates. 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 right-paths 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.
Re: PS: Combinatorics [#permalink]
04 Aug 2008, 06:43
1
This post was BOOKMARKED
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?
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.
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 ???
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!
Re: PS: Combinatorics [#permalink]
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 OG-11. 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?
Re: PS: Combinatorics [#permalink]
21 Jan 2011, 16:56
18
This post received KUDOS
Expert's post
8
This post was BOOKMARKED
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 OG-11. 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 22728 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.
Re: Pat will walk from intersection A to intersection B along a [#permalink]
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. _________________
Re: Pat will walk from intersection A to intersection B along a [#permalink]
13 Apr 2012, 10:44
1
This post received KUDOS
Expert's post
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.
Re: Pat will walk from intersection A to intersection B along a [#permalink]
30 Jul 2012, 02:24
1
This post received KUDOS
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 OG-11. 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.
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?
You know what’s worse than getting a ding at one of your dreams schools . Yes its getting that horrid wait-listed email . This limbo is frustrating as hell . Somewhere...
As I’m halfway through my second year now, graduation is now rapidly approaching. I’ve neglected this blog in the last year, mainly because I felt I didn’...
Wow! MBA life is hectic indeed. Time flies by. It is hard to keep track of the time. Last week was high intense training Yeah, Finance, Accounting, Marketing, Economics...