One-Step $G$-Unimprovable Numbers

TL;DR

This paper proves the infinitude of a special set of integers related to the Gronwall number, introduces a constructive algorithm to find these numbers, and explores their properties with potential implications for the Ramanujan-Robin inequality.

Contribution

The paper establishes the infinite nature of the set of $G$-unimprovable numbers and provides a new algorithm to compute them, advancing understanding of their properties.

Findings

The set of $G$-unimprovable numbers is infinite.

An explicit minimal element of this set is identified.

Properties of these numbers may aid in proving the Ramanujan-Robin inequality.

Abstract

The infinitude is established of the set ${\bf U_1}$ of positive integers $N>5$ such that $G(N)\le \min(G(N/q), G(Np))$ where $q, p$ are primes, $q\ | N$ and $G(N):=\frac{\sigma(N)}{N\log \log N}$ stands for Gronwall number, $\sigma(N)$ being the sum of all divisors of $N$. The constructive algorithm is proposed which successively calculates the elements of ${\bf U_1}$, the least of them $N_1^*=2^5\cdot 3^3 \cdot 5^2 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 =160\ 626\ 866\ 400, \ G(N_1^*)=1.7374\dots$ Some interesting properties of these numbers are studied which may occur useful for the proof of Ramanujan-Robin inequality.