arXiv (All)
open access
Improved average and almost-all bounds for $G(n)$
In this paper we study the least positive integer $G(n)$ such that the integers $a\leq G(n)$ with $(a,n)=1$ generate $(\mathbb Z/n\mathbb Z)^\times$. We prove that, for every $\varepsilon>0$, \[ \sum_{n\leq x}G(n)\ll_\varepsilon x(\log x)^{8/3+\varepsilon}, \] improving the previously known bound
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
- A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis#1062711
- Almost $k$-th powers in short intervals#819835
- Almost $k$-th powers in short intervals#809839
- Note on fractional sum of the divisor function#1200230
- Sharp bounds for intervals in finite subgroup lattices#997233
Record · ID 1234544
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