Odd perfect numbers are divisible by at least seven distinct primes

DOI10.4064/AA-25-3-265-300zbMATH Open0247.10007OpenAlexW1043073501WikidataQ114022072 ScholiaQ114022072MaRDI QIDQ5659634FDOQ5659634

Authors Carl Pomerance 

Publication date 1974

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/205271

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25)

Cited in

(11)

• The second largest prime divisor of an odd perfect number exceeds ten thousand
• Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
• New techniques for bounds on the total number of prime factors of an odd perfect number
• 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
• Odd perfect numbers have a prime factor exceeding $10^{7}$
• Amicable numbers with given number of prime divisors
• Odd perfect numbers, Diophantine equations, and upper bounds
• The Second Largest Prime Factor of an Odd Perfect Number
• Divisibility of divisor functions of even perfect numbers
• On the number of distinct prime factors of an odd perfect number

This page was built for publication: Odd perfect numbers are divisible by at least seven distinct primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659634)