Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races
Source: hexagonmath.org/abs/2611.00130v1
Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, $\sigma_m=\log S_{p_m}$ with $S_N = 1+\sum_{p\le N}p$, which becomes exponentially dense. The ordinates $\gamma_n$ of the zeros of the Riemann zeta function fall on this grid with tiny errors: $1.4\cdot10^{-3}$ at the first zero, $2.4\cdot10^{-7}$ at the fifth, $3\cdot10^{-17}$ at the twentieth. Part I explains why. The cell of the grid containing a height $t$ has width $(1+o(1))\sqrt t\,e^{-t/2}$ (Step Theorem), and every real $t>\log 3$ has a node above it within that width, by an…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00130
curl -X POST /api/v1/records/hexagon/2611.00130/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00130/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'