exercise:0a296dc30d: Difference between revisions

Revision as of 23:22, 23 June 2024

There are 10 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 10. 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.

References

Doyle, Peter G. (2006). "Grinstead and Snell's Introduction to Probability" (PDF). Retrieved June 6, 2024.

@@ Line 1: / Line 1: @@
-There are <math>n</math> 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 <math>n</math>.  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.
+There are 10 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 10.  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.
 '''References'''
 {{cite web |url=https://math.dartmouth.edu/~prob/prob/prob.pdf |title=Grinstead and Snell’s Introduction to Probability |last=Doyle |first=Peter G.|date=2006 |access-date=June 6, 2024}}