GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video

It is currently 05 Aug 2020, 18:05

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.

Close

Request Expert Reply

Confirm Cancel

Pat will walk from intersection X to intersection Y along a route that

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Find Similar Topics 
EMPOWERgmat Instructor
User avatar
V
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 17276
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 19 Mar 2018, 09:58
Hi All,

There are a couple of ways that you can approach this question….

Since the answers are relatively small, there are at least 6 ways to get from X to Y, but no more than 16 ways to get from X to Y. In a pinch, you could draw pictures and physically find all of the possibilities.

If you're more interested in a "math" approach, you'll see that to get from X to Y you'll need to go 3 blocks "up" and 2 blocks "over" no matter how you get from X to Y.

Since you have to make 5 "moves" and 3 of them have to be "up", you have a Combination Formula situation….In other words…

5c3

5!/[3!2!] = 10

You COULD also say that to make 5 "moves" and 2 of them have to be "over", you could also use the combination formula in this way…

5c2

5!/[2!3!] = 10

It's the same answer because 5c3 is the same as 5c2.

Final Answer:

GMAT assassins aren't born, they're made,
Rich
_________________
Contact Rich at: Rich.C@empowergmat.com
Image


The Course Used By GMAT Club Moderators To Earn 750+

souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
Manager
Manager
avatar
B
Joined: 08 Sep 2016
Posts: 97
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 27 Mar 2018, 09:01
Pat will walk 3 blocks north and 2 blocks east to get to Y.

This can be represented as NNNEE

Total ways = 5!
Because she walks North 3 times and East 2 times, that has to be accounted for as 3!*2! to capture the minimum routes.

Minimum possible paths are now:

5!/ (3!*2!) = 10
GMAT Club Legend
GMAT Club Legend
User avatar
V
Joined: 11 Sep 2015
Posts: 4999
Location: Canada
GMAT 1: 770 Q49 V46
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 11 Dec 2019, 07:29
Top Contributor
haidzz wrote:
Image
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

Image
Attachment:
2019-09-21_1430.png


If we define Pat's path in a block-by-block manner, we can see that any route from X to Y will consist of 3 UPS and 2 RIGHTS.
So for example, if we let U represent walking one block UP, and let R represent walking one block RIGHT, one possible path is URURU.
Another possible path is UUURR
Another possible path is UURUR

So our question becomes, "In how many different ways can we arrange 3 U's and 2 R's?"

-----------ASIDE-----------------
When we want to arrange a group of items in which some of the items are identical, we can use something called the MISSISSIPPI rule. It goes like this:

If there are n objects where A of them are alike, another B of them are alike, another C of them are alike, and so on, then the total number of possible arrangements = n!/[(A!)(B!)(C!)....]

So, for example, we can calculate the number of arrangements of the letters in MISSISSIPPI as follows:
There are 11 letters in total
There are 4 identical I's
There are 4 identical S's
There are 2 identical P's
So, the total number of possible arrangements = 11!/[(4!)(4!)(2!)]
---------------------------------

Now let's apply the MISSISSIPPI rule to arranging 3 U's and 2 R's
There are 5 letters in total
There are 3 identical U's
There are 2 identical R's
So, the total number of possible arrangements = 5!/[(3!)(2!)] = 10

Answer: C

Cheers,
Brent
_________________
If you enjoy my solutions, you'll love my GMAT prep course.

Image
Target Test Prep Representative
User avatar
V
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 11407
Location: United States (CA)
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 17 Dec 2019, 19:52
haidzz wrote:
Image
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

Image
Attachment:
2019-09-21_1430.png


Let V denote a step in the vertical direction and H denote a step in the horizontal direction. For instance, V-V-V-H-H denotes the path of walking along Avenue A until the intersection of 4th street and walking along 4th street until the point Y. Similarly, V-H-V-H-V denotes the path of walking along Avenue A, then walking along 2st street, then walking along Avenue B, then walking along 3rd street and, finally, walking along Avenue C to reach point Y.

We notice that a shortest path between point X and Y must include three V’s and two H’s. Further, any arrangement of three V’s and two H’s (i.e., any arrangement of the letters V-V-V-H-H) gives us a shortest path between X and Y. Using the permutations with indistinguishable objects formula, we see that there are 5! / (3!*2!) = (5 x 4)/2 = 10 such arrangements. Thus, there are 10 shortest paths between points X and Y.

Answer: C
_________________

  250 REVIEWS

5-STAR RATED ONLINE GMAT QUANT SELF STUDY COURSE

NOW WITH GMAT VERBAL (BETA)

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

Intern
Intern
avatar
Joined: 03 Jan 2020
Posts: 17
Location: United States
GMAT 1: 720 Q56 V40
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 03 Jan 2020, 16:28
MBA HOUSE KEY CONCEPT: Combinatorics Permutation with repetition

5 steps = 2 to the right and 3 upward

Permutation of 5 with 2 and 3 repetitions = 5! / (2!)(3!) = 10

C :shocked
Director
Director
User avatar
P
Joined: 21 Feb 2017
Posts: 676
GMAT 1: 690 Q45 V38
Reviews Badge CAT Tests
Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 01 Feb 2020, 11:14
Bunuel wrote:
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.



Hi Bunuel GMATPrepNow ScottTargetTestPrep

Silly doubt but why do we use permutations/arrangements here if order doesnt matter?

If he goes URURU or UUURR, the order doesnt matter right?
GMAT Club Legend
GMAT Club Legend
User avatar
V
Joined: 11 Sep 2015
Posts: 4999
Location: Canada
GMAT 1: 770 Q49 V46
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 01 Feb 2020, 11:29
1
Top Contributor
Kritisood wrote:
Bunuel wrote:
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.



Hi Bunuel GMATPrepNow ScottTargetTestPrep

Silly doubt but why do we use permutations/arrangements here if order doesnt matter?

If he goes URURU or UUURR, the order doesnt matter right?


URURU and UUURR are considered different paths.
So, order does matter.
_________________
If you enjoy my solutions, you'll love my GMAT prep course.

Image
Target Test Prep Representative
User avatar
V
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 11407
Location: United States (CA)
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 06 Feb 2020, 11:03
1
Kritisood wrote:
Bunuel wrote:
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.



Hi Bunuel GMATPrepNow ScottTargetTestPrep

Silly doubt but why do we use permutations/arrangements here if order doesnt matter?

If he goes URURU or UUURR, the order doesnt matter right?


The question is asking for the number of routes from X to Y which has the minimum number of lengths, i.e. 5 step routes. The routes URURU and UUURR are considered to be different routes and thus, the order matters in this question. That's why we are using permutations (with indistinguishable objects).
_________________

  250 REVIEWS

5-STAR RATED ONLINE GMAT QUANT SELF STUDY COURSE

NOW WITH GMAT VERBAL (BETA)

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

Intern
Intern
avatar
B
Joined: 20 Jan 2017
Posts: 38
Location: United Arab Emirates
Schools: Owen '22
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 14 Mar 2020, 17:33
Just so I can understand this concept better and wording of this question, would the solution be different for maximum possible length instead of the minimum possible length?
SVP
SVP
avatar
V
Joined: 23 Feb 2015
Posts: 2010
GMAT ToolKit User
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 19 Apr 2020, 19:40
Quote:
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

Hello experts,
EMPOWERgmatRichC, VeritasKarishma, Bunuel, chetan2u, IanStewart, ArvindCrackVerbal, AaronPond, GMATinsight, JeffTargetTestPrep, ccooley
What if the word ''minimum'' has be changed with ''maximum''?
Which one will be correct counting?
1/
Total --11
Right--6
Up--5

Or,

2/
Total--11
Right--4
Up--4
Back--2
Down--1

Also, is my counting right for the maximum possible length?

I appreciate your help.
Thanks__
GMAT Club Legend
GMAT Club Legend
User avatar
V
Status: GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator l A motivator and an Optimist :)
Joined: 08 Jul 2010
Posts: 4521
Location: India
GMAT: QUANT EXPERT
Schools: IIM (A)
GMAT 1: 750 Q51 V41
WE: Education (Education)
Reviews Badge
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 20 Apr 2020, 00:44
Asad wrote:
Quote:
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

Hello experts,
EMPOWERgmatRichC, VeritasKarishma, Bunuel, chetan2u, IanStewart, ArvindCrackVerbal, AaronPond, GMATinsight, JeffTargetTestPrep, ccooley
What if the word ''minimum'' has be changed with ''maximum''?
Which one will be correct counting?
1/
Total --11
Right--6
Up--5

Or,

2/
Total--11
Right--4
Up--4
Back--2
Down--1

Also, is my counting right for the maximum possible length?

I appreciate your help.
Thanks__


Asad

in case of maximum length the answer is be Infinite

Cause the traveller can continue to remain in a loop infinitely.
_________________
Prepare with PERFECTION to claim Q≥50 and V≥40 !!!
GMATinsight .............(Bhoopendra Singh and Dr.Sushma Jha)
e-mail: info@GMATinsight.com l Call : +91-9999687183 / 9891333772
One-on-One Skype classes l Classroom Coaching l On-demand Quant course l Admissions Consulting

Most affordable l Comprehensive l 2000+ Qn ALL with Video explanations l LINK: Courses and Pricing
Click for FREE Demo on VERBAL & QUANT
Our SUCCESS STORIES: From 620 to 760 l Q-42 to Q-49 in 40 days l 590 to 710 + Wharton l
FREE GMAT Resource: 22 FREE (FULL LENGTH) GMAT CATs LINKS l NEW OG QUANT 50 Qn+VIDEO Sol.
CrackVerbal Representative
User avatar
G
Affiliations: CrackVerbal
Joined: 03 Oct 2013
Posts: 2017
Location: India
GMAT 1: 780 Q51 V46
Re: Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 21 Apr 2020, 04:16
Asad wrote:
Quote:
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

Hello experts,
EMPOWERgmatRichC, VeritasKarishma, Bunuel, chetan2u, IanStewart, ArvindCrackVerbal, AaronPond, GMATinsight, JeffTargetTestPrep, ccooley
What if the word ''minimum'' has be changed with ''maximum''?
Which one will be correct counting?
1/
Total --11
Right--6
Up--5

Or,

2/
Total--11
Right--4
Up--4
Back--2
Down--1

Also, is my counting right for the maximum possible length?

I appreciate your help.
Thanks__



Hello Asad,

Because you were counting the number of routes with the minimum possible length is why you considered that you had to travel only in the right and upward direction; your objective was to minimize the length.

As GMATinsight has already mentioned, the maximum possible length of the route will be infinite. Remember, you are looking for routes with maximum LENGTH. Length can be maximized by not reaching the destination and continuing to go around in circles in the grid.

And that’s exactly why the question is about finding the routes with the minimum possible length.

Hope that helps!
_________________
GMAT Tutor
User avatar
G
Status: Tutor - BrushMyQuant
Joined: 05 Apr 2011
Posts: 673
Location: India
Concentration: Finance, Marketing
Schools: XLRI (A)
GMAT 1: 700 Q51 V31
GPA: 3
WE: Information Technology (Computer Software)
Pat will walk from intersection X to intersection Y along a route that  [#permalink]

Show Tags

New post 20 Jun 2020, 09:09
Top Contributor
GMAT Club Bot
Pat will walk from intersection X to intersection Y along a route that   [#permalink] 20 Jun 2020, 09:09

Go to page   Previous    1   2   [ 33 posts ] 

Pat will walk from intersection X to intersection Y along a route that

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  





cron

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne