It is currently 19 Sep 2017, 06:44

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

# OG-Question 316-Page 118-Pat goes from intersection X to Y

Author Message
Manager
Joined: 14 May 2005
Posts: 85

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

Location: San Francisco
OG-Question 316-Page 118-Pat goes from intersection X to Y [#permalink]

### Show Tags

14 Jun 2005, 14:34
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Please refer the question number 316 in Problem Solving section of The Official Guide. For those who do not have the guide, refer the following link.

http://www.gmatclub.com/phpbb/viewtopic.php?t=2165

The Official Guide explains that the answer can be reached by counting the number of routes manually. But that does not sit well within me. I also found that few club members tried to solve the problem using combination formulas. However, there is no sufficient support for the reasoning. Please see: http://www.gmatclub.com/phpbb/viewtopic.php?t=1790

Question:
Is there really an alternative solution available for this problem without counting routes manually? If so, please explain in detail.

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

Manager
Joined: 22 Apr 2005
Posts: 129

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

Location: Los Angeles

### Show Tags

14 Jun 2005, 16:02

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

Manager
Joined: 28 Sep 2004
Posts: 81

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

Location: New York City
Re: OG-Question 316-Page 118-Pat goes from intersection X to [#permalink]

### Show Tags

14 Jun 2005, 16:13
I can just say that a similar question was in my test a year ago. Although there were 10 paths up and 10 to the right > at 9th there were 2 options, etc .. so there were like 200 possibilities, no way you can do it manually

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

Manager
Joined: 14 May 2005
Posts: 85

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

Location: San Francisco

### Show Tags

14 Jun 2005, 17:02
Tyr wrote:

Tyr:

Thanks much! I found the solution proposed by Shaq in testmagic forum is interesting.

Michalky, thanks too!

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

Manager
Joined: 22 Apr 2005
Posts: 129

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

Location: Los Angeles

### Show Tags

14 Jun 2005, 17:27
I though you were asking about solution not the formula I.e. how do you know given formula always works?
The key here is to rephrase the problem from obscure form given into something mathematical.
You write each solution as a fixed sequence of slots (number of columns/rows) filled up with numbers you get from splitting up number of rows/columns. Then count.
And yes, OG is right. It is much faster to do some counting with elimination because the numbers here are small.

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

14 Jun 2005, 17:27
Display posts from previous: Sort by