An improvement of an inequality of Ochem and Rao concerning odd perfect numbers

zbMATH Open1448.11013arXiv1706.07009MaRDI QIDQ5384259FDOQ5384259

Joshua Zelinsky

Publication date: 21 June 2019

Abstract: Let $Omega(n)$ denote the total number of prime divisors of $n$ (counting multiplicity) and let $omega(n)$ denote the number of distinct prime divisors of $n$. Various inequalities have been proved relating $omega(N)$ and $Omega(N)$ when $N$ is an odd perfect number. We improve on these inequalities. In particular, we show that if $3ot|N$, then $Omegageqfrac83omega(N)-frac73$ and if $3|N$ then $Omega(N)geqfrac218omega(N)-frac398.$

Full work available at URL: https://arxiv.org/abs/1706.07009

Recommendations

• On the total number of prime factors of an odd perfect number
• More on the total number of prime factors of an odd perfect number
• On the total number of prime factors of an odd perfect number
• On the number of prime factors of an odd perfect number
• On odd perfect numbers

zbMATH Keywords

inequalitynumber of distinct prime divisorsodd perfect numbertotal number of prime divisors

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25)

Cites Work

• On the number of prime factors of an odd perfect number
• Odd perfect numbers, Diophantine equations, and upper bounds

Cited In (2)

• Upper bounds on the second largest prime factor of an odd perfect number
• On the number of total prime factors of an odd perfect number

This page was built for publication: An improvement of an inequality of Ochem and Rao concerning odd perfect numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384259)