[kpux]

I was at Foxwoods the other night, and instead of trying to have winning session, I was concentrating on chip shuffling. I was trying to figure out a formula for how many iterations it takes two stacks of n chips to get back to their original configuration, assuming you shuffle them perfectly, and the stack on the left always contributes the bottom chip to the shuffled stack.

My friend and I thought about this for a long time, and we thought the best answer had to do with permutation groups, but we are still unsure. Any clever insights?