On SA, CA, and GA numbers

On SA, CA, and GA numbers - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 Chercheur Indépendant 2 ICJ - Institut Camille Jordan Villeurbanne

Abstract : Gronwall-s function $G$ is defined for $n>1$ by $Gn=\frac{\sigman}{n \log\log n}$ where $\sigman$ is the sum of the divisors of $n$. We call an integer $N>1$ a~\emph{GA1 number} if $N$~is composite and $GN \ge GN-p$ for all prime factors~$p$ of~$N$. We say that $N$ is a \emph{GA2 number} if $GN \ge GaN$ for all multiples $aN$ of~$N$. In \cite{CNS}, we used Robin-s and Gronwall-s theorems on~$G$ to prove that the Riemann Hypothesis RH is true if and only if $4$~is the only number that is both GA1 and GA2. In the present paper, we study GA1 numbers and GA2 numbers separately. We compare them with superabundant SA and colossally abundant CA numbers first studied by Ramanujan. We give algorithms for computing GA1 numbers; the smallest one with more than two prime factors is 183783600, while the smallest odd one is 1058462574572984015114271643676625. We find nineteen GA2 numbers $\le5040$, and prove that a GA2 number $N>5040$ exists if and only if RH is false, in which case $N$ is even and $>10^{8576}$.

Keywords : Sum-of-divisors function *Superabundant Robin-s inequality Prime factor *Riemann Hypothesis Gronwall-s theorem Colossally abundant Algorithm

Autor: Geoffrey Caveney - Jean-Louis Nicolas - Jonathan Sondow -

Fuente: https://hal.archives-ouvertes.fr/

DESCARGAR PDF