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:
Want to score 90 percentile or higher on GMAT CR? Attend this free webinar to learn how to pre-think assumptions and solve the most challenging questions in less than 2 minutes.
Josh has to run an electrical wire from point a to point b
[#permalink]
Show Tags
Updated on: 30 Jun 2013, 14:27
4
30
00:00
A
B
C
D
E
Difficulty:
25% (medium)
Question Stats:
65% (00:59) correct 35% (01:39) wrong based on 412 sessions
HideShow timer Statistics
Attachment:
picture.jpg [ 2.53 KiB | Viewed 10090 times ]
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
Re: Grockit: similar to OG Quant qustion
[#permalink]
Show Tags
28 Aug 2010, 10:05
14
9
zisis wrote:
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
A 8 B 10 C 12 D 15 E 16
obv the answer can be found by counting the routes, but is there a better way?
You can notice that in order the length to be minimum wire should only go UP and RIGHT: namely twice UP and 4 times RIGHT.
So combination of UURRRR: # of permutations of 6 letters out of which there are 2 identical U's and 4 identical R's is \(\frac{6!}{2!4!}=15\).
Re: Grockit: similar to OG Quant qustion
[#permalink]
Show Tags
29 Aug 2010, 05:48
Bunuel wrote:
zisis wrote:
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
A 8 B 10 C 12 D 15 E 16
obv the answer can be found by counting the routes, but is there a better way?
You can notice that in order the length to be minimum wire should only go UP and RIGHT: namely twice UP and 4 times RIGHT.
So combination of UURRRR: # of permutations of 6 letters out of which there are 2 identical U's and 4 identical R's is \(\frac{6!}{2!4!}=15\).
Answer: D.
Hope it's clear.
thanks! thats exactly what i was looking for ! If i recall correcty, you must be the GMATclub combinations expert
[ IDEA how about we have experts stamps for certain individuals ! SC, combinations, RC, algebra etc....something the forum admins should consider...]
hi all please explain .. if there is a rectangle and this rectangle is divided in to four equal rectangles by building roads inside it then how many ways are there with which one can reach from one corner to other diagonally opposite corner. please try to explain in terms of combinations .like in terms of nCr etc.
hi all please explain .. if there is a rectangle and this rectangle is divided in to four equal rectangles by building roads inside it then how many ways are there with which one can reach from one corner to other diagonally opposite corner. please try to explain in terms of combinations .like in terms of nCr etc.
thanks
You need to find permutations of UURR = 4!/2!2! = 6
_________________
think of it like this You have four moves to make to reach the opposite corner
two moves are up and two moves are right
now, any order of moves would always get to the corner
the question really is that out of move1,2,3&4 which two you pick to be the Up move (the other two will be the right move). The ways to do this is C(4,2), choosing 2 out of 4.
_________________
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
Show Tags
09 Jun 2016, 01:14
zisis wrote:
Attachment:
picture.jpg
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
A. 8 B. 10 C. 12 D. 15 E. 16
out of six we need to choose 4 on x-axis or out of six we need to choose 2 on y axis so 6c2 or 6c4
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
Show Tags
27 Jun 2017, 11:20
1
Top Contributor
1
zisis wrote:
Attachment:
picture.jpg
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
A. 8 B. 10 C. 12 D. 15 E. 16
This is a great candidate for applying the Mississippi Rule The rule is useful for arranging a group of items in which some of the items are identical. It goes like this:
If there are n objects where A of them are alike, another B of them are alike, another C of them are alike, and so on, then the total number of possible arrangements = n!/[(A!)(B!)(C!)....]
So, for example, we can calculate the number of arrangements of the letters in MISSISSIPPI as follows: There are 11 letters in total There are 4 identical I's There are 4 identical S's There are 2 identical P's So, the total number of possible arrangements = 11!/[(4!)(4!)(2!)]
-----NOW ONTO THE QUESTION-------- To get from point a to point b, we must travel UP (U) two times, and travel RIGHT (R) 4 times In other words, we want to determine the number of DIFFERENT ways to arrange 2 U's and 4 R's let's apply the above rule.
There are 6 letters in total There are 2 identical U's There are 4 identical R's Total number of possible arrangements = 6!/[(2!)(4!)] = 15
Concentration: General Management, International Business
GPA: 3.97
WE: Engineering (Education)
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
Show Tags
17 Sep 2019, 21:20
zisis wrote:
Attachment:
picture.jpg
Josh has to run an electrical wire from point a to point b along a circuit that is restricted to the grid shown to the left. How many possible paths could Josh use that have the minimum possible length?
A. 8 B. 10 C. 12 D. 15 E. 16
n things can be arranged in n! ways So, 6 things can be arranged in 6! ways
4 horizontal and 2 vertical paths can rearrange within themselves
So total number of ways = 6! / 4!x2! = 15 D is correct.
gmatclubot
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
17 Sep 2019, 21:20