A new lower bound for odd perfect numbers
From MaRDI portal
Publication:3825135
DOI10.1090/S0025-5718-1989-0968150-2zbMath0672.10006WikidataQ56939154 ScholiaQ56939154MaRDI QIDQ3825135
Graeme L. Cohen, Richard P. Brent
Publication date: 1989
Published in: Mathematics of Computation (Search for Journal in Brave)
algorithmlower boundfactorizationsnumber theorycomputationalelliptic curve methododd perfect numbers
Related Items
Odd harmonic numbers exceed 10²⁴ ⋮ On the number of distinct prime factors of an odd perfect number ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ Improved Techniques for Lower Bounds for Odd Perfect Numbers
Cites Work
- Perfect numbers
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Über mehrfach vollkommene Zahlen. II.
- A Lower Bound for Odd Triperfects
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- A Search Procedure and Lower Bound for Odd Perfect Numbers
- A Lower Bound for the Set of Odd Perfect Numbers
- Unsolved problems in number theory
- Unnamed Item
