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.
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:
Join a FREE 1-day verbal workshop and learn how to ace the Verbal section with the best tips and strategies. Limited for the first 99 registrants. Register today!
Join a FREE live webinar with examPAL and Admissionado and learn how to master GMAT Critical Reasoning questions and the 6-pointed star of MBA application essay glory. Save your spot today!
We'll be posting questions in DS/PS/SC/CR in competition mode. Detailed and quickest solution will get kudos. Will be collecting new links to all questions in this topic. Here you can also check links to fresh questions posted.
The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
17 Dec 2012, 07:31
3
27
00:00
A
B
C
D
E
Difficulty:
5% (low)
Question Stats:
85% (00:56) correct 15% (01:27) wrong based on 1152 sessions
HideShow timer Statistics
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?
The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
17 Dec 2012, 07:33
11
14
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.
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
17 Dec 2012, 11:26
Bunuel wrote:
Attachment:
Path.png
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.
Dear Bunnel, Could you please clarify it more...How the forks are working?
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
17 Dec 2012, 11:46
Drik wrote:
Bunuel wrote:
Attachment:
Path.png
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.
Dear Bunnel, Could you please clarify it more...How the forks are working?
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
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
28 Dec 2012, 01:52
1
Walkabout wrote:
Attachment:
Path.png
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
Technique here is to multiply the number of choices in every point of decision: \(2*2*3 = 12\)
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
15 Jul 2014, 03:03
kshitij89 wrote:
Why is it multiplied here ? Why can't we add all options ?
Posted from my mobile device
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.
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
21 Jun 2016, 10:24
Walkabout wrote:
Attachment:
Path.png
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
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:
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
14 May 2017, 23:07
1
We will do addition here also to answer the question posted earlier. a We will first add 2 choice[1+1] b Then we will add 2 choices [1+1] c Then we will add 3 choices [1+1+1] Then we will multiply the straight lines first to get 1 Then we will multiply the different probabilities a,b,c to get 12
Walkabout wrote:
Attachment:
Path.png
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
_________________
If you have any queries, you can always whatsapp on my number +91945412028 Ayush
The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
Updated on: 16 Apr 2018, 12:38
Top Contributor
Walkabout wrote:
Attachment:
Path.png
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
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)
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
28 Feb 2018, 12:59
Bunuel wrote:
Attachment:
Path.png
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.
Did you use combination formula? pls explain. I cant count visually all these routes
Re: The diagram above shows the various paths along which a mous
[#permalink]
Show Tags
09 Mar 2019, 07:36
Hello from the GMAT Club BumpBot!
Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).
Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________