Finite connected components of the aliquot graph

Andrew R. Booker*

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

4 Citations (Scopus)
408 Downloads (Pure)


Conditional on a strong form of the Goldbach conjecture, we determine all finite connected components of the aliquot graph containing a number less than 109, as well as those containing an amicable pair below 1014 or one of the known perfect or sociable cycles below 1017. Along the way we develop a fast algorithm for computing the inverse image of an even number under the sum-of-proper-divisors function.

Original languageEnglish
Pages (from-to)2891-2902
Number of pages12
JournalMathematics of Computation
Issue number314
Early online date20 Feb 2018
Publication statusPublished - 2018


Dive into the research topics of 'Finite connected components of the aliquot graph'. Together they form a unique fingerprint.

Cite this