group of degree n containing a pr-cycle is alternating or symmetric if 1 < pr < n—2 and p is a prime number congruent to 2 modulo 3. The context is a generalisation of Jordan's Theorem that a primitive group containing a cycle of prime length with more than 2 fixed points is alternating or symmetric, and the hope that the same might be true without any arithmetic restrictions whatever on the length of the cycle. My purpose in this note is to prove the result of Rowlinson and Williamson without their restriction on the prime p. THEOREM. / / G is a primitive permutation group of degree n containing a cycle of length pr, where p is a prime number and p # 3, and ifn>pr + 2, then G is alternating or symmetric. The proof depends on...