Finite connected components of the aliquot graph

DOI10.1090/mcom/3299zbMath1436.11008arXiv1610.07471OpenAlexW2545283211MaRDI QIDQ3177721

Andrew R. Booker

Publication date: 1 August 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.07471

zbMATH Keywords

amicable pairaliquot graphperfect or sociable cycles

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (2)

DIVISOR‐SUM FIBERS ⋮ Computers as a novel mathematical reality. IV: The Goldbach problem

Uses Software

• PARI/GP

Cites Work

• Unnamed Item
• Exceptional set of Goldbach number
• Two problems of number theory in Islamic times
• Some problems of Erdős on the sum-of-divisors function
• A Search for Aliquot Cycles and Amicable Pairs
• The First Function and Its Iterates
• Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸

This page was built for publication: Finite connected components of the aliquot graph