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 X to intersection Y along a [#permalink]

Show Tags

01 Aug 2003, 08:36

00:00

A

B

C

D

E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct
0% (00:00) wrong based on 0 sessions

HideShow timer Statictics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

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?

Can you show me the best way to attack path questions? _________________

Will come back to that other post on "GMAT Classic" later in the show.

Got something stuck in my head with expressing this simple division conretely.

Okay, Kpadama,

120 ways to travel this route ------------------------------- 12 ways to travel the shortest.

So every 12th way there is a shortest route. This brings the total to 10 different minimum routes. this sounds so foreign

Stolyar, I think your way is just a coincidence. Twist around the number of up and down roads and is quite a different way.

Stolyar is exactly correct.

If you do not take the shortest route than there are an infinite number of ways to get from A to B. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

There are 3 roads from Pittsburgh to Ocean City, Md and four roads from Ocean city, Md. to Bay City,CA. If Allison drives from Pittsburgh to Bay City, CA and back, passes from Ocean City in both directions, and does not travel any road twice, how many different routes for the trip are possible? You see in this similar problem, can anybody come up with permus or combos to solve it.

So, getting back to Kpadama's way, I guess we state there are five diff. roads. We start with the first road and can go five different ways, . I'm lost here.

Will come back to that other post on "GMAT Classic" later in the show.

Got something stuck in my head with expressing this simple division conretely.

Okay, Kpadama,

120 ways to travel this route ------------------------------- 12 ways to travel the shortest.

So every 12th way there is a shortest route. This brings the total to 10 different minimum routes. this sounds so foreign

Stolyar, I think your way is just a coincidence. Twist around the number of up and down roads and is quite a different way.

Stolyar is exactly correct.

If you do not take the shortest route than there are an infinite number of ways to get from A to B.

Dear AkamaiBrah & stolyar,

I beg to differ, even though I consider you both my Guru's, that if the
number are changed from 3&2 to 7&2, your approach will fail. In addition,
I don't think we can treat this problem as a simple combination one.
I would like to get your feedback?

After posting the previous response, I realised that I was wrong. I think, I am forgetting even simple addition and basic logic.

That's okay. By daring to challenge us, then realizing after thinking more carefully that you are wrong, you undoubtably understand this problem (and combinations in general) much better than if you were to just accept what we say and move on. It is good that you took the time to turn this around in your head a few times.

Good job. _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993