On inequalities involving counts of the 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 (counting multiplicity) of prime factors of N. We prove that 9937ω(N) - 18737 ≤ (N) and that if 3 N, then 5119ω(N)-4619 ≤ (N).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…