arXiv Analytics

Sign in

arXiv:2303.11974 [math.NT]AbstractReferencesReviewsResources

On inequalities involving counts of the prime factors of an odd perfect number

Graeme Clayton, Cody S. Hansen

Published 2023-03-21Version 1

Let $N$ be an odd perfect number. Let $\omega(N)$ be the number of distinct prime factors of $N$ and let $\Omega(N)$ be the total number (counting multiplicity) of prime factors of $N$. We prove that $\frac{99}{37}\omega(N) - \frac{187}{37} \leq \Omega(N)$ and that if $3\nmid N$, then $\frac{51}{19}\omega(N)-\frac{46}{19} \leq \Omega(N)$.

Comments: 17 pages
Categories: math.NT
Subjects: 11A25, 11A51, 11N32
Related articles: Most relevant | Search more
arXiv:math/0501070 [math.NT] (Published 2005-01-05, updated 2006-04-12)
New techniques for bounds on the total number of Prime Factors of an Odd Perfect Number
arXiv:1803.00324 [math.NT] (Published 2018-03-01)
Primitive weird numbers having more than three distinct prime factors
arXiv:1906.09947 [math.NT] (Published 2019-06-18)
On Deficient Perfect Numbers with Four Distinct Prime Factors