Results 1 to 3 of 3

Thread: Sturggling to arrive at the correct answer (Permutations)

  1. #1
    Junior Member
    May 2010

    Sturggling to arrive at the correct answer (Permutations)

    The problem is copied straight from the book:
    Untitled Document

    Section: Permutations
    11) There are n applicants for the director of computing. The applicants are interviewed
    independently by each member of the three-person search committee
    and ranked from 1 to n. A candidate will be hired if he or she is ranked first
    by at least two of the three interviewers. Find the probability that a candidate
    will be accepted if the members of the committee really have no ability at all
    to judge the candidates and just rank the candidates randomly. In particular,
    compare this probability for the case of three candidates and the case of ten
    The solution provided: (3n-2)/n^3

    My approach:
    There are 3 committee members A,B,C.
    Each has his own ranking of candidates which can arranged in n! ways.
    We want our applicant X in a certain position (1st place) in 2/3 rankings.
    There are (n-1)! ways to arrange the other applicants in each ranking.

    The "good" rankings (in order from 1st to last place):
    A: X * * * * * * n
    B: X * * * * * * n
    C: * * * * * * * n

    A: X * * * * * * n
    B: * * * * * * * n
    C: X * * * * * * n

    A: * * * * * * * n
    B: X * * * * * * n
    C: X * * * * * * n

    The number of ranking arrangements that make X the top applicant is:


    The total number of ways to arrange the rankings is:

    n! n! n!

    Probability = good rankings/total rankings

    3 (n! (n-1)! (n-1)!)
    (n! n! n!)


    3 n! (n-1)! (n-1)!
    n(n-1)! n(n-1)! n(n-1)!

    3 n(n-1)!
    n n n (n-1)!

    = 3n / n^3

    What am I doing wrong? Am I not accounting for repetition? This is killing me.
    Appreciate any help.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Aug 2006
    The key to this in the fact of independence: they interview independently. It is binomional.
    Applicant A has the probability of $\displaystyle \frac{1}{n}$ of being first, independently, on any given list.
    A gets the job if A is first on two or three lists.
    $\displaystyle \binom{3}{2}\left(\frac{1}{n}\right)^2\left(1-\frac{1}{n}\right)+ \left(\frac{1}{n}\right)^3 $
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    May 2010
    Thank you for the reply. I understand the answer now. Close-minded thinking on my part.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 15
    Last Post: Jul 29th 2011, 01:39 AM
  2. Replies: 1
    Last Post: Oct 4th 2010, 04:46 PM
  3. Functions: How to arrive at the answer?
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: Oct 14th 2009, 03:43 PM
  4. Is my answer correct?
    Posted in the Geometry Forum
    Replies: 2
    Last Post: Oct 3rd 2009, 10:09 AM
  5. I can't seem to get the correct answer!
    Posted in the Calculus Forum
    Replies: 1
    Last Post: Sep 1st 2009, 06:33 PM

Search Tags

/mathhelpforum @mathhelpforum