^ Kolata, Gina (January 9, 1990), "In Shuffling Cards, 7 Is Winning Number", New York Times.^ Numb3rs 519: Animal Rites, Numb3rs Math Activities, Cornell University Department of Mathematics.^ Austin, David (December 2010), How Many Times Do I Have to Shuffle This Deck?, AMS Feature Columns.Lalley (1999) instead states erroneously that all permutations are likely. ^ This follows immediately from Theorem 1 of Bayer & Diaconis (1992) together with the observation that the identity permutation has one rising sequence and all other riffle permutations have exactly two rising sequences.(1955), Theory of shuffling, Technical memorandum, Bell Labs ^ Diaconis, Persi (1988), Group representations in probability and statistics, Institute of Mathematical Statistics Lecture Notes-Monograph Series, 11, Hayward, California: Institute of Mathematical Statistics, ISBN 978-0-94, MR 0964069. If there are a total of n shuffles, only a constant number of bits of information remain.
0 Comments
Leave a Reply. |