scientific article; zbMATH DE number 3989433
The natural number \(N\) is said to be perfect if \(\sigma(N)=2N\), where \(\sigma(N)\) is the sum of the positive divisors of \(N\). To date thirty perfect numbers have been found, all of them even. Whether or not any odd perfect numbers exist is still an open question. If \(N\) is an odd perfect number it is proved in the present paper that \(N\) has a prime power component which exceeds \(10^{20}\). This improves the bound of \(10^{12}\) established more than twenty years ago by \textit{J. B. Muskat} [Math. Comput. 20, 141--144 (1966; Zbl 0142.28905)]. Muskat's method of attack is not used here. Instead the proof is based on a result due to \textit{W. L. McDaniel} [ibid. 25, 383--385 (1971; Zbl 0218.10019)].
- Prime powers dividing products of consecutive integer values of \(x^{2^n}+1\)
- Odd perfect numbers are greater than \(10^{1500}\)
- On the number of prime factors of an odd perfect number
- On the largest prime divisor of an odd harmonic number
- A new lower bound for odd perfect numbers
- scientific article; zbMATH DE number 60861 (Why is no real title available?)
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- 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
- On the divisibility of odd perfect numbers, quasiperfect numbers and amicable numbers by a high power of a prime
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- Explicit sieve estimates and nonexistence of odd multiperfect numbers of a certain form
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752452)