2000 character limit reached
On the constant in Burgess' bound for the number of consecutive residues or non-residues
Published 19 Nov 2010 in math.NT | (1011.4490v1)
Abstract: 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 than $\left{\frac{\pi e\sqrt{6}}{3}+o(1)\right}p{1/4}\log p$, where the $o(1)$ term is given explicitly.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.