Assume that n points P1,…,Pn are distributed independently and uniformly in the triangle with vertices (0, 1), (0, 0), and (1, 0). Consider the convex hull of (0, 1), P1,…,Pn, and (1, 0). The vertices of the convex hull form a convex chain. Let be the probability that the convex chain consists – apart from the points (0, 1) and (1, 0) – of exactly k of the points P1,…,Pn. Bárány, Rote, Steiger, and Zhang  proved that . The values of are determined for k = 1,…,n − 1, and thus the distribution of the number of vertices of a random convex chain is obtained. Knowing this distribution provides the key to the answer of some long-standing questions in geometrical probability.