A new lower bound for odd perfect numbers
100. R. P. Brent and G. L. Cohen,
A new lower bound for odd perfect numbers,
Mathematics of Computation 53 (1989), 431-437.
Microfiche supplement ibid, S7-24.
Supplement (the proof tree):
We describe an algorithm for proving that there is no odd perfect number less
than a given bound K (or finding such a number if one exists).
implementing the algorithm has been run successfully with
K = 10160,
with the elliptic curve method used for the vast number of factorizations
The proof tree has 3132 leaves and is available as a separate file
For a sequel which extended the result to
K = 10300,
see Brent, Cohen and te Riele .
The integer factorizations used in the proofs are available
Go to next publication
Return to Richard Brent's index page