If we view a given shuffle of a deck of cards as a permutation, then repeatedly applying this same shuffle will eventually return the deck to its original order. In general, how many steps will that take? What happens in the case of so-called perfect shuffles? What type of shuffle will require the greatest number of applications before restoring the original deck? This talk will address those questions and provide a brief history of the work of Edmund Landau on the maximal order of a permutation in the symmetric group on n objects. It will also note some recent progress in refining his results
Beasley, Brian D., "From Perfect Shuffles to Landau's Function" (2019). ACMS Conference Proceedings 2019. 2.
Applied Mathematics Commons, Computer Sciences Commons, Higher Education Commons, History of Science, Technology, and Medicine Commons, Mathematics Commons, Science and Mathematics Education Commons, Teacher Education and Professional Development Commons