Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
A search procedure and lower bound for odd perfect numbers
Abstract
An infinite tree-generating “q-algorithm” is defined, which if executed would enumerate all odd perfect numbers (opn’s). A truncated execution shows that any opn has either some component pa > 1018, with a even, or no divisor < 7; hence any opn must be > 1036. © 1973, American Mathematical Society.
Related
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence