An induction property for prime counting functions

Abstract

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotarëv's density theorem to the cyclic case.

arXiv comment4 pages

References in corpus (1)

• A finite analogue of the ring of algebraic numbers