You are the human resource manager of a company with a single secretarial position to fill. There are N > 2 of candidates, and the value of N is known. The candidates can be ranked from best to worst with no ties. You can interview them one by one, in random order. However, the decision of appointing or rejecting a particular candidate must be taken immediately after the interview. The decision to accept or reject a candidate can only be based on the relative ranks of the candidates interviewed so far. Rejected candidates cannot be recalled. If nobody has been accepted before the end, the last candidate is chosen. Consider this strategy which consists of two steps: . Interview R < N candidates and reject them. Note down the best candidate, say X. . Continue interviewing the next candidates until Y, the first one who is better than X, and accept Y. Calculate the probability of getting the best candidate following the strategy described above as a function of R and N