Shuffling of Playing Cards |
![]() |
Every shuffling of playing cards is a permutation.
If we use 32 playing cards, then there are 32! permutations.
"Every permutation has finite order" - this means:
If we repeat the shuffling, then after a while
|
Of course, this only concerns | systematic shuffling |