Sieve methods for odd perfect numbers
From MaRDI portal
Publication:2894533
DOI10.1090/S0025-5718-2011-02576-7zbMath1268.11004WikidataQ114093831 ScholiaQ114093831MaRDI QIDQ2894533
Pace P. Nielsen, Pascal Ochem, S. Adam Fletcher
Publication date: 29 June 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Applications of sieve methods (11N36) Arithmetic functions; related numbers; inversion formulas (11A25) Factorization; primality (11A51) Computational number theory (11Y99)
Related Items (6)
On the number of total prime factors of an odd perfect number ⋮ An exponential diophantine equation related to odd perfect numbers ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ Unnamed Item ⋮ On the divisibility of odd perfect numbers, quasiperfect numbers and amicable numbers by a high power of a prime ⋮ Quasiperfect numbers with the same exponent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of distinct prime factors of an odd perfect number
- Multiply perfect numbers, Mersenne primes, and effective computability
- The non-existence of odd perfect numbers of a certain form
- Approximate formulas for some functions of prime numbers
- Über ungerade vollkommene Zahlen
- Computing the Mertens and Meissel–Mertens Constants for Sums over Arithmetic Progressions
- On the constant in the Mertens product for arithmetic progressions. II: Numerical values
- On Dickson's Theorem Concerning Odd Perfect Numbers
- EXPLICIT ZERO-FREE REGIONS FOR DEDEKIND ZETA FUNCTIONS
- Odd perfect numbers have a prime factor exceeding $10^8$
- 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 Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- Odd perfect numbers
- Estimates of $\theta(x;k,l)$ for large values of $x$
- Primes in arithmetic progressions
- The third largest prime divisor of an odd perfect number exceeds one hundred
- Odd perfect numbers of a special form
This page was built for publication: Sieve methods for odd perfect numbers