On relatively prime odd amicable numbers

Hagis, Peter

doi:10.1090/S0025-5718-1969-0246816-7

On relatively prime odd amicable numbers
HTML articles powered by AMS MathViewer

by Peter Hagis PDF

Math. Comp. 23 (1969), 539-543 Request permission

Abstract:

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.

References

J. Alanen, O. Ore, and J. Stemple, Systematic computations on amicable numbers, Math. Comp. 21 (1967), 242–245. MR 222006, DOI 10.1090/S0025-5718-1967-0222006-7
Paul Bratley and John McKay, More amicable numbers, Math. Comp. 22 (1968), 677–678. MR 225706, DOI 10.1090/S0025-5718-1968-0225706-9
Edward Brind Escott, Amicable numbers, Scripta Math. 12 (1946), 61–72. MR 17293
Mariano García, New amicable pairs, Scripta Math. 23 (1957), 167–171. MR 98703
Peter Hagis Jr., Relatively prime amicable numbers of opposite parity, Math. Mag. 43 (1970), 14–20. MR 253977, DOI 10.2307/2688105
Hans-Joachim Kanold, Untere Schranken für teilerfremde befreundete Zahlen, Arch. Math. (Basel) 4 (1953), 399–401 (German). MR 58622, DOI 10.1007/BF01899256
Elvin J. Lee, Amicable numbers and the bilinear diophantine equation, Math. Comp. 22 (1968), 181–187. MR 224543, DOI 10.1090/S0025-5718-1968-0224543-9

Scripta Math.