The diagram above shows the various paths along which a mous

Question

https://gmatclub.com/forum/download/file.php?id=18940 The diagram above 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 pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path? (A) 6 (B) 7 (C) 12 (D) 14 (E) 17 Path.png

Bunuel · Accepted Answer

https://gmatclub.com/forum/download/file.php?id=18941 The diagram above 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 pellet. How many different paths from X to Y can the mouse take if it goes directly from X to Y without retracing any point along a path? (A) 6 (B) 7 (C) 12 (D) 14 (E) 17 There are 3 forks along the path: 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. Path.png

Bunuel · Answer

Somewhat similar questions: alicia-lives-in-a-town-whose-streets-are-on-a-grid-system-126920.html josh-has-to-run-an-electrical-wire-from-point-a-to-point-b-99962.html as-per-the-given-figure-there-are-many-horizontal-and-134453.html pat-will-walk-from-intersection-x-to-intersection-y-along-a-104817.html josh-has-to-run-an-electrical-wire-from-point-a-to-point-b-99962.html every-morning-casey-walks-from-her-house-to-the-bus-stop-104236.html Hope this helps.

BrentGMATPrepNow · Answer

https://i.imgur.com/rG6MWmR.png

First recognize that, in order to get from point X to point Y, we MUST travel through points A,B,C,D,E and F.

So, we can take the task of getting from point X to Y and break it into stages.

Stage 1 : Move from point X to point A
There's only 1 possible route, so we can complete stage 1 in  1  way.

Stage 2 : Move from point A to point B
There are 2 possible routes, so we can complete stage 2 in  2  ways.

Stage 3 : Move from point B to point C
There's only 1 possible route, so we can complete stage 3 in  1  way.

Stage 4 : Move from point C to point D
There are 2 possible routes, so we can complete stage 4 in  2  ways.

Stage 5 : Move from point D to point E
There's only 1 possible route, so we can complete stage 5 in  1  way.

Stage 6 : Move from point E to point F
There are 3 possible routes, so we can complete stage 6 in  3  ways.

Stage 7 : Move from point F to point Y
There's only 1 possible route, so we can complete stage 7 in  1  way.

By the Fundamental Counting Principle (FCP), we can complete all 7 stages (and thus move from point X to point Y) in  (1)(2)(1)(2)(1)(3)(1)  ways (= 12 ways)

Answer: C

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. So, be sure to learn it.

RELATED VIDEOS
 https://www.youtube.com/watch?v=w5d5bvCRyd4

https://www.youtube.com/watch?v=_PFBp2BoMUY

https://www.youtube.com/watch?v=05a0A7vjG8I

Carcass · Answer

Also counting is fast

12 or 11 paths. 12 is the only among the options.

So C

Drik · Answer

Dear Bunnel,
Could you please clarify it more...How the forks are working?

Carcass · Answer

is pretty simple: one the first fork you have 2 choices - right and left; idem for the second one; 3 for the third one: right, left and central to the goal. 2*2*3=12

That's it

mbaiseasy · Answer

Technique here is to multiply the number of choices in every point of decision:  
 2*2*3 = 12

Answer: C

Jazmet · Answer

Hi Brunel - Would you help us with more such questions?

kshitij89 · Answer

Why is it multiplied here ? Why can't we add all options ?

Posted from my mobile device

Bunuel · Answer

Because of  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.

For example, if you have two pairs of shoes, A and B, and two shirts, X and Y, then there will be 2*2 = 4 shoes-shirt combinations:
AX;
AY;
BX;
BY.

Hope it's clear.

ScottTargetTestPrep · Answer

The best way to solve this problem is to use the idea of the fundamental counting principle. In a more standard form you could be asked a question, such as if Tom as 3 belts, 4 ties, and 6 shirts, how many outfits could he make with those items? We can consider each item a decision point, i.e., belts, ties, and shirts. To solve this, we just need to multiply the number of decisions Tom can make together, so:

3 x 4 x 6 = 72 ways.

Tom has 72 options when dressing with those items.

This same logic can be applied to this problem here. We can first determine the number ways the mouse can go from one point to the next.

X to A = 1

A to B = 2

B to C = 1

C to D= 2

D to E = 1

E to F = 3

F to Y =1

Therefore, to find the total number of ways from X to Y we can multiply all these numbers together:

1 x 2 x 1 x 2 x 1 x 3 x 1 = 12 ways.

There are 12 different paths.

Answer is C.

OreoShake · Answer

can anyone answer this question using combinatorics please?

AK125 · Answer

For the first point you have two options (2C1) for the C, same for the second point (2C1), for third point you have 3 options (3C1).

--> 2C1 * 2C1 * 3C1 = 2*2*3 = 12

aayushamj · Answer

We will do addition here also to answer the question posted earlier.
a We will first add 2 choice 
b Then we will add 2 choices  
c Then we will add 3 choices  
Then we will multiply the straight lines first to get 1
Then we will multiply the different probabilities a,b,c to get 12

Shiv2016 · Answer

Here we multiply because all tasks are required i.e. we can't go directly from x to y.

DIFFERENT ways to go from x to y= 2*2*3= 12

maxro3x · Answer

My computation was a little bit different.
I do understand the logic behind 2*2*3 = 12 routes.
But shouldn't it be 2*2*5 = 20 routes?
Bcz, IMO, there can be 2 other routes in the 3rd tranche as well, one "S" and a "reverse-S". As per the question, there shouldn't be any retracing, and these 2 routes don't retrace any old route. Any opinions on this?

bumpbot · Answer

Automated notice from GMAT Club BumpBot: 

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

 This post was generated automatically.

The diagram above shows the various paths along which a mous

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards

GMAT Problem Solving (PS) Questions

The diagram above shows the various paths along which a mous

Prep Toolkit

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards