Odd perfect numbers

DOI10.1017/S0305004100072030zbMath0805.11005WikidataQ56625316 ScholiaQ56625316MaRDI QIDQ4303434

D. R. Heath-Brown

Publication date: 5 February 1995

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100072030

zbMATH Keywords

divisor function; odd multiply perfect numbers

Mathematics Subject Classification ID

11A25: Arithmetic functions; related numbers; inversion formulas

Related Items

NOTE ON ODD MULTIPERFECT NUMBERS, Odd perfect numbers, Diophantine equations, and upper bounds, AN UPPER BOUND FOR THE NUMBER OF ODD MULTIPERFECT NUMBERS, IMPROVED UPPER BOUNDS FOR ODD MULTIPERFECT NUMBERS, Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors, On the number of distinct prime factors of an odd perfect number, On numbers \(n\) for which the prime factors of \(\sigma(n)\) are among the prime factors on \(n\), Perfect polynomials over \(\mathbb F_4\) with less than five prime factors, Upper bounds for unitary perfect numbers and unitary harmonic numbers, Sieve methods for odd perfect numbers, BOUNDS FOR ODD k-PERFECT NUMBERS, ON ODD PERFECT NUMBERS, Spoof odd perfect numbers, Odd perfect numbers have at least nine distinct prime factors

Cites Work

• Multiply perfect numbers, Mersenne primes, and effective computability
• Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
• Improved Techniques for Lower Bounds for Odd Perfect Numbers