Bounds On Factors Of Odd Perfect Numbers
Abstract
Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the sums of reciprocals of the factors of odd perfect numbers, or, in more technical terms, the properties of the sub-sums of σ-1 (n). By this result, it also establishes strong bounds on the prime factors of odd perfect numbers using the number of distinct prime factors it may possess.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.