Bounds for Odd k-Perfect Numbers
classification
🧮 math.NT
keywords
perfectintegernumbernumbersboundedboundscalleddistinct
read the original abstract
Let $k\ge2$ be an integer. A natural number $n$ is called $k$-perfect if $\sigma(n)=kn.$ For any integer $r\ge1$ we prove that the number of odd $k$-perfect numbers with at most $r$ distinct prime factors is bounded by $k4^{r^3}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.