On the largest prime divisor of an odd perfect number. II

Hagis, Peter; McDaniel, Wayne L.

doi:10.1090/S0025-5718-1975-0371804-2

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.

On the largest prime divisor of an odd perfect number. II
HTML articles powered by AMS MathViewer

by Peter Hagis and Wayne L. McDaniel PDF

Math. Comp. 29 (1975), 922-924 Request permission

Abstract:

It is proved here that every odd perfect number has a prime factor greater than 100110.

References

Peter Hagis Jr. and Wayne L. McDaniel, On the largest prime divisor of an odd perfect number, Math. Comp. 27 (1973), 955–957. MR 325508, DOI 10.1090/S0025-5718-1973-0325508-0
Hans-Joachim Kanold, Untersuchungen über ungerade vollkommene Zahlen, J. Reine Angew. Math. 183 (1941), 98–109 (German). MR 6182, DOI 10.1515/crll.1941.183.98
Karl K. Norton, Remarks on the number of factors of an odd perfect number, Acta Arith. 6 (1960/61), 365–374. MR 147434, DOI 10.4064/aa-6-4-365-374