How many perfect (faro) out-shuffles are needed to bring a list of length u201cnu201d to its original order? I know 8 works for 52 and 6 for 64.
The number of shuffles needed is [math]ord_{n-1}(2)[/math]Read more here: Link 1, Link 2, Link 3u2026