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.


Spoof odd perfect numbers
HTML articles powered by AMS MathViewer

by Samuel J. Dittmer PDF
Math. Comp. 83 (2014), 2575-2582 Request permission


In 1638, Descartes showed that $3^2 \cdot 7^2 \cdot 11^2 \cdot 13^2 \cdot 22021^1$ would be an odd perfect number if $22021$ were prime. We give a formal definition for such “spoof” odd perfect numbers, and construct an algorithm to find all such integers with a given number of distinct quasi-prime factors. We show that Descartes’ example is the only spoof with less than seven such factors.
Similar Articles
Additional Information
  • Samuel J. Dittmer
  • Affiliation: Department of Mathematics, Brigham Young University, Provo, Utah 84602
  • Email:
  • Received by editor(s): June 19, 2012
  • Received by editor(s) in revised form: January 16, 2013
  • Published electronically: October 25, 2013
  • © Copyright 2013 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 83 (2014), 2575-2582
  • MSC (2010): Primary 11A25; Secondary 11A05, 11A67, 11D72, 11N80
  • DOI:
  • MathSciNet review: 3223347