Odd perfect numbers of a special form
We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.
We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.
Page 1