The Largest Prime Divisor of the Maximal Order of an Element of Sn

We define g(n) (Landau's Function) 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)).

If your site subscribes to Math Reviews, you can read a summary of my paper that appeared there.
Jon
Home
Links
Weblog
Archive
Math
Family
Tree

D&D
E-mail