Computation of the least primitive root
From MaRDI portal
Publication:6657195
DOI10.1090/MCOM/4003MaRDI QIDQ6657195
Kevin J. McGown, Jonathan P. Sorenson
Publication date: 6 January 2025
Published in: Mathematics of Computation (Search for Journal in Brave)
Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07)
Cites Work
- Title not available (Why is that?)
- The least primitive root modulo \(p^2\)
- Resolving Grosswald's conjecture on GRH
- Approximate formulas for some functions of prime numbers
- On Grosswald's conjecture on primitive roots
- A new prime $p$ for which the least primitive root $({\rm mod} p)$ and the least primitive root $({\rm mod} p^2)$ are not equal
- On Character Sums and Primitive Roots†
- Modular Multiplication Without Trial Division
- Two compact incremental prime sieves
- 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
- On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)
- Searching for Primitive Roots in Finite Fields
- Comments on search procedures for primitive roots
- On the Average of the Least Primitive Root Modulo p
- Explicit upper bound on the least primitive root modulo p2
- Explicit upper bounds on the least primitive root
- The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions
- On the Parabolic Generators of the Principal Congruence Subgroups of the Modular Group
This page was built for publication: Computation of the least primitive root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657195)