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:
Storytelling for R2 Applications with The MBA Exchange. Followed by Zoom Profile Review Q&A. Wednesday, December 1st at 9:30 AM PT | 12:30 PM ET | 11 PM IST
Its your chance to get a 20% discount on any Target Test Prep GMAT plan. With a Target Test Prep course, you’ll receive a personalized study plan that adjusts to your specific needs, guiding you through a mix of text- and more.
Join us in the launch event of P.A.C.E (Personalized Adaptive Course Engine), the next generation of Personalized Learning that will change how you prepare for the GMAT. P.A.C.E allows you to become a more effective learner, help save time, and more.
We offer a 110-Point score improvement guarantee, and we are so confident you will have success with our course that we guarantee it. Need a higher GMAT score? For $1, you can sign up for a 5-Day full-access trial of TTP’s 5-star rated GMAT course.
Mastering DS requires a very solid understanding of how much information is enough to answer the question. Learn common mistakes to avoid & the importance of Drawing inferences along with Question Stem Analysis to answer questions confidently.
Attend this webinar to learn how to leverage meaning and logic to solve the most challenging (700+ level) Sentence Correction Questions with 90+ % Accuracy
Target Test Prep is excited to announce that the Executive Assessment Course is now live! With TTP’s on-demand Executive Assessment prep course, you can study with confidence and earn your best score possible on the EA test.
63%
(00:57)
correct
37%
(01:38)
wrong
based on 703
sessions
HideShow
timer Statistics
Attachment:
picture.jpg [ 2.53 KiB | Viewed 14763 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]
28 Aug 2010, 09:05
17
Kudos
10
Bookmarks
Expert Reply
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: Josh has to run an electrical wire from point a to point b
[#permalink]
27 Jun 2017, 10:20
3
Kudos
1
Bookmarks
Expert Reply
Top Contributor
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
Re: Grockit: similar to OG Quant qustion
[#permalink]
29 Aug 2010, 04: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...]
find the no of ways
[#permalink]
23 Oct 2010, 05:48
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.
Re: find the no of ways
[#permalink]
23 Oct 2010, 09:11
harshsingla wrote:
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 _________________
Re: find the no of ways
[#permalink]
23 Oct 2010, 09:27
1
Bookmarks
harshsingla wrote:
but how 4c2..??? please explain!!
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]
09 Jun 2016, 00: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
Concentration: General Management, International Business
GMAT 1:570 Q49 V20
GPA: 3.97
WE:Engineering (Education)
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
17 Sep 2019, 20:20
1
Kudos
1
Bookmarks
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. _________________
Hello. I am a GMAT Quant tutor who wants to invest in students' success. I love sharing my knowledge of quant. Join me and I will show how to master quant with my unique teaching methodology. I've written a book on Number properties as well!
Re: Josh has to run an electrical wire from point a to point b
[#permalink]
11 Aug 2021, 08:32
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. _________________
One of the fastest-growing graduate business schools in Southern California, shaping the future by developing leading thinkers who will stand at the forefront of business growth. MBA Landing | School of Business (ucr.edu)