The Expected Number of Rising Sequences After a Shuffle [PDF]
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A paper taking up Brad Mann's derivation of his simple expression for the expected number of rising sequences in a deck after a shuffle, which involved lengthy gymnastics with binomial coefficients. Doyle provides a short derivation. A PostScript file is available from Doyle's site.|
The Math Forum is a research and educational enterprise of the Drexel University School of Education.