
TL;DR
This paper studies the distribution of cyclic numbers, showing that the count of such numbers up to x has an asymptotic series expansion involving iterated logarithms, refining previous asymptotic results.
Contribution
It derives an asymptotic series expansion for the count of cyclic numbers, providing a detailed approximation beyond the leading term.
Findings
Asymptotic series expansion for $C(x)$ in powers of $1/\log\log\log{x}$
Refinement of Erd ext{"o}s' asymptotic estimate for cyclic numbers
Explicit coefficients involving Euler's constant, $\pi$, and $\zeta(3)$
Abstract
We call a cyclic number if every group of order is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that is cyclic precisely when . With denoting the count of cyclic , Erd\H{o}s proved that We show that has an asymptotic series expansion, in the sense of Poincar\'e, in descending powers of , namely
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
