Consider the online hiring problem, in which we have total $$k$$

Consider the online hiring problem, in which we have total $$k$$ candidates. First of all, we interview $$n$$ candidates but reject them all. Then we hire the first candidate who is better than all of the previous candidates you have interviewed. It is true that the probability of the $$m$$th candidate is the best is $$ \frac{n}{k(m-1)}$$, where $$m > n$$. ~@[](2)

答案：TRUE