Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
A. Skumanich
SPIE OE/LASE 1992