The Mathematics of Shuffling Cards
... security depends on it , shuffle 11 times . The next theorem applies to deck sizes of arbitrary length . THEOREM 1.2.2 . If n cards are riffle shuffled k times with k = 3 log2 ( n ) + c , then for large n , with -2 || Qk - U || TV = 1 ...
Available editions
Save this book
Save
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.
