Bounds for Odd k-Perfect Numbers
Abstract
Let k2 be an integer. A natural number n is called k-perfect if σ(n)=kn. For any integer r1 we prove that the number of odd k-perfect numbers with at most r distinct prime factors is bounded by k4r3.
0
Let k2 be an integer. A natural number n is called k-perfect if σ(n)=kn. For any integer r1 we prove that the number of odd k-perfect numbers with at most r distinct prime factors is bounded by k4r3.