The Largest Prime Dividing the Maximal Order of an Element of $S_n$.

Abstract

We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\\sqrt{n\\log n}$.