MathDB
Stack of Cards

Source:

November 13, 2005

Problem Statement

The cards in a stack of 2n2n cards are numbered consecutively from 11 through 2n2n from top to bottom. The top nn cards are removed, kept in order, and form pile AA. The remaining cards form pile BB. The cards are then restacked by taking cards alternately from the tops of pile BB and AA, respectively. In this process, card number (n+1)(n+1) becomes the bottom card of the new stack, card number 11 is on top of this card, and so on, until piles AA and BB are exhausted. If, after the restacking process, at least one card from each pile occupies the same position that it occupied in the original stack, the stack is named magical. Find the number of cards in the magical stack in which card number 131131 retains its original position.