On the number of total prime factors of an odd perfect number
Abstract
Let N be an odd perfect number. Let ω(N) be the number of distinct prime factors of N and let (N) be the total number of prime factors of N. We prove that if (3,N)=1, then 302113ω - 286113 ≤ . If 3|N, then 6625ω-5≤. This is an improvement on similar prior results by the author which was an improvement of a result of Ochem and Rao. We also establish new lower bounds on ω(N) in terms of the smallest prime factor of N and establish new lower bounds on N in terms of its smallest prime factor.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.