Joshua Zelinsky
Published 2017-06-21Version 1
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 $3 \not| N$, then $\Omega \geq \frac{8}{3}\omega(N)-\frac{7}{3}$ and if $3 |N$ then $\Omega(N) \geq \frac{21}{8}\omega(N)-\frac{39}{8}.$
On a problem of de Koninck
On the quantity $m^2-p^k$ where $p^k m^2$ is an odd perfect number -- Part II
An Investigation Into Several Explicit Burgess Inequalities
![QR code for arXiv:1706.07009 [math.NT]](http://oss.arxitics.com/images/favicon.svg)