1. Finite connected components of the aliquot graph
- Author
-
Andrew R. Booker
- Subjects
Connected component ,Discrete mathematics ,Algebra and Number Theory ,Inverse image ,Mathematics - Number Theory ,Applied Mathematics ,010102 general mathematics ,010103 numerical & computational mathematics ,01 natural sciences ,Fast algorithm ,Combinatorics ,Computational Mathematics ,TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY ,Goldbach's conjecture ,FOS: Mathematics ,Graph (abstract data type) ,Number Theory (math.NT) ,0101 mathematics ,Mathematics - Abstract
Conditional on a strong form of the Goldbach conjecture, we determine all finite connected components of the aliquot graph containing a number less than $10^9$, as well as those containing an amicable pair below $10^{14}$ or one of the known perfect or sociable cycles below $10^{17}$. Along the way we develop a fast algorithm for computing the inverse image of an even number under the sum-of-proper-divisors function., 10 pages, to appear in Mathematics of Computation
- Published
- 2018
- Full Text
- View/download PDF