Comments on search procedures for primitive roots

DOI10.1090/S0025-5718-97-00890-9zbMath0931.11058MaRDI QIDQ4372647

Eric Bach

Publication date: 16 December 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

primesgeneratorsextended Riemann hypothesis

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26)

Related Items (10)

On the least prime primitive root modulo a prime ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Resolving Grosswald's conjecture on GRH ⋮ Elements of high order in Artin-Schreier extensions of finite fields \(\mathbb{F}_q\) ⋮ On the deterministic complexity of factoring polynomials ⋮ On Grosswald’s conjecture on primitive roots ⋮ On the construction of finite field elements of large order ⋮ Efficient polynomial time algorithms computing industrial-strength primitive roots ⋮ Numerical calculation of the density of prime numbers with a given least primitive root ⋮ Factorization properties of Chebyshev polynomials

Cites Work

• On the worst case of three algorithms for computing the Jacobi symbol
• On the magnitude of the least prime primitive root
• On finding primitive roots in finite fields
• Topics in multiplicative number theory
• The least quadratic non residue
• Statistical Evidence for Small Generating Sets
• Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
• Searching for Primitive Roots in Finite Fields
• Canonical Root Vectors of SUn
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comments on search procedures for primitive roots