Free GMAT Flashcards available for download!

P and C


 
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Problem Solving
View previous topic :: View next topic  
Author Message
nikhilagrawal
Rising GMAT Star


Joined: 12 Jun 2008
Posts: 81

Thanks given: 2
Thanked 1 times in 1 posts


PostPosted: Tue Jul 22, 2008 3:50 am    Post subject: P and C Reply with quote

65. Goldenrod and No Hope are in a horse race with 6 contestants. How many different arrangements of finishes are there if No Hope always finishes before Goldenrod and if all of the horses finish the race?
(A) 720
(B) 360
(C) 120
(D) 24
(E) 21

Pls explain with soln ..
Back to top


View user's profile Send private message
newera
Rising GMAT Star


Joined: 18 Jun 2008
Posts: 80

Thanks given: 0
Thanked 8 times in 6 posts


Test Date: September 2008
Target GMAT Score: 720

PostPosted: Tue Jul 22, 2008 4:19 am    Post subject: Reply with quote

I'm still learning permutation and combination, but will give it a shot.

I think the OA is C.

There are 6 contestants. If No Hope is before Goldenrod, then there are 5 arrangements how that is possible.

Either: NGXXXX, XNGXXX, XXNGXX, XXXNGXX, XXXXNG

Now you have to tackle the different arrangements for the other horses. There are 4! ways the four remaining horses can be arranged.

So, 4! * 5 = 24 * 5 = 120

I could be missing a step or very wrong...let me know if this is right. Thanks!
Back to top


View user's profile Send private message
airan
Really wants to Beat The GMAT!


Joined: 13 May 2008
Posts: 126

Thanks given: 0
Thanked 2 times in 2 posts


Target GMAT Score: 750
GMAT Score: 710

PostPosted: Tue Jul 22, 2008 5:48 am    Post subject: Reply with quote

Solution 1:
There can be 6! different possibilities alltogether. Now half of them will be where GoldenRod will be in first 3 and No hope in second 3 i.e. in half of them, one will be ahead of another.
So total combinations is 360.


Solution 2: ( Found on internet)

if A finishes 1... B could be in any of other 5 positions in 5 ways and other horses finish in 4! ways, so total ways 5*4!

if A finishes 2... B could be in any of the last 4 positions in 4 ways. but the other positions could be filled in 4! ways, so the total ways 4*4!

if A finishes 3rd... B could be in any of last 3 positions in 3 ways, but the other positions could be filled in 4! ways, so total ways 3*4!

if A finishes 4th... B could be in any of last 2 positions in 2 ways, but the other positions could be filled in 4! ways, so total ways... 2 * 4!

if A finishes 5th .. B has to be 6th and the top 4 positions could be filled in 4! ways..

A cannot finish 6th, since he has to be ahead of B

therefore total number of ways

5*4! + 4*4! + 3*4! + 2*4! + 4! = 120 + 96 + 72 + 48 + 24 = 360



I dont think either of them are the best approches..Can anyone provide a better and simpler approach ?

_________________
Thanks
Airan
Back to top


View user's profile Send private message
gupta.amit3
Just gettin' started!


Joined: 26 Jun 2008
Posts: 14

Thanks given: 2
Thanked 0 times in 0 posts


PostPosted: Tue Jul 22, 2008 6:21 am    Post subject: Reply with quote

I will go with C: 120.

Explanation as given by newera.
Back to top


View user's profile Send private message
newera
Rising GMAT Star


Joined: 18 Jun 2008
Posts: 80

Thanks given: 0
Thanked 8 times in 6 posts


Test Date: September 2008
Target GMAT Score: 720

PostPosted: Tue Jul 22, 2008 6:33 am    Post subject: Reply with quote

Ok, i think my answer is wrong because i assume that No Hope has to be right behind Goldenrod. But Airan pointed out that doesn't have to be the case. i.e. NXXGXX is very possible as well

Someone please explain for me too lol. Smile
Back to top


View user's profile Send private message
pepeprepa
GMAT Destroyer!


Joined: 08 Jul 2008
Posts: 660

Thanks given: 10
Thanked 43 times in 41 posts

Location: France

PostPosted: Tue Jul 22, 2008 6:34 am    Post subject: Reply with quote

For 6 contestants including Goldenrod and No hope
I agree with 5*4!=120

But we are false, Goldenrod can be anywhere after No Hope not just after. We did not read the question precisely.
It's 360 as Airan explained in his two methods.
Back to top


View user's profile Send private message
arorag
Really wants to Beat The GMAT!


Joined: 21 Jan 2008
Posts: 164

Thanks given: 1
Thanked 2 times in 2 posts


PostPosted: Tue Jul 22, 2008 8:08 am    Post subject: Reply with quote

Lets look at this way
6 H so they can arrange in 6!
Now this is uniform disturibution so 1/2 time G will be ahead of N and 1/2 N will be ahead of G.
Ans is 6!-6!/2 = 6! 1/2= 360
Back to top


View user's profile Send private message
beeparoo
Really wants to Beat The GMAT!


Joined: 17 Jun 2007
Posts: 200

Thanks given: 7
Thanked 8 times in 8 posts

Location: Canada

PostPosted: Wed Jul 23, 2008 7:30 pm    Post subject: Reply with quote

arorag wrote:
Lets look at this way
6 H so they can arrange in 6!
Now this is uniform disturibution so 1/2 time G will be ahead of N and 1/2 N will be ahead of G.
Ans is 6!-6!/2 = 6! 1/2= 360


Totally agree with Arorag except you don't need this redundant step: 6! - 6!/2.

(1/2)6! is enough based on logic.
Back to top


View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Problem Solving All times are GMT - 8 Hours
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You cannot download files in this forum



"GMAT" and other GMAC™ trademarks are registered trademarks of the Graduate Management Admission Council™. The Graduate Management Admission Council™ does not endorse, nor is it affiliated in any way with the owner or any content on this website. The opinions expressed here are solely those of the author or those of the members of this website. Copyright © 2008 BTG Test Prep, LLC. Powered by phpBB © 2001, 2005 phpBB Group.