2000 character limit reached
The Abundancy Index of Divisors of Odd Perfect Numbers
Published 5 Mar 2011 in math.NT | (1103.1090v14)
Abstract: If $N = {qk}{n2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = \nu_{q}(N) = 1$ to hold. We also prove that $qk < 2/3{n2}$, and that $I(qk) < I(n)$, where $I(x)$ is the abundancy index of $x$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.