Logo image
Sign in
Sieve Methods for Odd Perfect Numbers
Journal article   Open access   Peer reviewed

Sieve Methods for Odd Perfect Numbers

S. Adam Fletcher, P. Nielsen Pace and Pascal Ochem
Mathematics of Computation, Vol.81, pp.1753-1776
2012

Abstract

Using a new factor chain argument, we show that 5 does not divide an odd perfect number indivisible by a sixth power. Applying sieve techniques, we also find an upper bound on the smallest prime divisor. Putting this together we prove that an odd perfect number must be divisible by the sixth power of a prime or its smallest prime factor lies in the range 10^8 < p < 10^1000. These results are generalized to much broader situations.
url
Find in HALView
url
https://doi.org/10.1090/S0025-5718-2011-02576-7View
Published (Version of record) Open

Metrics

1 Record Views

Details

Logo image