Someone has already asked whether an exponent less than $n!$ is possible for a symmetric group $S_n$. It has been answered that it is for $n \ge 4$.
I would like to know if there is a general formula to determine the exponent of $S_n$.
Someone has already asked whether an exponent less than $n!$ is possible for a symmetric group $S_n$. It has been answered that it is for $n \ge 4$.
I would like to know if there is a general formula to determine the exponent of $S_n$.
For each prime $p\le n$ we have to decide what is the maximal $k$ such that $S_n$ contains an element of order $p^k$. We may assume that such an element has only a single cycle because disjoint cycles combine only by taking the lcm, which does not "help" for prime powers. Thus the maximal $k$ is given by the bound $p^k\le n$. Hence the exponent of $S_n$ is $$\prod_{p\le n}p^{\lfloor \ln n/\ln p\rfloor}.$$