Four large amicable pairs

te Riele, H. J. J.

doi:10.1090/S0025-5718-1974-0330033-8

Four large amicable pairs
HTML articles powered by AMS MathViewer

by H. J. J. te Riele PDF

Math. Comp. 28 (1974), 309-312 Request permission

Abstract:

This note gives a report of systematic computer tests of Euler’s rule and several Thabit-ibn-Kurrah-rules, in search of large amicable pairs. The tests have yielded four amicable pairs, which are much larger than the largest amicable pair thus far known.

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
Walter Borho, On Thabit ibn Kurrah’s formula for amicable numbers, Math. Comp. 26 (1972), 571–578. MR 313177, DOI 10.1090/S0025-5718-1972-0313177-4
Edward Brind Escott, Amicable numbers, Scripta Math. 12 (1946), 61–72. MR 17293

De Numeris Amicabilibus

Mariano García, New amicable pairs, Scripta Math. 23 (1957), 167–171. MR 98703
Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969. MR 0286318
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
Elvin J. Lee and Joseph S. Madachy, The history and discovery of amicable numbers. I, J. Recreational Math. 5 (1972), no. 2, 77–93. MR 446841
Elvin J. Lee and Joseph S. Madachy, The history and discovery of amicable numbers. I, J. Recreational Math. 5 (1972), no. 2, 77–93. MR 446841
Elvin J. Lee and Joseph S. Madachy, The history and discovery of amicable numbers. I, J. Recreational Math. 5 (1972), no. 2, 77–93. MR 446841
D. H. Lehmer, An extended theory of Lucas’ functions, Ann. of Math. (2) 31 (1930), no. 3, 419–448. MR 1502953, DOI 10.2307/1968235
Hans Riesel, Lucasian criteria for the primality of $N=h\cdot 2^{n} -1$, Math. Comp. 23 (1969), 869–875. MR 262163, DOI 10.1090/S0025-5718-1969-0262163-1