The exponent of a finite group is defined as the maximal order of an element in the group. We will start by giving an alternative formulation of the proposed problem in elementary terms. A sequence of results follow providing an algorithmic approach for computing the exponent of S_n. We conclude by exhibiting some asymptotic results and their surprising relation to a famous result, namely the Prime Number Theorem.
The talk should be accessible to everybody.