For positive integers a and b , an (a,b) -shuffle of a deck of a+b cards is any shuffle that preserves the relative order of the top a cards and the relative order of the bottom b cards. Let n , k , a1 , a2 , … , ak , b1 , b2 , … , bk be fixed positive integers such that ai+bi=n for all 1≤i≤k . Big Bird has a deck of n cards and will perform an (ai,bi) -shuffle for each 1≤i≤k , in ascending order of i . Suppose that Big Bird can reverse the order of the deck. Prove that Big Bird can also achieve any of the n! permutations of the cards.
Linus Tang