English

Average first-passage times for character sums

Number Theory 2026-01-21 v2

Abstract

Let ε>0\varepsilon>0 and, for an odd prime pp, set S(p):=n(np). S_\ell(p):=\sum_{n\le \ell}\left(\frac{n}{p}\right). Define the first-passage time fε(p):=min{1: S(p)<ε}. f_\varepsilon(p):=\min\{\ell\ge 1:\ S_\ell(p)<\varepsilon\ell\}. We prove that there exists a constant cε>0c_\varepsilon>0 such that, as xx\to\infty, pxfε(p)cεxlogx. \sum_{p\le x} f_\varepsilon(p)\sim c_\varepsilon \frac{x}{\log x}.

Cite

@article{arxiv.2512.24631,
  title  = {Average first-passage times for character sums},
  author = {Quanyu Tang and Hao Zhang},
  journal= {arXiv preprint arXiv:2512.24631},
  year   = {2026}
}

Comments

9 pages. v2: added a reference and corrected several typos

R2 v1 2026-07-01T08:46:33.618Z