On a problem in shuffling (Q1584647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a problem in shuffling |
scientific article; zbMATH DE number 1525300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a problem in shuffling |
scientific article; zbMATH DE number 1525300 |
Statements
On a problem in shuffling (English)
0 references
4 March 2001
0 references
The number of shuffles, needed to apply on \(n\) cards, to achieve all sets of 2 hands, is estimated. In this beautifully written paper \(\frac{1}{2}\log n\) and \(\log \log n\) are given as upper and lower bounds.
0 references
permutations
0 references
