2000 character limit reached
Bounds On Factors Of Odd Perfect Numbers
Published 20 Nov 2012 in math.NT | (1211.4733v1)
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 \sigma_{-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.