• EMPOWERgmat Slider
    1 Hour Free
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    EMPOWERgmat Slider
  • Varsity Tutors
    Award-winning private GMAT tutoring
    Register now and save up to $200

    Available with Beat the GMAT members only code

    MORE DETAILS
    Varsity Tutors
  • Economist Test Prep
    Free Trial & Practice Exam
    BEAT THE GMAT EXCLUSIVE

    Available with Beat the GMAT members only code

    MORE DETAILS
    Economist Test Prep
  • Target Test Prep
    5-Day Free Trial
    5-day free, full-access trial TTP Quant

    Available with Beat the GMAT members only code

    MORE DETAILS
    Target Test Prep
  • Veritas Prep
    Free Veritas GMAT Class
    Experience Lesson 1 Live Free

    Available with Beat the GMAT members only code

    MORE DETAILS
    Veritas Prep
  • Kaplan Test Prep
    Free Practice Test & Review
    How would you score if you took the GMAT

    Available with Beat the GMAT members only code

    MORE DETAILS
    Kaplan Test Prep
  • PrepScholar GMAT
    5 Day FREE Trial
    Study Smarter, Not Harder

    Available with Beat the GMAT members only code

    MORE DETAILS
    PrepScholar GMAT
  • Magoosh
    Magoosh
    Study with Magoosh GMAT prep

    Available with Beat the GMAT members only code

    MORE DETAILS
    Magoosh
  • e-gmat Exclusive Offer
    Get 300+ Practice Questions
    25 Video lessons and 6 Webinars for FREE

    Available with Beat the GMAT members only code

    MORE DETAILS
    e-gmat Exclusive Offer

How many possible orders

This topic has 2 expert replies and 1 member reply
phanikpk Senior | Next Rank: 100 Posts Default Avatar
Joined
06 Jun 2014
Posted:
66 messages
Followed by:
1 members

How many possible orders

Post Sun Jul 06, 2014 6:20 pm
Elapsed Time: 00:00
  • Lap #[LAPCOUNT] ([LAPTIME])
    Dear Experts, Please help

    Meg and Bob among the five participants in a cycling race. If each participant finishes the race so that 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?

    Thanks in advance

    Need free GMAT or MBA advice from an expert? Register for Beat The GMAT now and post your question in these forums!

    GMAT/MBA Expert

    Post Sun Jul 06, 2014 6:23 pm
    Short answer:

    There are 5!, or 120 possible arrangements. Half the time Meg will beat Bob (and the other half of the time Bob will beat Meg), so Meg is ahead of Bob in 5!/2, or 60, of the arrangements. This is the way the GMAC "wants" you to solve the problem: avoid the clunky casework!


    Long answer:

    We'll just do the casework. Let's call the racers Meg, Bob, X, Y, and Z.

    If Meg finishes FIRST, we only have to order the other four cyclists. They can be ordered in 4!, or 24 ways.

    If Meg finishes SECOND, she'll be ahead of Bob if Bob DOESN'T finish first. So we need
    * X, Y, or Z to finish first
    * then to order Bob and the other two racers (of X, Y, Z) who didn't win

    We have 3 choices for the winner and 3*2*1 ways of arranging the others, for 3 * 3!, or 18 arrangements.

    If Meg finishes THIRD, we need
    * Two of X, Y, and Z to finish first and second
    * then to order Bob and the last racer

    We have 3*2 choices for the first two and 2*1 for the last two, for a total of 6*2, or 12 arrangements.

    If Meg finishes FOURTH, we need Bob to finish last. So we only arrange the other three racers, for 6 total arrangements.

    Obviously Meg can't finish last, so we have a total of 24 + 18 + 12 + 6 = 60 arrangements.



    Last edited by Matt@VeritasPrep on Sun Jul 06, 2014 6:28 pm; edited 1 time in total

    Enroll in a Veritas Prep GMAT class completely for FREE. Wondering if a GMAT course is right for you? Attend the first class session of an actual GMAT course, either in-person or live online, and see for yourself why so many students choose to work with Veritas Prep. Find a class now!
    Post Sun Jul 06, 2014 6:27 pm
    phanikpk wrote:
    Dear Experts, Please help

    Meg and Bob among the five participants in a cycling race. If each participant finishes the race so that 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?

    Thanks in advance
    We can arrange the 5 people in 5! ways (= 120 ways).
    Notice that, for HALF of these arrangements, Bob will be ahead of Meg.
    For the OTHER HALF, Meg will be ahead of Bob.

    So, the number of arrangements where Meg finishes ahead of Bob = 120/2 = 60
    Here's are two similar questions:
    http://www.beatthegmat.com/counting-six-mobsters-t47167.html
    http://www.beatthegmat.com/permutation-t261691.html

    Cheers,
    Brent

    _________________
    Brent Hanneson – Founder of GMATPrepNow.com
    Use our video course along with Beat The GMAT's free 60-Day Study Guide

    Check out the online reviews of our course
    Come see all of our free resources

    GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMAT’s FREE 60-Day Study Guide and reach your target score in 2 months!

    Top Member

    Post Mon Jul 07, 2014 12:17 am
    Quote:
    phanikpk wrote:
    Dear Experts, Please help

    Meg and Bob among the five participants in a cycling race. If each participant finishes the race so that 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?

    Thanks in advance
    Hi Phanikpk,

    Brent has mentioned the best method which is 5!/2 = 120/2 = 60

    However another method that can just add another dimension to look at this problem is in the following three steps

    Step 1: We can select two places out of 5 for selecting the places to be occupied by Meg and Bob, which can be selected in 5C2 ways = 10 ways

    Step :2 In every selection of two places, Meg and Bob can be arranged only in 1 way as Meg should always finish before Bob as required in the question

    Step :3 Remaining 3 can be arranged on three UNSELECTED places in 3! ways

    Therefore total ways to make sure that Meg finishes befre Bob = 5C2 x 1 x 3! = 10 x 6 = 60 Answer

    _________________
    Bhoopendra Singh & Sushma Jha - Founder "GMATinsight"
    Testimonials e-mail: info@GMATinsight.com I Mobile: +91-9999687183 / +91-9891333772
    To register for One-on-One FREE ONLINE DEMO Class Call/e-mail
    One-On-One Private tutoring fee - US$40 per hour & for FULL COURSE (38 LIVE Sessions)-US$1000

    Best Conversation Starters

    1 lheiannie07 116 topics
    2 LUANDATO 62 topics
    3 swerve 62 topics
    4 ardz24 61 topics
    5 AAPL 58 topics
    See More Top Beat The GMAT Members...

    Most Active Experts

    1 image description Brent@GMATPrepNow

    GMAT Prep Now Teacher

    172 posts
    2 image description Scott@TargetTestPrep

    Target Test Prep

    154 posts
    3 image description Rich.C@EMPOWERgma...

    EMPOWERgmat

    131 posts
    4 image description EconomistGMATTutor

    The Economist GMAT Tutor

    127 posts
    5 image description GMATGuruNY

    The Princeton Review Teacher

    125 posts
    See More Top Beat The GMAT Experts