For i.i.d. X1,…,Xn with common CDF F and density f, order statistics X(1)≤⋯≤X(n) satisfy:
Fmax(x)=F(x)n,Fmin(x)=1−(1−F(x))n,
f(k)(x)=(k−1)!(n−k)!n!F(x)k−1(1−F(x))n−kf(x).
More generally P(X(k)≤x)=P(at least k of the Xi≤x), a Binomial(n,F(x)) tail — useful for medians and ranks. For spacings/symmetric events, exploit distributional symmetries (e.g. x↦1−x for Unif(0,1)) to pair or cancel events. For extremes of exponentials/large n, rescale (e.g. x=lnn+c) to get Gumbel-type limits exp(−e−c). For ranking problems with a revealed value a, compute posterior probabilities of each rank via Bayes’ rule using the binomial-type weights (jn−1)aj(1−a)n−1−j, then optimise the decision pointwise before integrating over a.