Permutations with orders coprime to a given integer

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Let m be a positive integer and let ρ (m; n) be the proportion of permutations of the symmetric group Sym(n) whose order is coprime to m. In 2002, Pouyanne proved that (Formula Presented) where Km is a complicated (unbounded) function of m. We show that there exists a positive constant C(m) such that, for all n > m, (Formula Presented) where ϕ is Euler's totient function.

Original languageEnglish
Article numberP1.6
Number of pages14
JournalElectronic Journal of Combinatorics
Issue number1
Publication statusPublished - 2020


Dive into the research topics of 'Permutations with orders coprime to a given integer'. Together they form a unique fingerprint.

Cite this