Abstract
Notation,p and q are generic symbols for prime numbers. N(H, p) denotes the number of primes q, not exceeding Hy which are primitive roots (mod p).g(p) denotes the least positive primitive root (mod p).g*(p) is the least prime primitive root (mod p).v(m) denotes the number of distinct prime divisors of the integer m.τk(m) is the number of ways of representing the integer m as the product of k integers, order being important.π(x, k, r) is the number of primes p, not exceeding x, which satisfy p ≡ r(mod k); while π(x) denotes the total number of p ≦ x.logm x denotes the mth iterated logarithmic function which is defined, when possible, by
Publisher
Canadian Mathematical Society
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The First Years;Springer Monographs in Mathematics;2012
2. New Erdös-Kac type theorems;Archiv der Mathematik;2005-10
3. Bibliography;North-Holland Mathematical Library;2004
4. On Primes in Arithmetic Progression Having a Prescribed Primitive Root;Journal of Number Theory;1999-09
5. On the Average of the Least Primitive Root Modulo p;Journal of the London Mathematical Society;1997-12