Base case |Supp(p)|=2 is rather obvious. Suppose the result holds for , and let p be a permutation with . Suppose that p moves i to j: . Then the product of the transposition (i j) with p fixes i and therefore moves at most n elements. So apply the inductive hypothesis to it ... .