Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

Finite connected components of the aliquot graph


Author: Andrew R. Booker
Journal: Math. Comp. 87 (2018), 2891-2902
MSC (2010): Primary 11A25
DOI: https://doi.org/10.1090/mcom/3299
Published electronically: February 20, 2018
Full-text PDF

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 11A25

Retrieve articles in all journals with MSC (2010): 11A25


Additional Information

Andrew R. Booker
Affiliation: School of Mathematics, University of Bristol, University Walk, Bristol, BS8 1TW, United Kingdom
Email: andrew.booker@bristol.ac.uk

DOI: https://doi.org/10.1090/mcom/3299
Received by editor(s): October 24, 2016
Received by editor(s) in revised form: February 15, 2017, May 3, 2017, and May 27, 2017
Published electronically: February 20, 2018
Additional Notes: The author was partially supported by EPSRC Grant EP/K034383/1.
Article copyright: © Copyright 2018 American Mathematical Society

American Mathematical Society