Indexed metadata

Improved average and almost-all bounds for G(n)G(n)

Chiara Bellotti

Source record

Source: arXiv

Published: Oct 7, 2026

arXiv: 2610.10177

Open original source ↗

Source abstract

In this paper we study the least positive integer G(n)G(n) such that the integers a≤G(n)a\leq G(n) with (a,n)=1(a,n)=1 generate (Z/nZ)×(\mathbb Z/n\mathbb Z)^\times. We prove that, for every ε>0\varepsilon>0, ∑n≤xG(n)≪εx(log⁡x)8/3+ε, \sum_{n\leq x}G(n)\ll_\varepsilon x(\log x)^{8/3+\varepsilon}, improving the previously known bound ≪x(log⁡x)97\ll x(\log x)^{97}. We also prove that G(n)≤(log⁡n)2G(n)\leq(\log n)^2 for almost all nn, unconditionally. Thus, for almost all nn, we obtain the same logarithmic exponent 22 as in the classical pointwise bound under GRH.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.