Claims a rigorous <1/2 error bound for a truncated Gaussian explicit formula, supposedly enabling exact prime counting at 10^8-digit scales.
Riesz, Quelques cons´ equences de la formule explicite de M
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Rigorous Error Bound for the TG Kernel in Prime Counting
Claims a rigorous <1/2 error bound for a truncated Gaussian explicit formula, supposedly enabling exact prime counting at 10^8-digit scales.