A new approach to odd perfect numbers via GCDs
Abstract
Let qk n2 be an odd perfect number with special prime q. Define the GCDs G = (σ(qk),σ(n2)) H = (n2,σ(n2)) and I = (n,σ(n2)). We prove that G × H = I2. (Note that it is trivial to show that G I and I H both hold.) We then compute expressions for G, H, and I in terms of σ(qk)/2, n, and (σ(qk)/2,n). Afterwards, we prove that if G = H = I, then σ(qk)/2 is not squarefree. Other natural and related results are derived further. Lastly, we conjecture that the set A = \m : (m,σ(m2))=(m2,σ(m2))\ has asymptotic density zero.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.