English
Related papers

Related papers: Explicit bounds for small prime nonresidues

200 papers

Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. Let $q_1<q_2$ denote the two smallest prime non-residues of $\chi$. We give explicit upper bounds on $q_2$ that improve upon all known results. We also provide a good…

Number Theory · Mathematics 2010-11-22 Kevin J. McGown

We give an explicit version of a result due to D. Burgess. Let $\chi$ be a non-principal Dirichlet character modulo a prime $p$. We show that the maximum number of consecutive integers for which $\chi$ takes on a particular value is less…

Number Theory · Mathematics 2010-11-22 Kevin J. McGown

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

General Mathematics · Mathematics 2025-10-10 N. A. Carella

For each nonprincipal Dirichlet character $\chi$, let $n_\chi$ be the least $n$ with $\chi(n) \notin \{0,1\}$. We show that as the average of $n_\chi$ over all nonprincipal characters $\chi$ modulo $q$ is $\ell(q) + o(1)$, where $\ell(q)$…

Number Theory · Mathematics 2014-02-26 Greg Martin , Paul Pollack

Let $\varepsilon > 0$. We prove that there are constants $m_0=m_0(\varepsilon)$ and $\kappa=\kappa(\varepsilon) > 0$ for which the following holds: For every integer $m > m_0$ and every nontrivial Dirichlet character modulo $m$, there are…

Number Theory · Mathematics 2015-08-25 Paul Pollack

We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\varepsilon > 0$ there exists a constant $C_\varepsilon$ such that for any $N$, there are at most $C_\varepsilon$ primes $p \leqslant N$ such…

Number Theory · Mathematics 2017-12-21 Paul Balister , Béla Bollobás , Jonathan D. Lee , Robert Morris , Oliver Riordan

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

Number Theory · Mathematics 2007-05-23 Andrew Granville , Kannan Soundararajan

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

Number Theory · Mathematics 2018-01-23 Andrea Sartori

In this paper we prove a lower bound result for extremely large values of $L(\frac{1}{2},\chi_p)$ with prime numbers $p\equiv 1\pmod 8$.

Number Theory · Mathematics 2025-07-09 Mingyue Fan , Shenghao Hua , Sizhe Xie

Let $\chi$ be a Dirichlet character modulo $p$, a prime. In applications, one often needs estimates for short sums involving $\chi$. One such estimate is the family of bounds known as \emph{Burgess' bound}. In this paper, we explore several…

Number Theory · Mathematics 2019-12-03 Forrest J. Francis

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…

Number Theory · Mathematics 2019-09-04 Ke Gong , Chaohua Jia

We show that for any fixed $\eps>0$, there are numbers $\delta>0$ and $p_0\ge 2$ with the following property: for every prime $p\ge p_0$ and every integer $N$ such that $p^{1/(4\sqrt{e})+\eps}\le N\le p$, the sequence $1,2,...,N$ contains…

Number Theory · Mathematics 2014-02-26 W. D. Banks , M. Z. Garaev , D. R. Heath-Brown , I. E. Shparlinski

For any odd prime number $p$, let $(\cdot|p)$ be the Legendre symbol, and let $n_1(p)<n_2(p)<\cdots$ be the sequence of positive nonresidues modulo $p$, i.e., $(n_k|p)=-1$ for each $k$. In 1957, Burgess showed that the upper bound…

Number Theory · Mathematics 2015-11-18 William D. Banks , Victor Z. Guo

Let $p$ be a prime and $p_1,\ldots, p_r$ be distinct prime divisors of $p-1$. We prove that the smallest positive integer $n$ which is a simultaneous $p_1,\ldots,p_r$-power nonresidue modulo $p$ satisfies $$ n<p^{1/4 -…

Number Theory · Mathematics 2019-10-22 Kevin Ford , Moubariz Garaev , Sergei Konyagin

Let $\chi$ be a primitive Dirichlet character of conductor $q$ and $L(z,\chi)$ the associated L-series. In this paper we provide an explicit upper bound for $|L(1, \chi)|$ when 3 divides $q$.

Number Theory · Mathematics 2013-06-21 Sumaia Saad Eddin , David J. Platt

In this paper, we investigate the quantity $m_q:=\min_{\chi\ne \chi_0} | L^\prime/L(1,\chi)|$, as $q\to \infty$ over the primes, where $L(s,\chi)$ is the Dirichlet $L$-function attached to a non trivial Dirichlet character modulo $q$. Our…

Number Theory · Mathematics 2025-02-07 Youness Lamzouri , Alessandro Languasco

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

Number Theory · Mathematics 2025-11-25 Elchin Hasanalizade , Hua Lin , Greg Martin , Andradis Luna Martínez , Enrique Treviño

We prove that more than nine percent of the central values $L(\frac{1}{2},\chi_p)$ are non-zero, where $p\equiv 1 \pmod{8}$ ranges over primes and $\chi_p$ is the real primitive Dirichlet character of conductor $p$. Previously, it was not…

Number Theory · Mathematics 2018-09-27 Siegfred Baluyot , Kyle Pratt

For odd primes $p$ we consider the factors \[ A(p)=\frac{p-\chi_4(p)}{p+\chi_4(p)}, \qquad \chi_4(p)= \begin{cases} 1,&p\equiv 1\pmod 4, \\ -1,&p\equiv 3\pmod 4, \end{cases} \] and study products of $A(p)$ restricted to unions of residue…

General Mathematics · Mathematics 2026-05-12 Mike Winkler
‹ Prev 1 2 3 10 Next ›