Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



On the total number of prime factors of an odd perfect number

Authors: D. E. Iannucci and R. M. Sorli
Journal: Math. Comp. 72 (2003), 2077-2084
MSC (2000): Primary 11A25, 11Y70
Published electronically: May 8, 2003
MathSciNet review: 1986824
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We say $n\in{\mathbb N}$ is perfect if $\sigma(n)=2n$, where $\sigma(n)$denotes the sum of the positive divisors of $n$. No odd perfect numbers are known, but it is well known that if such a number exists, it must have prime factorization of the form $n=p^{\alpha}\prod_{j=1}^{k}q_j^{2\beta_j}$, where $p$, $q_1$, ..., $q_k$ are distinct primes and $p\equiv\alpha\equiv1\pmod4$. We prove that if $\beta_j\equiv1\pmod3$ or $\beta_j\equiv2\pmod5$ for all $j$, $1\le j\le k$, then $3\nmid n$. We also prove as our main result that $\Omega(n)\ge37$, where $\Omega(n)=\alpha+2\sum_{j=1}^{k}\beta_j$. This improves a result of Sayers $( \Omega(n)\ge 29 )$ given in 1986.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11A25, 11Y70

Retrieve articles in all journals with MSC (2000): 11A25, 11Y70

Additional Information

D. E. Iannucci
Affiliation: University of the Virgin Islands, St. Thomas, Virgin Islands 00802

R. M. Sorli
Affiliation: Department of Mathematical Sciences, University of Technology, Sydney, Broadway, 2007, Australia

Keywords: Odd perfect numbers, factorization
Received by editor(s): November 7, 2001
Published electronically: May 8, 2003
Additional Notes: The authors are grateful for the advice and assistance given by Graeme Cohen
Article copyright: © Copyright 2003 American Mathematical Society