Improved Techniques for Lower Bounds for Odd Perfect Numbers
From MaRDI portal
Recommendations
Cites work
- A new lower bound for odd perfect numbers
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- Outline of a Proof that Every Odd Perfect Number has at Least Eight Prime Factors
Cited in
(34)- On a new generalization of a theorem of L. E. Dickson. II
- Factoring with the quadratic sieve on large vector computers
- Upper bounds for unitary perfect numbers and unitary harmonic numbers
- Sieve methods for odd perfect numbers
- Odd perfect numbers are greater than \(10^{1500}\)
- Superharmonic numbers
- Odd harmonic numbers exceed \(10^{24}\)
- Odd perfect numbers have a prime factor exceeding 10⁸
- 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
- Congruences for odd perfect numbers modulo some powers of 2
- On k-Imperfect Numbers
- scientific article; zbMATH DE number 3989433 (Why is no real title available?)
- A new lower bound for odd perfect numbers
- On the second largest prime divisor of an odd perfect number
- Improved Techniques for Lower Bounds for Odd Perfect Numbers
- scientific article; zbMATH DE number 60861 (Why is no real title available?)
- Factorization of the tenth Fermat number
- The second largest prime divisor of an odd perfect number exceeds ten thousand
- There are no small odd perfect numbers
- Odd perfect numbers
- An Extension of the Results of Servais and Cramer on Odd Perfect and Odd Multiply Perfect Numbers
- A note on odd perfect numbers
- The abundancy index of divisors of odd perfect numbers. III
- scientific article; zbMATH DE number 2147176 (Why is no real title available?)
- Odd perfect numbers have a prime factor exceeding $10^{7}$
- Finiteness theorems for perfect numbers and their kin
- Odd perfect numbers, Diophantine equations, and upper bounds
- On odd and even perfect numbers
- On near-perfect numbers
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- The algebraic independence of the sum of divisors functions
- On the number of distinct prime factors of an odd perfect number
- A remark on sociable numbers of odd order
This page was built for publication: Improved Techniques for Lower Bounds for Odd Perfect Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980487)
