On the lengths of the pieces of a stick broken at random

Abstract

Consider the pieces of a randomly broken stick. How long is the j th longest piece? How many breaks are necessary for getting all pieces less than a given length? These and related questions are studied in particular when the number of pieces is large. Using simple properties of the exponential distribution new proofs are given of old results and new results are obtained.