Odd perfect numbers, Diophantine equations, and upper bounds
From MaRDI portal
Publication:5264139
DOI10.1090/S0025-5718-2015-02941-XzbMath1325.11009WikidataQ56059209 ScholiaQ56059209MaRDI QIDQ5264139
Publication date: 20 July 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Computer solution of Diophantine equations (11Y50) Arithmetic functions; related numbers; inversion formulas (11A25)
Related Items
On the number of total prime factors of an odd perfect number, Spoof odd perfect numbers, On the third largest prime divisor of an odd perfect number, A note on the Diophantine equations \(2 l n^2 = 1 + q + \cdots + q^\alpha\) and application to odd perfect numbers, Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors, On finiteness of odd superperfect numbers, Unnamed Item, Perfect and Deficient Perfect Numbers, Unnamed Item, Odd perfect numbers: a triptych, Unnamed Item, An improvement of an inequality of Ochem and Rao concerning odd perfect numbers, On near-perfect numbers, Unnamed Item, A new upper bound for numbers with the Lehmer property and its application to repunit numbers, Odd, spoof perfect factorizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wieferich pairs and Barker sequences
- Odd perfect numbers are greater than $10^{1500}$
- Spoof odd perfect numbers
- 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
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- Odd perfect numbers
- Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
- The third largest prime divisor of an odd perfect number exceeds one hundred
- IMPROVED UPPER BOUNDS FOR ODD MULTIPERFECT NUMBERS
- Odd perfect numbers are divisible by at least seven distinct primes
