Numbers which are orders only of cyclic groups

Abstract

We call n a cyclic number if every group of order n is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that n is cyclic precisely when (n,φ(n))=1. With C(x) denoting the count of cyclic n x, Erdos proved that C(x) e-γ x/x, x∞. We show that C(x) has an asymptotic series expansion, in the sense of Poincar\'e, in descending powers of x, namely e-γ xx (1-γx + γ2 + 112π2(x)2 - γ3 +14 γ π2 + 23ζ(3)(x)3 + … ).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…