Mathematics of Computation

			Journals Home Search Author Info Subscribe Tech Support My Subscriptions Help
ISSN 1088-6842(e) ISSN 0025-5718(p)

Numerical calculation of the density of prime numbers with a given least primitive root

Author(s): A. Paszkiewicz; A. Schinzel.
Journal: Math. Comp. 71 (2002), 1781-1797.
MSC (2000): Primary 11Y16; Secondary 11A07, 11M26
Posted: November 28, 2001
MathSciNet review: 1933055
Retrieve article in: PDF
This article is available free of charge

Abstract | References | Similar articles | Additional information

Abstract: In this paper the densities of prime numbers having the least primitive root , where is equal to one of the initial positive integers less than 32, have been numerically calculated. The computations were carried out under the assumption of the Generalised Riemann Hypothesis. The results of these computations were compared with the results of numerical frequency estimations.

References:

1.: E. Bach, Comments on search procedures for primitive roots, Math. Comp. 66 (1997), 1719-1727. MR 98a:11187
2.: R. N. Buttsworth, A general theory of inclusion-exclusion with application to the least primitive root problem, and other density question, Ph.D. Thesis, University of Queensland, Queensland, 1983.
3.: P.D.T.A. Elliott, L. Murata, On the average of the least primitive root modulo , J. London Math. Soc. (2) 56 (1997), 435-454. MR 98m:11094
4.: K. R. Matthews, A generalisation of Artin's conjecture for primitive roots, Acta Arith. 29 (1976), 113-146. MR 53:313

	Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
\|