I'm looking at a card shuffle. And in shuffle would be the permutation (1, 2, 3, ..., n, n+1, n+2, n+3, ...2n) to (2, 4, 6, ..., 2n 1, 3, 5, ...2n-1) I know that it would take 52 perfect shuffles to get the deck of cards back in the original order. I think that I'm supposed to show this using...