### Group Actions and Transitive Permutations

A) Show that if n is odd then the set of all n-cycles consists of two conjugacy classes of equal size in An b) Let G be a transitive permutation group on the finite set A with |A|>1. Show that there is some g in G such that g(a) is not equal to a for all a in A. (Such an element g is called a fixed point free automorphism) c