On SA, CA, and GA numbers

Details On SA, CA, and GA numbers On SA, CA, and GA numbers

2011-12-27

arxiv.org/abs/1112.6010v1

Mathematics

Number Theory

29 pages, 2 tables, to appear in The Ramanujan Journal

Scientific paper

Gronwall's function $G$ is defined for $n>1$ by $G(n)=\frac{\sigma(n)}{n \log\log n}$ where $\sigma(n)$ is the sum of the divisors of $n$. We call an integer $N>1$ a \emph{GA1 number} if $N$ is composite and $G(N) \ge G(N/p)$ for all prime factors $p$ of $N$. We say that $N$ is a \emph{GA2 number} if $G(N) \ge G(aN)$ for all multiples $aN$ of $N$. In arXiv 1110.5078, 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. Here, 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 $\le 5040$, 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}$.

Affiliated with

Also associated with

No associations

Rating

On SA, CA, and GA numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On SA, CA, and GA numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On SA, CA, and GA numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37621