Numerical calculation of the density of prime numbers with a given least primitive root
From MaRDI portal
Publication:3147186
DOI10.1090/S0025-5718-01-01382-5zbMATH Open1030.11076MaRDI QIDQ3147186FDOQ3147186
Authors: A. Paszkiewicz, Andrzej Schinzel
Publication date: 18 September 2002
Published in: Mathematics of Computation (Search for Journal in Brave)
Recommendations
Congruences; primitive roots; residue systems (11A07) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Number-theoretic algorithms; complexity (11Y16)
Cites Work
Cited In (7)
- Densities of primes and primitive roots
- On the least prime primitive root modulo a prime
- Permuting operations on strings and the distribution of their prime numbers
- Computing higher rank primitive root densities
- A new prime \(p\) for which the least primitive root \(\pmod p\) and the least primitive root \(\pmod {p^2}\) are not equal
- An analogue of Artin's conjecture for Abelian extensions
- On Grosswald's conjecture on primitive roots
This page was built for publication: Numerical calculation of the density of prime numbers with a given least primitive root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147186)