Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors

DOI10.2307/2007384zbMath0506.10002OpenAlexW4248349775WikidataQ114042851 ScholiaQ114042851MaRDI QIDQ4742842

Peter Hagis jun.

Publication date: 1983

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007384

zbMATH Keywords

odd perfect numbereleven prime factors

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (7)

On some properties of the Euler's factor of certain odd perfect numbers ⋮ On the number of distinct prime factors of an odd perfect number ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ More on the total number of prime factors of an odd perfect number ⋮ 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 ⋮ On the total number of prime factors of an odd perfect number

This page was built for publication: Sketch of a Proof that an Odd Perfect Number Relatively Prime to 3 has at Least Eleven Prime Factors