Portal de Periódicos da CAPES

A Search Procedure and Lower Bound for Odd Perfect Numbers

1973; American Mathematical Society; Volume: 27; Issue: 124 Linguagem: Inglês

10.2307/2005529

1088-6842

Bryant Tuckerman,

Computability, Logic, AI Algorithms

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 ${p^a} > {10^{18}}$, with a even, or no divisor $< 7$; hence any opn must be $> {10^{36}}$.