An integer is a primitive root modulo a prime if it generates the whole multiplicative group . In 1927 Artin conjectured that an integer which is not or a square is a primitive root for infintely many primes, and that the set of those primes has a positive asymptotic density among all primes. This conjectured was proved, under the generalized Riemann hypothesis (GRH), in 1967 by Hooley. More generally, an integer is called a generalized primitive root modulo if it generates a subgroup of of maximal size. Li and Pomerance showed, under GRH, that the set of integers for which a given integer is a generalized primitive root doesn’t have an asymptotic density among all integers. We study here the set of the -almost primes, i.e. integers with at most prime factors, for which a given integer , which is not a square, is a generalized primitive root, and we prove, under GRH, that this set has an asymptotic density among all the -almost primes.

生成讲解博客的中文版本

生成AI智能校验的中文版本