English

Subsets of colossally abundant numbers

Number Theory 2019-03-11 v1

Abstract

Let G(n)=σ(n)/(nloglogn)G(n)=\sigma (n)/(n \log \log n ). Robin made hypothesis that G(n)<eγG(n)<e^\gamma for all integer n>5040n>5040. This article divides all colossally abundant numbers in to three disjoint subsets CA1, CA2 and CA3, and shows that Robin hypothesis is true if and only if all CA2 numbers n>5040n>5040 satisfy Robin inequality.

Keywords

Cite

@article{arxiv.1903.03490,
  title  = {Subsets of colossally abundant numbers},
  author = {Xiaolong Wu},
  journal= {arXiv preprint arXiv:1903.03490},
  year   = {2019}
}

Comments

23 pages

R2 v1 2026-06-23T08:02:21.775Z