English

Numbers which are orders only of cyclic groups

Number Theory 2020-07-28 v2

Abstract

We call nn a cyclic number if every group of order nn is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that nn is cyclic precisely when gcd(n,ϕ(n))=1\gcd(n,\phi(n))=1. With C(x)C(x) denoting the count of cyclic nxn\le x, Erd\H{o}s proved that C(x)eγx/logloglogx,as x.C(x) \sim e^{-\gamma} x/\log\log\log{x}, \quad\text{as $x\to\infty$}. We show that C(x)C(x) has an asymptotic series expansion, in the sense of Poincar\'e, in descending powers of logloglogx\log\log\log{x}, namely eγxlogloglogx(1γlogloglogx+γ2+112π2(logloglogx)2γ3+14γπ2+23ζ(3)(logloglogx)3+).\frac{e^{-\gamma} x}{\log\log\log{x}} \left(1-\frac{\gamma}{\log\log\log{x}} + \frac{\gamma^2 + \frac{1}{12}\pi^2}{(\log\log\log{x})^2} - \frac{\gamma^3 +\frac{1}{4} \gamma \pi^2 + \frac{2}{3}\zeta(3)}{(\log\log\log{x})^3} + \dots \right).

Keywords

Cite

@article{arxiv.2007.09734,
  title  = {Numbers which are orders only of cyclic groups},
  author = {Paul Pollack},
  journal= {arXiv preprint arXiv:2007.09734},
  year   = {2020}
}

Comments

10 pages; some typos corrected

R2 v1 2026-06-23T17:13:48.283Z