BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Finding Paths

Expert replies
by wilderness » Fri Jul 18, 2008 1:38 pm
Hi,

Does anyone have any general formula how to attack a problem like this. I solved it by counting each of the possible shortest ways. But of course if there had been 10 streets and 20 avenues my method would not be useful. I have a feeling that it has got something to do with combinations but I have no further idea. What do you think


The right answer is 10.
Attachments
Clipboard111.jpg
Join the discussion
Source: — Problem Solving |

Re: Finding Paths

by parallel_chase » Fri Jul 18, 2008 3:16 pm
wilderness wrote:Hi,

Does anyone have any general formula how to attack a problem like this. I solved it by counting each of the possible shortest ways. But of course if there had been 10 streets and 20 avenues my method would not be useful. I have a feeling that it has got something to do with combinations but I have no further idea. What do you think


The right answer is 10.

No matter which route X take to get to Y, X will have to cross 2 avenues and 3 streets.

No. of ways X can take to get to Y = 5!
No. of ways X can cross avenues = 2!
No. of ways X can cross streets = 3!

Therefore 5! / (2! 3!) => 10
Join the discussion

Re: Finding Paths

by asigheartau » Fri Jul 18, 2008 7:56 pm
parallel_chase wrote:
wilderness wrote:
No. of ways X can take to get to Y = 5!

How do you determine that?
Alin Sigheartau
Join the discussion

by Ian Stewart » Sat Jul 19, 2008 12:14 am
See solution here:

www.beatthegmat.com/og-195-197-unsolved ... 12321.html

Yes, it can be solved for any size of grid.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com
Join the discussion