Permutations with orders coprime to a given integer

John Bamberg¹ ; S. P. Glasby ; Scott Harper ; Cheryl E. Praeger

¹The University of Western Australia

The electronic journal of combinatorics, Tome 27 (2020) no. 1

Résumé

Let $m$ be a positive integer and let $\rho(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 $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where $\kappa_m$ is a complicated (unbounded) function of $m$. We show that there exists a positive constant $C(m)$ such that, for all $n \geq m$,\[C(m) \left(\frac{n}{m}\right)^{\frac{\phi(m)}{m}-1} \leq \rho(n,m) \leq \left(\frac{n}{m}\right)^{\frac{\phi(m)}{m}-1}\]where $\phi$ is Euler's totient function.

Détail

DOI : 10.37236/8678

Classification : 20B30, 05A15, 05A05, 20D60