On the number of distinct prime factors of an odd perfect number
From MaRDI portal
Publication:876691
DOI10.1016/S1570-8667(03)00004-2zbMATH Open1116.11301WikidataQ114120143 ScholiaQ114120143MaRDI QIDQ876691FDOQ876691
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- Odd perfect numbers are divisible by at least seven distinct primes
- Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
- 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
- On the number of distinct prime factors of an odd perfect number
- Multiply perfect numbers, Mersenne primes, and effective computability
- Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommenen Zahlen
- Non-existence of odd perfect numbers of the form \(3^{2\beta}p_1^{2\beta_1}s_2^{2\beta_2}s_3^{2\beta_3}\)
- A new lower bound for odd perfect numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers
- On the second largest prime divisor of an odd perfect number
- Odd Integers N with Five Distinct Prime Factors for which 2 - 10 -12 < σ(N)/N < 2 + 10 -12
- Title not available (Why is that?)
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- Odd perfect numbers
- Every odd perfect number has a prime factor which exceeds 10⁶
- The third largest prime divisor of an odd perfect number exceeds one hundred
- Almost Perfect Numbers
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Sieve methods for odd perfect numbers
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- New techniques for bounds on the total number of prime factors of an odd perfect number
- Odd perfect numbers have at least nine distinct prime factors
- Title not available (Why is that?)
- Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors
- On some properties of the Euler's factor of certain odd perfect numbers
- Odd solutions of $\sigma(n)-2n=2$ have at least six distinct prime factors
- On the number of distinct prime factors of an odd perfect number
- Each friend of 10 has at least 10 nonidentical prime factors
Recommendations
- 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 👍 👎
- On the number of prime factors of an odd perfect number 👍 👎
- Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors 👍 👎
This page was built for publication: On the number of distinct prime factors of an odd perfect number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876691)
