  Let a stick be broken at random at n-1 points to form n pieces. We consider
three problems on forming k-gons with k out of these n pieces, and show how a
statistical approach, through a linear transformation of variables, yields
simple solutions that also allow fast computation.
