Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Odd perfect numbers have at least nine distinct prime factors
HTML articles powered by AMS MathViewer

by Pace P. Nielsen PDF
Math. Comp. 76 (2007), 2109-2126 Request permission

Abstract:

An odd perfect number, $N$, is shown to have at least nine distinct prime factors. If $3\nmid N$ then $N$ must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 11N25, 11Y50
  • Retrieve articles in all journals with MSC (2000): 11N25, 11Y50
Additional Information
  • Pace P. Nielsen
  • Affiliation: Department of Mathematics, University of Iowa, Iowa City, Iowa 52242
  • MR Author ID: 709329
  • Email: pace_nielsen@hotmail.com
  • Received by editor(s): April 1, 2006
  • Received by editor(s) in revised form: September 1, 2006
  • Published electronically: May 9, 2007
  • © Copyright 2007 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 76 (2007), 2109-2126
  • MSC (2000): Primary 11N25; Secondary 11Y50
  • DOI: https://doi.org/10.1090/S0025-5718-07-01990-4
  • MathSciNet review: 2336286