Abstract: We show how generating-function techniques can be used to prove some enumerative results about permutations. For example, let D(n) be the set of derangements (permutations with no fixed points) of n objects. We'll prove that D(n) contains n-1 more even permutations than odd ones if n is odd, and n-1 more odd permutations than even ones if n is even.