Improved Techniques for Lower Bounds for Odd Perfect Numbers

DOI10.2307/2938723zbMath0736.11004OpenAlexW2567728622MaRDI QIDQ3980487

Graeme L. Cohen, Richard P. Brent, Herman J. J. te Riele

Publication date: 26 June 1992

Full work available at URL: https://doi.org/10.2307/2938723

zbMATH Keywords

lower boundodd perfect numbersdivisor sum function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Factorization (11Y05) Values of arithmetic functions; tables (11Y70)

Related Items

Odd harmonic numbers exceed 10²⁴ ⋮ The second largest prime divisor of an odd perfect number exceeds ten thousand ⋮ Sieve methods for odd perfect numbers ⋮ Odd perfect numbers are greater than $10^{1500}$ ⋮ Odd perfect numbers have a prime factor exceeding $10^{7}$ ⋮ Odd perfect numbers ⋮ On the number of distinct prime factors of an odd perfect number ⋮ Odd perfect numbers have a prime factor exceeding $10^8$ ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ A new lower bound for odd perfect numbers ⋮ Improved Techniques for Lower Bounds for Odd Perfect Numbers ⋮ On a new generalization of a theorem of L. E. Dickson. II ⋮ Upper bounds for unitary perfect numbers and unitary harmonic numbers ⋮ The algebraic independence of the sum of divisors functions ⋮ Odd perfect numbers have at least nine distinct prime factors ⋮ New techniques for bounds on the total number of prime factors of an odd perfect number ⋮ Superharmonic numbers ⋮ Factoring with the quadratic sieve on large vector computers ⋮ Factorization of the tenth Fermat number ⋮ Odd perfect numbers, Diophantine equations, and upper bounds

Cites Work

• Unnamed Item
• A new lower bound for odd perfect numbers
• Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
• Improved Techniques for Lower Bounds for Odd Perfect Numbers
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers