MathDB
10 candidates for a job are interviewed

Source: Chinese Mathematical Olympiad 2003 Problem 5

February 18, 2012
probabilitycombinatorics proposedcombinatorics

Problem Statement

Ten people apply for a job. The manager decides to interview the candidates one by one according to the following conditions: i) the first three candidates will not be employed; ii) from the fourth candidates onwards, if a candidate's comptence surpasses the competence of all those who preceded him, then that candidate is employed; iii) if the first nine candidates are not employed, then the tenth candidate will be employed. We assume that none of the 1010 applicants have the same competence, and these competences can be ranked from the first to tenth. Let PkP_k represent the probability that the kkth-ranked applicant in competence is employed. Prove that: i) P1>P2>>P8=P9=P10P_1>P_2>\ldots>P_8=P_9=P_{10}; ii) P1+P2+P3>0.7P_1+P_2+P_3>0.7 iii) P8+P9+P100.1P_8+P_9+P_{10}\le 0.1.
Su Chun