Structured Shuffles and the Josephus Problem

HTML  Download Download as PDF (Size: 122KB)  PP. 138-141  
DOI: 10.4236/ojdm.2012.24027    4,224 Downloads   7,308 Views  Citations

ABSTRACT

The Australian Shuffle consists of placing a deck of cards onto a table according to this rule: put the top card on the table, the next card on the bottom of the deck, and repeat until all the cards have been placed on the table. A natural question is “Where was the very last card placed located in the original deck?” Card trick magicians have known empirically for years that the fortieth card from the top of a standard fifty-two card deck is the final card placed by this shuffle. The moniker “Australian” comes from putting every other card “Down Under”. We develop a formula for the general case of N cards, and then extend that generalization further to cases involving the discard of k cards before or after putting one on the bottom of the deck. Finally, we discuss the connection of the Australian Shuffle and its generalizations to the famous Josephus problem.

Share and Cite:

S. Sullivan and T. Beatty, "Structured Shuffles and the Josephus Problem," Open Journal of Discrete Mathematics, Vol. 2 No. 4, 2012, pp. 138-141. doi: 10.4236/ojdm.2012.24027.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.