Answers are grounded in this paper and cite their sources.
For odd n let S(n) be the sum over x mod n of the Jacobi symbol ((x²−1)/n). The function S is multiplicative, sign S(n) = λ(n) is the Liouville function, and the sum of S(n) over odd n ≤ x equals C·x^(3/2) + E(x) with C = 0.0586383825… and E(x) ≪ x·log³x, E(x) ≠ o(x). We prove that the error term has logarithmic mean square exactly 1/π²: the integral from 1 to Y of (E(x)/x)² dx/x equals (1/π²)·log Y + o(log Y). The constant arises as M/(2π²) with M = (4/3)·∏ over p>2 of (p²+1)/(p²−1) = 2. Assuming the Riemann hypothesis, simplicity of the zeros and a mild bound for the moment Σ|ζ′(ρ)|^(−3), we compute the "loudness" of the zeros of ζ in the Riesz-smoothed error term R2(X): the logarithmic mean square of R2(X)/(X^(3/4)·log X) equals Λ = 2·Σ over γ>0 of |B(ρ)|² = 7.507…·10⁻⁶, an analogue of Ng's theorem for the Mertens function. Unconditionally, for every ν in (0,1), R2 has ≫ log T sign-alternating oscillations of size X^(3/4)·(log X)^ν in [2,T]; the logarithm comes from the fact that every zero of ζ produces a pole of order at least two. Theorem A is checked numerically up to 4·10⁷; the explicit formula behind Theorems B and C is checked up to 2·10⁷.
No takes yet. Share an insight, caveat, or question.
Kostiantyn Koshelenko (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: