Breeding amicable numbers in abundance
Breeding amicable numbers in abundance
复制标题
大量繁殖友善的数量
DOI：
10.2307/2008232
复制
发表时间：
1986
影响因子：
2
通讯作者：
H. Hoffmann
中科院分区：
文献类型：
--
作者：
W. Borho;H. Hoffmann
在本标题的第一篇文章中，描述了通过在几代中繁殖许多友好数来计算这些友好数的新程序。后来进行了广泛的计算机搜索(1988年)，并证明了这种育种方法的显著效果：通过这种搜索，已知的友好配对的数量很容易翻了两番。正如我们最近(1999年)从互联网上了解到的那样，Pederson和Te Riele再次将这个数字增加了大约10倍。虽然他们没有提供关于他们的搜索方法的信息，但我们在这里发布了我们的方法并总结了计算。我们的结果为友好对的数量是无限的猜想提供了一些证据。
In a first article of this title, new procedures were described to compute many amicable numbers by breeding them in several generations. An extensive computer search was later performed (in 1988), and demonstrated the remarkable effectiveness of this breeding method: the number of known amicable pairs was easily quadrupled by this search. As we learnt recently (1999) from the internet, Pederson and te Riele have again multiplied that number roughly by ten. While they give no information on their method of search, we publish here our method and summarize the computations. Our results provide some evidence for the conjecture that the number of amicable pairs is infinite.