You have a deck of 52 cards - for convenience, number them 1 through 52. You cut the cards into two equal halves and shuffle them perfectly. That is, the cards were in the order
and now they are
1,27,2,28,...,26,52. Let's call this a perfect in-shuffle.
If you repeat this in-shuffling process, how many in-shuffles will it take for the deck to return to its initial ordering (taking for granted that the cards will eventually do so)?
How does the solution change if you have a deck of 64 cards, or 10, or in general, n cards? For odd integer values of n, in-shuffling will take 1,2,3,...,n to 1,(n+3)/2,2,(n+5)/2,...,n,(n+1)/2. For example, when n=5, the first in-shuffle yields 1,4,2,5,3.
I was just shuffling my cards today, when I suddenly thought of this
particular puzzle. I realized that this puzzle is vulnerable to
cycle notation. I have no idea whether this came up in previous
Cycle notation is a way of notating different permutations. For
example, if 123456 changes to 214653, then the cycle notation would be
(12)(346)(5). I know I'm not explaining it very well, but you can
figure out the rest.
So anyway, in cycle notation, you can tell how many cycles are in the
permutation, and the length of each cycle. Naturally, the number
of in-shuffles required is the least common multiple (LCM) of each of
the cycles' lengths.
So for a 52 card deck:
The lengths of each cycle are 1,8,8,8,8,8,2,8, and 1. The LCM is
8. It's funny how it all seems to reduce down to that.
I'm sure that someone with more time could derive a general equation from this, but I think it would get very messy very soon.
Posted by Tristan
on 2005-03-23 00:33:01