shuffling news
Warut Roonguthai
warut at ksc9.th.com
Sun Nov 15 22:37:33 CET 1998
FYI, this card-shuffling topic was discussed in David Gale's column
"Mathematical Entertainments" on pages 54-56 of "The Mathematical
Intelligencer" vol. 14, no. 1, 1992.
Here is the number of shuffles required for card n to reach the top
for the first time according to the 80-hour computation on a NeXT
workstation mentioned in the article:
card shuffles
39 13932
43 30452
53 30
54 252992198
3464 21879255397
3729 15009146841
4546 2263846432
Later,
Warut (is back!)
More information about the SeqFan
mailing list