Theoremadvanced
Bayer-Diaconis theorem
Also called seven shuffles theorem, 3/2 log2 n theorem.
Under the riffle-shuffle model, about (3/2) log2 n shuffles are needed to make a 52-card deck close to uniform, with a sharp cutoff.
Under the riffle-shuffle model, about (3/2) log2 n shuffles are needed to make a 52-card deck close to uniform, with a sharp cutoff.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1507MX Edit this page History Report an error