Sieve methods for odd perfect numbers
A positive integer \(N\) is perfect if \(\sigma(N)= 2N\). No odd perfect number has been found, and a well-known open problem is to show that there are none. Various conditions on the number or size of the prime factors of an odd perfect number \(N\) (if one exists) have been established. In [On the divisibility of odd perfect numbers by a high power of a prime, \url{http://arxiv.org/abs/math/0511410}] \textit{T. Yamada} obtained an upper bound for the smallest prime factor of \(N\) if certain conditions hold. The current paper establishes an improvement of this result. The prime factor \(\pi\) of \(N\) is called special if \(N=\pi^\alpha m^2\) with \(\pi\nmid m\) and \(\pi\equiv\alpha\equiv 1\pmod 4\). Let \(N\) be an odd perfect number such that if \(p^\alpha\parallel N\) with \(p\) not the special prime then either \(3|(\alpha+ 1)\) or \(5|(\alpha+ 1)\).NEWLINENEWLINE The main theorem of this paper asserts that the smallest prime factor \(p\) of \(N\) satisfies \(10^8< p< 10^{1000}\). The authors first prove a more general result that extends Yamada's first theorem and leads ultimately by applying the large sieve and results from prime number theory to the upper bound for \(p\). The proof of the lower bound involves a lot of computation the full print-outs of which are available on the second author's website. Assuming that \(N\) is not divisible by the sixth: power of a prime, the idea is to compute factor chains of prime divisors of \(N\) showing that if \(q\) is a prime dividing \(N\) with \(7\leq q< 10^8\) then a smaller prime divides \(N\) and then to show, that \(3\nmid N\), \(5\nmid N\).
- Approximate formulas for some functions of prime numbers
- Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
- Estimates of \theta(x;k,l) for large values of x
- EXPLICIT ZERO-FREE REGIONS FOR DEDEKIND ZETA FUNCTIONS
- scientific article; zbMATH DE number 1614278 (Why is no real title available?)
- scientific article; zbMATH DE number 1303171 (Why is no real title available?)
- scientific article; zbMATH DE number 1346247 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 2218584 (Why is no real title available?)
- scientific article; zbMATH DE number 2239783 (Why is no real title available?)
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- Multiply perfect numbers, Mersenne primes, and effective computability
- New techniques for bounds on the total number of prime factors of an odd perfect number
- Odd perfect numbers
- Odd perfect numbers have a prime factor exceeding 10⁸
- Odd perfect numbers have at least nine distinct prime factors
- Odd perfect numbers of a special form
- On Dickson's theorem concerning odd perfect numbers
- On Odd Perfect, Quasiperfect, and Odd Almost Perfect Numbers
- On the constant in the Mertens product for arithmetic progressions. II: Numerical values
- On the number of distinct prime factors of an odd perfect number
- Primes in arithmetic progressions
- The non-existence of odd perfect numbers of a certain form
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- The third largest prime divisor of an odd perfect number exceeds one hundred
- Über ungerade vollkommene Zahlen
- On the total number of prime factors of an odd perfect number
- An exponential Diophantine equation related to odd perfect numbers
- Prime factors of _3 (x) of the same form
- 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
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- Linear support for the prime number sequence and the first and second Hardy-Littlewood conjectures
- Explicit sieve estimates and nonexistence of odd multiperfect numbers of a certain form
- A new sieve to identify prime numbers
- On a theorem of Kanold on odd perfect numbers
This page was built for publication: Sieve methods for odd perfect numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894533)
