Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Sketch of a proof that an odd perfect number relatively prime to $ 3$ has at least eleven prime factors


Author: Peter Hagis
Journal: Math. Comp. 40 (1983), 399-404
MSC: Primary 11A25; Secondary 11-04
DOI: https://doi.org/10.1090/S0025-5718-1983-0679455-1
MathSciNet review: 679455
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: An argument is outlined which demonstates that every odd perfect number which is not divisible by 3 has at least eleven distinct prime factors.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11A25, 11-04

Retrieve articles in all journals with MSC: 11A25, 11-04


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1983-0679455-1
Article copyright: © Copyright 1983 American Mathematical Society