Find all School-related info fast with the new School-Specific MBA Forum

It is currently 18 May 2013, 05:13
Customize  |  Hide

The diagram below shows the various paths along which a

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
Intern
Intern
Joined: 24 Apr 2012
Posts: 2
Followers: 0

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

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

Question Stats:

92% (01:28) correct 8% (00:00) wrong based on 0 sessions
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!
[Reveal] Spoiler: OA

Attachments

img2ao.jpg
img2ao.jpg [ 20.36 KiB | Viewed 907 times ]

2 KUDOS received
GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11506
Followers: 1790

Kudos [?]: 9513 [2] , given: 826

Re: The diagram below shows the various paths along which a [#permalink] New post 25 Apr 2012, 08:15
2
This post received
KUDOS
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.

Answer: C.
_________________

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!


What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

Intern
Intern
Joined: 24 Apr 2012
Posts: 2
Followers: 0

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

Re: The diagram below shows the various paths along which a [#permalink] New post 25 Apr 2012, 08: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.
1 KUDOS received
GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11506
Followers: 1790

Kudos [?]: 9513 [1] , given: 826

Re: The diagram below shows the various paths along which a [#permalink] New post 25 Apr 2012, 08:31
1
This post received
KUDOS
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.

As for permutation. Try Combinatorics chapter of Math Book for theory: math-combinatorics-87345.html

Also try some questions on combinations to practice:
DS: search.php?search_id=tag&tag_id=31
PS: search.php?search_id=tag&tag_id=52
Hard questions on combinations and probability with detailed solutions: hardest-area-questions-probability-and-combinations-101361.html (there are some about permutation too)

Hope it helps.
_________________

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!


What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

Re: The diagram below shows the various paths along which a   [#permalink] 25 Apr 2012, 08:31
    Similar topics Author Replies Last post
Similar
Topics:
New posts In the diagram below, there is a circumference with center stolyar 1 16 Oct 2003, 02:06
New posts In the diagram below, there is a circumference with its stolyar 9 16 Oct 2003, 03:45
New posts In the diagram below, there is a circle with center B. stolyar 1 16 Oct 2003, 09:13
New posts An odd number of stones lie along a straight path, the Value 3 28 Apr 2008, 04:17
New posts EXPERTS_POSTS_IN_THIS_TOPIC The diagram above shows the various paths along which a mous Walkabout 5 17 Dec 2012, 07:31
Display posts from previous: Sort by

The diagram below shows the various paths along which a

  Question banks Downloads My Bookmarks Reviews  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

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®.