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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

Meg and Bob are among the 5 participants in a cycling race. [#permalink]

Show Tags

07 Jan 2008, 06:05

3

This post received KUDOS

27

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

45% (medium)

Question Stats:

61% (01:57) correct
39% (01:14) wrong based on 961 sessions

HideShow timer Statistics

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

There are 5! possible ways for the 5 participants to finish the race without any ties. Logically, Meg will finish ahead of Bob in exactly half of these outcomes

ok, this is how i started to think about it ... didnt get the right answer though

there are 5 spots, so meg could come in first, second, third, fourth or fifth

if she comes in first, then there are 4 spots behind her that bob could be in ... so thats 4! = 24 ways

if she comes in second, then there are 3 spots behind her ... bob could be in any of those, so thats 3! = 6 ways

if she was in third, only two spots behind her, so thats 2 ways

if she comes in fourth, only one way ... adding them up, i get 24+6+2+1 = 33 ways.

Where did i go wrong ?

look at the problem this way:

M _ _ _ _ = 4! ways as you said _ M _ _ _ = 3 ways for Bob, still 3 options for the next (because unlike Bob she can occupy the first slot), 2 options for the the fourth one and 1 for the last. So 3*3*2*1 which is 3*3! _ _ M _ _ = 2*3! _ _ _ M _ = 1*3!

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

C.

M finishes first then B can finish 4 ways and other three can finish in 3! ways = 1*4*3! = 24 M finishes second then B can finish in 3 ways and other three can finish in 3! ways = 1*3*3! = 18 M finishes third then B can finish in 2 ways and other three can finish in 3! ways = 1*2*3! = 12 M finishes fourth then B can finish in 1 way and other three can finish in 3! ways = 1*1*3! = 6

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

MBXXX we have 4! possibilities = 24 XMBXX we have 3! ways to arrange the X's and 3 ways to arrange B so 3!*3 =18 XXMBX we have 3! ways to arrange the X's and 2 ways to arrange B. so 3!*2 =12 XXXMB only 3! =6

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

Ans: C. 60 M stands for Meg If M takes first place, the other 4 can be arranged in 4! ways. If M takes second place, the other 4 can be arranged in 3 * 3! ways such that Bob finishes after Meg. If M takes third place, the other 4 can be arranged in 6 * 2! ways such that Bob finishes after Meg. If M takes fourth place, the other 4 can be arranged in 3! ways such that Bob finishes after Meg. M cannot take fifth place, because in tat case Bob will finish ahead of Meg.

So total number of possibilities is = 4! + 3 * 3! + 6 * 2! + 3! = 60

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob? A. 24 B. 30 C. 60 D. 90 E. 120

Total # of ways the race can be finished is 5!. In half of the cases Meg finishes ahead of Bob and in other half Bob finishes ahead of Meg. So, ways Meg to finish ahead of Bob is 5!/2=60.

Answer: C.

fortsill wrote:

That being said, the other technique of arriving at the same solution by 5!/2 is far more elegant and time saving!

Do you know of any other such examples where the problem seems a lot simpler than it really is...

Re: Meg and Bob are among the 5 participants in a cycling race. [#permalink]

Show Tags

06 Jul 2013, 19:03

1

This post received KUDOS

Subject: Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

I solved in a different way: All the possible positions: 5! = 120 Restriction: we have to eliminate all the combinations in which Bob finishes ahead of Meg:

If Bob finishes 1st, (_ _ _ _ B) Meg could finish 2nd, 3th, 4th or 5th --> 4 possibilities. If Bob finishes 2nd, Meg finishes 3th, 4th or 5th. --> 3 possibilities The same for Bob 3th and 4th. Bob can not finishes 5th.

This sum up to 10 combinatios: 4 + 3 + 2 + 1 = 10.

In addition, we have the rest of the combinations of the of the positions remaining 3 competitors: 3!

Now, we have to combine the positions of Meg and Bob with the positions of the rest of the competitors:

3! * 10 = 60

Finally: 120 - 60 = 60 _________________

Encourage cooperation! If this post was very useful, kudos are welcome "It is our attitude at the beginning of a difficult task which, more than anything else, will affect It's successful outcome" William James

Re: Meg and Bob are among the 5 participants in a cycling race. [#permalink]

Show Tags

30 Dec 2013, 06:09

marcodonzelli wrote:

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

By symmetry 5! /2

Meg will finish ahead of Bob in half of all the possible ways

Re: Meg and Bob are among the 5 participants in a cycling race. [#permalink]

Show Tags

12 Mar 2015, 11:34

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob? A. 24 B. 30 C. 60 D. 90 E. 120

When I first saw this I thought combination but then realized its permutation because order does matter(Meg has to finish ahead of Bob). So we can use n!/(n-k)! n represents the 5 participants and k would be the 3 remaining cyclers which the orders do not matter correct? so 5!/(5-3)!= 60 answer is C

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob? A. 24 B. 30 C. 60 D. 90 E. 120

When I first saw this I thought combination but then realized its permutation because order does matter(Meg has to finish ahead of Bob). So we can use n!/(n-k)! n represents the 5 participants and k would be the 3 remaining cyclers which the orders do not matter correct? so 5!/(5-3)!= 60 answer is C

Is this a correct approach?

I don't think so. You have used nPr = 5P3 which we use when we have to choose and arrange 3 objects out of 5. The logic here is a bit different. I suggest you to check out the solutions given above.
_________________

Re: Meg and Bob are among the 5 participants in a cycling race. [#permalink]

Show Tags

13 May 2015, 01:50

marcodonzelli wrote:

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

My approach was I counted Meg and Bob as one entity (in which Meg is always ahead of Bob) and then carried out the Permutations for 4 participants instead of 5. That way 4 participants will be arranged in 4! factorial ways ie. 24 ways. But when I checked the answers I found out that there was some flaw in my logic. Can someone please let me know what went wrong ?

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

My approach was I counted Meg and Bob as one entity (in which Meg is always ahead of Bob) and then carried out the Permutations for 4 participants instead of 5. That way 4 participants will be arranged in 4! factorial ways ie. 24 ways. But when I checked the answers I found out that there was some flaw in my logic. Can someone please let me know what went wrong ?

You have considered one of the scenarios of the total possible combinations. When you assume Meg & Bob as one entity you only take the case where Bob is the next person behind Meg.

Imagine a situation where Meg finishes 1st, since Bob has to finish behind Meg, Bob can finish at any place from 2nd to the 5th. Similarly when Meg finishes 2nd, Bob can finish at any place from 3rd to 5th and so on. Combining them as one entity would have worked had the question constrained Bob & Meg to finish the race in consecutive positions.

Meg and Bob are among the 5 participants in a cycling race. If each participant finishes the race and no two participants finish at the same time, in how many different possible orders can the participants finish the race so that Meg finishes ahead of Bob?

A. 24 B. 30 C. 60 D. 90 E. 120

My approach was I counted Meg and Bob as one entity (in which Meg is always ahead of Bob) and then carried out the Permutations for 4 participants instead of 5. That way 4 participants will be arranged in 4! factorial ways ie. 24 ways. But when I checked the answers I found out that there was some flaw in my logic. Can someone please let me know what went wrong ?

"Meg finishes ahead of Bob" is different from "Bob finishes immediately after Meg". Meg could finish way ahead of Bob or just ahead.

You accounted for cases such as: Meg, Bob, A, B, C and C, Meg, Bob, A, B

etc but how about cases such as: Meg, B, Bob, A, C?

You need to use the principle of symmetry here. Check out the link in gave in my post above.
_________________

After days of waiting, sharing the tension with other applicants in forums, coming up with different theories about invites patterns, and, overall, refreshing my inbox every five minutes to...

I was totally freaking out. Apparently, most of the HBS invites were already sent and I didn’t get one. However, there are still some to come out on...

There is without a doubt a stereotype for recent MBA grads – folks who are ambitious, smart, hard-working, but oftentimes lack experience or domain knowledge. Looking around and at...