# Moving Card $i$ to Position $j$ with Perfect Shuffles

by Sarnath Ramnath (St. Cloud State University) and Daniel Scully (St. Cloud State University)

This article originally appeared in:
Mathematics Magazine
December, 1996

Subject classification(s): Discrete Mathematics | Combinatorics
Applicable Course(s): 4.4 Combinatorics

A procedure is presented for determining the shortest possible sequence of perfect in and out shuffles that moves a card from position i to position j in a deck of 2n cards.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.