The "matching" hats problem is a classic exercise in probability: if "n" people throw their hats in a box, and then each person randomly draws one out again, what is the expected number of people who draw their own hat? This paper presents several extensions to this problem, with solutions that involve interesting tricks with iterated…

Developed are simple recursion formulas for generating the exact distribution of the longest run of heads, both for a fair coin and for a biased coin. Discusses the applications of runs-related phenomena such as molecular biology, Markov chains, geometric variables, and random variables. (YP)