On the Number of Permutations Admitting an m-th Root

  • Nicolas Pouyanne

Abstract

Let m be a positive integer, and pn(m) the proportion of permutations of the symmetric group Sn that admit an m-th root. Calculating the exponential generating function of these permutations, we show the following asymptotic formula pn(m)πmn1φ(m)/m,n, where φ is the Euler function and πm an explicit constant.

Published
2001-12-20
Article Number
R3