arXiv:2109.13652 [math.NT]AbstractReferencesReviewsResources
On the quantity $m^2-p^k$ where $p^k m^2$ is an odd perfect number -- Part II
Jose Arnaldo Bebita Dris, Immanuel Tobias San Diego
Published 2021-09-20, updated 2022-03-02Version 2
Let $p^k m^2$ be an odd perfect number with special prime $p$. Extending previous work of the authors, we prove that the inequality $m < p^k$ follows from $m^2 - p^k = 2^r t$, where $r \geq 2$ and $\gcd(2,t)=1$, under the following hypotheses: (a) $m > t > 2^r$, or (b) $m > 2^r > t$. We also prove that the estimate $m^2 - p^k > 2m$ holds. We can also improve this unconditional estimate to $m^2 - p^k > {m^2}/3$.
Comments: 11 pages, incorporated referee comments and suggestions, added Section 5.1, in press at NNTDM <https://nntdm.net/volume-28-2022/number-1/>
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2202.08116 [math.NT] (Published 2022-02-10)
A new approach to odd perfect numbers via GCDs
arXiv:1810.13063 [math.NT] (Published 2018-10-31)
On the number of total prime factors of an odd perfect number
arXiv:1906.12184 [math.NT] (Published 2019-06-28)
A note on odd perfect numbers