New techniques for bounds on the total number of prime factors of an odd perfect number
From MaRDI portal
Publication:3592704
DOI10.1090/S0025-5718-07-02033-9zbMath1139.11006arXivmath/0501070OpenAlexW2094186803WikidataQ114093879 ScholiaQ114093879MaRDI QIDQ3592704
Publication date: 13 September 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0501070
Arithmetic functions; related numbers; inversion formulas (11A25) Values of arithmetic functions; tables (11Y70)
Related Items (4)
On the number of total prime factors of an odd perfect number ⋮ Sieve methods for odd perfect numbers ⋮ Odd perfect numbers are greater than $10^{1500}$ ⋮ Odd perfect numbers have a prime factor exceeding $10^8$
Cites Work
- Unnamed Item
- On the number of distinct prime factors of an odd perfect number
- Remarks on the number of factors of an odd perfect number
- Odd perfect numbers have at least nine distinct prime factors
- Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- On the total number of prime factors of an odd perfect number
- More on the total number of prime factors of an odd perfect number
- Odd Perfect Numbers Not Divisible by 3. II
- Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors
- Odd perfect numbers are divisible by at least seven distinct primes
This page was built for publication: New techniques for bounds on the total number of prime factors of an odd perfect number
