On Relatively Prime Odd Amicable Numbers
Peter Hagis · Mathematics of Computation · 1969
Whether or not a relatively prime pair of amicable numbers exists is still an open question. In this paper some necessary conditions for $m$ and $n$ to be a pair of odd relatively prime amicable numbers are proved. In particular, lower bounds for $m$, $n$, $mn$ and the number of prime divisors of $mn$ are established. The arguments are based on an extensive case study carried out on the CDC 6400 at the Temple University Computing Center.