Explicit upper bounds on the least primitive root
Number Theory
2019-04-30 v1
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 .
Keywords
Cite
@article{arxiv.1904.12373,
title = {Explicit upper bounds on the least primitive root},
author = {Kevin J. McGown and Tim Trudgian},
journal= {arXiv preprint arXiv:1904.12373},
year = {2019}
}