arXiv Analytics

Sign in

arXiv:2202.08116 [math.NT]AbstractReferencesReviewsResources

A new approach to odd perfect numbers via GCDs

Jose Arnaldo Bebita Dris

Published 2022-02-10Version 1

Let $q^k n^2$ be an odd perfect number with special prime $q$. Define the GCDs $$G = \gcd\bigg(\sigma(q^k),\sigma(n^2)\bigg)$$ $$H = \gcd\bigg(n^2,\sigma(n^2)\bigg)$$ and $$I = \gcd\bigg(n,\sigma(n^2)\bigg).$$ We prove that $G \times H = I^2$. (Note that it is trivial to show that $G \mid I$ and $I \mid H$ both hold.) We then compute expressions for $G, H,$ and $I$ in terms of $\sigma(q^k)/2, n,$ and $\gcd\bigg(\sigma(q^k)/2,n\bigg)$. Afterwards, we prove that if $G = H = I$, then $\sigma(q^k)/2$ is not squarefree. Other natural and related results are derived further. Lastly, we conjecture that the set $$\mathscr{A} = \{m : \gcd(m,\sigma(m^2))=\gcd(m^2,\sigma(m^2))\}$$ has asymptotic density zero.

Comments: 9 pages
Categories: math.NT
Subjects: 11A05, 11A25
Related articles: Most relevant | Search more
arXiv:2109.13652 [math.NT] (Published 2021-09-20, updated 2022-03-02)
On the quantity $m^2-p^k$ where $p^k m^2$ is an odd perfect number -- Part II
arXiv:1906.12184 [math.NT] (Published 2019-06-28)
A note on odd perfect numbers
arXiv:1810.13063 [math.NT] (Published 2018-10-31)
On the number of total prime factors of an odd perfect number