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:

The diagram below shows the various paths along which a [#permalink]
25 Apr 2012, 06:54

00:00

A

B

C

D

E

Difficulty:

5% (low)

Question Stats:

81% (01:22) correct
19% (00:31) wrong based on 64 sessions

Attachment:

img2ao.jpg [ 20.36 KiB | Viewed 1897 times ]

The diagram below shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pallet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracting any point along a path?

Re: The diagram below shows the various paths along which a [#permalink]
25 Apr 2012, 07:15

2

This post received KUDOS

Expert's post

emil3m wrote:

The diagram below shows the various paths along which a mouse can travel from point X, where it is released, to point Y, where it is rewarded with a food pallet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracting any point along a path?

A. 6 B. 7 C. 12 D. 14 E. 17

I know my approach is wrong. Can you please help me understand why the permutation formula does not work for this problem? ( We are counting without replacement and the order matters, so I tried n!/(n-3)! where n=7

Thank you, all!

It's not clear what's you logic behind applying permutation to this problem. I guess 3 is # of the forks on the road, but we are not choosing those 3 out of 7 (?).

Anyway, the problem is about simple counting. There are 3 forks in the road: 2 choices for the first one, 2 for the second and 3 for the third. Hence total # of ways is 2*2*3=12.

Re: The diagram below shows the various paths along which a [#permalink]
25 Apr 2012, 07:25

Bunuel wrote:

It's not clear what's you logic behind applying permutation to this problem. I guess 3 is # of the forks on the road, but we are not choosing those 3 out of 7 (?).

Anyway, the problem is about simple counting. There are 3 forks in the road: 2 choices for the first one, 2 for the second and 3 for the third. Hence total # of ways is 2*2*3=12.

Answer: C.

7 paths to chose from and you must pick 3 to get to the destination..

I haven't seen a permutation problem yet in the OG, so maybe the difference in identifying when to use it will show when I see one.

Re: The diagram below shows the various paths along which a [#permalink]
25 Apr 2012, 07:31

1

This post received KUDOS

Expert's post

emil3m wrote:

Bunuel wrote:

It's not clear what's you logic behind applying permutation to this problem. I guess 3 is # of the forks on the road, but we are not choosing those 3 out of 7 (?).

Anyway, the problem is about simple counting. There are 3 forks in the road: 2 choices for the first one, 2 for the second and 3 for the third. Hence total # of ways is 2*2*3=12.

Answer: C.

7 paths to chose from and you must pick 3 to get to the destination..

I haven't seen a permutation problem yet in the OG, so maybe the difference in identifying when to use it will show when I see one.

As you can see from the solution there are 12 different paths not 7. There are 2+2+3=7 different line segments separated by 3 forks.

Re: The diagram below shows the various paths along which a [#permalink]
30 Aug 2013, 08:03

Bunuel wrote:

emil3m wrote:

Bunuel wrote:

It's not clear what's you logic behind applying permutation to this problem. I guess 3 is # of the forks on the road, but we are not choosing those 3 out of 7 (?).

Anyway, the problem is about simple counting. There are 3 forks in the road: 2 choices for the first one, 2 for the second and 3 for the third. Hence total # of ways is 2*2*3=12.

Answer: C.

Buneul, Could you please explain why the answer is 12 and not 7. Since there are 7 separate forks, how could there be twelve separate ways the mouse could travel? Why are you multiplying the numbers instead of adding?

Re: The diagram below shows the various paths along which a [#permalink]
31 Aug 2013, 04:57

1

This post received KUDOS

Expert's post

anujkhatiwada wrote:

Bunuel wrote:

emil3m wrote:

It's not clear what's you logic behind applying permutation to this problem. I guess 3 is # of the forks on the road, but we are not choosing those 3 out of 7 (?).

Anyway, the problem is about simple counting. There are 3 forks in the road: 2 choices for the first one, 2 for the second and 3 for the third. Hence total # of ways is 2*2*3=12.

Answer: C.

Buneul, Could you please explain why the answer is 12 and not 7. Since there are 7 separate forks, how could there be twelve separate ways the mouse could travel? Why are you multiplying the numbers instead of adding?

Thanks!

There are 3 forsk not 7:

As for multiplication: it's called Principle of Multiplication. If one event can occur in m ways and a second can occur independently of the first in n ways, then the two events can occur in m*n ways.

On September 6, 2015, I started my MBA journey at London Business School. I took some pictures on my way from the airport to school, and uploaded them on...

When I was growing up, I read a story about a piccolo player. A master orchestra conductor came to town and he decided to practice with the largest orchestra...

Although I have taken many lessons from Field Foundations that can be leveraged later, the lessons that will stick with me the strongest have been the emotional intelligence lessons...

Tick, tock, tick...the countdown to January 7, 2016 when orientation week kicks off. Been a tiring but rewarding journey so far and I really can’t wait to...