It is currently 14 Dec 2017, 16:56

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# Q. Every move up or down is 1 unit. Minimum distance between

Author Message
Intern
Joined: 05 Feb 2008
Posts: 22

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

Q. Every move up or down is 1 unit. Minimum distance between [#permalink]

### Show Tags

09 Feb 2008, 20:24
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Q. Every move up or down is 1 unit. Minimum distance between X and Y is 5 units. How many such paths exist in the diagram?

A. Six
B. Eight
C. Ten
D. Eighteen
E. Twenty

My question is - is there a way to calculate this easily without listing out the different paths?

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

Director
Joined: 01 May 2007
Posts: 793

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

Re: Number shortest paths from X to Y [#permalink]

### Show Tags

09 Feb 2008, 20:31
Are you sure that is the officially answer? I would have guessed 6 (always have to go 2 ways over and 3 down, 2*3 = 6). There is a question like this in the OA as well.

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

CEO
Joined: 21 Jan 2007
Posts: 2734

Kudos [?]: 1091 [0], given: 4

Location: New York City
Re: Number shortest paths from X to Y [#permalink]

### Show Tags

09 Feb 2008, 23:37
5! / 3! 2!

five slots to move. 3 up 2 right. those are the repeats.
_________________

You tried your best and you failed miserably. The lesson is 'never try'. -Homer Simpson

Kudos [?]: 1091 [0], given: 4

Director
Joined: 31 Mar 2007
Posts: 574

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

Re: Number shortest paths from X to Y [#permalink]

### Show Tags

11 Feb 2008, 04:41
You can solve it combinatorically, or visually. Or both.

I just scan it visually.

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

Intern
Joined: 05 Feb 2008
Posts: 22

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

Re: Number shortest paths from X to Y [#permalink]

### Show Tags

11 Feb 2008, 09:47
5! / 3! 2!

There are 5 slots to fill. There are 3 repetitions of up and 2 repetitions of the formula is the above. The denominator should contain the number of repetitions of the components.

Thanks!

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

Intern
Joined: 05 Feb 2008
Posts: 22

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

Re: Number shortest paths from X to Y [#permalink]

### Show Tags

11 Feb 2008, 09:48
P.S: This is from the PowerPREP test 1. Whats OA? Questions from the Official Guide books?

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

Senior Manager
Joined: 07 Jan 2008
Posts: 318

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

Location: Ann Arbor, Michigan
Schools: Ross Class of 2011
Re: Number shortest paths from X to Y [#permalink]

### Show Tags

11 Feb 2008, 12:24
Anytime I see low answer choices like that I'd count. Took me about 20 secs to do this problem I counted how many ways you could go if you went right then wrote it down and found how many ways you could go if you started up.

I think even if I had done math to get the answer I'd have quickly scanned the picture to make sure it worked. So in this case I skipped the math.

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

Re: Number shortest paths from X to Y   [#permalink] 11 Feb 2008, 12:24
Display posts from previous: Sort by

# Q. Every move up or down is 1 unit. Minimum distance between

Moderator: chetan2u

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne 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®.