Explicit upper bounds on the least primitive root
From MaRDI portal
Abstract: We give a method for producing explicit bounds on , the least primitive root modulo . Using our method we show that for where is an integer parameter. This result beats existing bounds that rely on explicit versions of the Burgess inequality. Our main result allows one to derive bounds of differing shapes for various ranges of . For example, our method also allows us to show that for all and for .
Recommendations
Cites work
- A generalization of the Pólya-Vinogradov inequality
- A refinement of the Burgess bound for character sums
- A Remark on Stirling's Formula
- 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
- Explicit average orders: news and problems
- Explicit estimates on several summatory functions involving the Moebius function
- Further remarks on Diophantine quintuples
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 3424105 (Why is no real title available?)
- Numbers with small prime factors, and the least 𝑘th power non-residue
- Numerical relativity using a generalized harmonic decomposition
- On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)
- On Character Sums and Primitive Roots†
- On Grosswald's conjecture on primitive roots
- On the constant in Burgess' bound for the number of consecutive residues or non-residues
- On the least square-free primitive root modulo \(p\)
- Resolving Grosswald's conjecture on GRH
- Small Gál sums and applications
- The Burgess inequality and the least kth power non-residue
- The distribution of quadratic residues and non‐residues
- The least \(k\)-th power non-residue
Cited in
(10)- On Grosswald's conjecture on primitive roots
- Least prime primitive roots
- Uniform bounds for the least almost‐prime primitive root
- Explicit upper bound on the least primitive root modulo p2
- The least quadratic non-residue
- Constructive root bound for <tt> k </tt>-ary rational input numbers
- Computation of the least primitive root
- The least primitive roots mod p
- On the least prime primitive root
- The least primitive root modulo \(p^2\)
This page was built for publication: Explicit upper bounds on the least primitive root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212411)