Permutations with orders coprime to a given integer

Abstract

Let $m$ be a positive integer and let $\ddot{I}(m,n)$ be the proportion of permutations of the symmetric group $\mathrm{Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\ddot{I}(n,m)n^{1-\frac{\ddot{I}•(m)}{m}}\sim \hat{I}{º}_m$ where $\hat{I}{º}_m$ is a complicated (unbounded) function of $m$. We show that there exists a positive constant $C(m)$ such that, for all $n⩾m$, \[C(m) \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1} \leqslant ρ(n,m) \leqslant \left(\frac{n}{m}\right)^{\frac{ϕ(m)}{m}-1}\] where $\ddot{I}•$ is Euler's totient function.

10 pages, 3 figures