We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
In this paper, we prove that, if $N$ is a positive odd number with $r$ distinct prime factors such that $N\mid \sigma (N)$, then $N\lt {2}^{{4}^{r} - {2}^{r} } $ and $N{\mathop{\prod }\nolimits}_{p\mid N} p\lt {2}^{{4}^{r} } $, where $\sigma (N)$ is the sum of all positive divisors of $N$. In particular, these bounds hold if $N$ is an odd perfect number.
The main result in the earlier paper (by the first author) is improved as follows. The number of odd multiperfect numbers with at most $r$ distinct prime factors is bounded by ${4}^{{r}^{2} } / {2}^{r+ 2} (r- 1)!$.
A natural number $n$ is called $k$-perfect if $\sigma (n)= kn$. In this paper, we show that for any integers $r\geq 2$ and $k\geq 2$, the number of odd $k$-perfect numbers $n$ with $\omega (n)\leq r$ is bounded by $\left({\lfloor {4}^{r} { \mathop{ \log } \nolimits }_{3} 2\rfloor + r\atop r} \right){ \mathop{ \sum } \nolimits }_{i= 1}^{r} \left({\lfloor kr/ 2\rfloor \atop i} \right)$, which is less than ${4}^{{r}^{2} } $ when $r$ is large enough.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.