arXiv (All)
open access
Complete Asymptotic Expansion of the Additive Mertens Sum $S_k(x)$
Let $p_1, \dotsc, p_k$ be primes not exceeding $x$ ($k \geqslant 2$), and define the additive Mertens sum \[ S_k(x) = \sum_{p_1 \leqslant x} \cdots \sum_{p_k \leqslant x} \frac{1}{p_1 + \dotsm + p_k}. \] In contrast to Tenenbaum's generalized (multiplicative) Mertens sum, whose leading term has or
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On subradically sifted sums related to Alladi's higher order duality between prime factors#926969
- A guide to Tauberian theorems for arithmetic applications#986123
- Almost sure upper bound for sums of random multiplicative functions and critical chaos#1063992
- Divisor function and bounds in domains with enough primes#955637
- Averages of multiplicative functions along equidistributed sequences#405953
Record · ID 1116357
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive