Mean squares and oscillations of the error term for the Jacobi-symbol sum S(n) = Σₓ ((x²−1)/n)
We study the error term E(x) in the summatory function of S(n), the sum of Jacobi symbols ((x²−1)/n) over x mod n, for odd n. We prove that the logarithmic mean square of E(x)/x equals exactly 1/π². Assuming RH and a mild moment bound, we compute the contribution of the zeros of ζ to a Riesz-smoothed error term (an analogue of Ng’s theorem). Unconditionally, this smoothed error term has ≫ log T sign changes of size X^(3/4)(log X)^ν. New in version 2: E(x) = Ω±(x log log x), proved by adapting Montgomery’s method for Euler’s function; the extra factor √(log log x) compared with Montgomery’s result comes from the weight 2^ω attached to the square terms. All main results are checked numerically up to 2·10⁷–4·10⁷.
Authors
- Kostiantyn Koshelenko (ORCID: https://orcid.org/0009-0009-5184-9737)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24293697
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint