Explicit Expressions for a Class of Permutation Problems

Abstract

The purpose of this paper is to give some explicit formulae for probability problems such as those dealing with maximum runs upon tossing a coin n times in succession. Although the actual computation involved is quite lengthy, and generating functions can be used for approximations, the lemmas obtained may be of some interest in themselves.