  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}$.
