Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1090/S0025-5718-2011-02576-7 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
Abundance,factor chains,large sieve,odd perfect number | Prime (order theory),Unitary perfect number,Combinatorics,Perfect number,Perfect power,Prime factor,Divisor,Prime power,Mathematics,Large sieve | Journal |
Volume | Issue | ISSN |
81 | 279 | 0025-5718 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Adam Fletcher | 1 | 0 | 0.34 |
| PACE P. NIELSEN | 2 | 7 | 2.96 |
| Pascal Ochem | 3 | 258 | 36.91 |