{"paper":{"title":"Bounds for Mertens Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Fiori, Habiba Kadiri, Kirsten Wilk, Nathan Ng, Samuel Broadbent","submitted_at":"2026-08-02T21:00:11Z","abstract_excerpt":"In this article we provide new bounds for the Mertens sums and products including $\\sum_{p \\le x} p^{-1}$ and $\\prod_{p \\le x} (1-\\frac{1}{p})$ which provide superior exponential and log type bounds for these sums in all ranges. These weighted prime number sums and products were extensively studied by Rosser and Schoenfeld (1962) and are employed in a wide range of applications in number theory, cryptography, and combinatorics. Extensive tables are provided in this article which will be useful for these types of applications. The main new ideas in this article are sharp bounds for weighted sum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01498","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.01498/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}