arXiv · 2512.24631
Average first-passage times for character sums
Abstract
Let $\varepsilon>0$ and, for an odd prime $p$, set $$ S_\ell(p):=\sum_{n\le \ell}\left(\frac{n}{p}\right). $$ Define the first-passage time $$ f_\varepsilon(p):=\min\{\ell\ge 1:\ S_\ell(p)<\varepsilon\ell\}. $$ We prove that there exists a constant $c_\varepsilon>0$ such that, as $x\to\infty$, $$ \sum_{p\le x} f_\varepsilon(p)\sim c_\varepsilon \frac{x}{\log x}. $$
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Quanyu Tang, Hao Zhang. 2025-12-31. Average first-passage times for character sums. https://arxiv.org/abs/2512.24631
Cite the original work for its findings. Save a collection to share your selection of sources.