Permutations with roots (Q1924945)

The symmetric group \(S_n\) is by definition the group of all permutations of the set \(\{1,2, \dots,n\}\). Given \(k\in\mathbb{N}\) put \[ S^k_n: = \{\pi\in S_n \mid \text{there exists }\xi\in S_n \text{ such that } \xi^k=\pi\} \quad \text{and} \quad \sigma_k(n): = {|S^k_n |\over n!}. \] The author studies the distribution properties of \(\sigma(n): = \sigma_n(n)\), and proves the following three conclusions: (1) \(\sigma(n)\) is dense on \([0,1]\); (2) there are absolute constants \(C\), \(K\geq 1\) such that \[ {1\over x} \# \{n\in N \mid n\leq x\text{ and } \sigma(n) \geq\varepsilon\}\leq C\left(\log {\log x\over \log K/ \varepsilon} \right)^{-1} \] holds true for \({K\over\sqrt x} \leq\varepsilon\leq 1\); and (3) \[ {1\over x} \sum_{n\leq x} \sigma(n) = {e^{-\gamma} \over \log\log x} \bigl(1+o(1)\bigr), \] where \(\gamma\) is the Euler constant.