balls with label . After the first balls, the number of sequences is
balls with different weight and same radius. Pick these balls one by one and put them in sequence. After picking of a ball, re-mark numbers on the already-picked balls and the number represent the rank by their weight. Two examples of the sequence of the ranks is . After balls, the number of possible sequences is and the number of the future sequences after balls is
The number of the sequences whose weightest ball among first balls remains the weightest ball in first balls is And the probability is . After all balls are picked, denote the rank of the first balls and the position of a ball of a higher rank is located. The number of possible rank sequences is and the possibility is
For [katex=Y] labled balls, counting by partition of max labeled number and location of this ball, it follows . When is set to , the possibility of picking the weightest ball after all balls is
Rescale and as and then it is the sum
which approaches to
Similarly for picking the -th weightest ball, the probability is
Because , this value goes to zero as goes to infinity. It makes more sense to see accumulated probability