Upper and lower bounds are obtained for the number of shuffles necessary to reach the "furthest" two hand deal starting from a given permutation of a deck of cards. The bounds are on the order of (log2n)/2 and loglogn, respectively.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics