2000 character limit reached
Large values of short character sums
Published 21 Dec 2017 in math.NT | (1712.08080v2)
Abstract: In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)A$ can take large values.
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.