Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
From MaRDI portal
Publication:3887517
DOI10.2307/2006211zbMath0444.10004OpenAlexW4251868429MaRDI QIDQ3887517
Publication date: 1980
Full work available at URL: https://doi.org/10.2307/2006211
Related Items
On some properties of the Euler's factor of certain odd perfect numbers ⋮ The second largest prime divisor of an odd perfect number exceeds ten thousand ⋮ 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 ⋮ Improved Techniques for Lower Bounds for Odd Perfect Numbers ⋮ More on the total number of prime factors of an odd perfect number ⋮ On a new generalization of a theorem of L. E. Dickson. II ⋮ Upper bounds for unitary perfect numbers and unitary harmonic numbers ⋮ 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 ⋮ On the total number of prime factors of an odd perfect number ⋮ Perfect numbers ⋮ Numbers whose positive divisors have small integral harmonic mean ⋮ Odd perfect numbers, Diophantine equations, and upper bounds
Cites Work
- Unnamed Item
- Multiply perfect numbers, Mersenne primes, and effective computability
- On Multiple Prime Divisors of Cyclotomic Polynomials
- The Second Largest Prime Factor of an Odd Perfect Number
- On the Largest Prime Divisor of an Odd Perfect Number. II
- Odd perfect numbers are divisible by at least seven distinct primes
- Untersuchungen über ungerade vollkommene Zahlen.
This page was built for publication: Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
