arXiv (All)
open access
A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis
Robin's inequality reformulates the Riemann hypothesis as a bound on the sum-of-divisors function $σ$. We introduce a finite-truncation version of Robin's inequality determined intrinsically by the arithmetic structure of $n$, \[ \frac{σ(n)}{n} < e^γ\sum_{j=0}^{ω(n)} \frac{(\ln\ln\ln n)^j}{j!}, \qqu
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
- The Riemann Hypothesis through the looking of partitions#819294
- The Riemann Hypothesis through the looking of partitions#809301
- Oscillation of partial sums of the Möbius function and zeros of Riemann's zeta function#821995
- Lower bounds for discrete moments in a conjecture of Ng#1062928
Record · ID 1062711
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