Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.