Odd spoof multiperfect numbers
Let \(\sigma\) denote the sum of divisors function. A positive integer \(n\) is said to be \textit{perfect} if \(\sigma(n)=2n\). It is currently an open problem whether there are any odd perfect numbers (OPNs). Due to the lack of any examples, there is interest in generalizations of OPNs called \textit{spoofs}; these are integers \(n\) with a factorization of the form \(n=\prod_{i=1}^{k}x_i^{a_i}\), where each \(x_i\) is an integer, each \(a_i\) is a nonnegative integer, and these integers satisfy the equality\N\[\N\prod_{i=1}^{k}\frac{x_i^{a_i+1}-1}{x_i-1} = 2 n.\N\]\NIf the \(x_i\) are positive, prime, and relatively prime to each other, then the equality \(\sigma(n)=2n\) actually holds; without those hypotheses, the equality \(\sigma(n)=2n\) is only being spoofed. The first spoof was given by Descartes in 1638, and the next example was constructed by \textit{J. Voight} [in: MASS selecta: teaching and learning advanced undergraduate mathematics. Providence, RI: American Mathematical Society (AMS). 293--300 (2003; Zbl 1083.11008)]. Infinite families of spoofs have subsequently been found.\N\NIn the paper under review, a related concept is introduced. A \textit{spoof of the second kind} is defined to be a positive integer \(n\) with a factorization \(n=mx\), with \(m\) and \(x\) both positive integers satisfying \(\sigma(m)(x^2+x+1)=2mx\). When \(x\) is both prime and relatively prime to \(m\), then one obtains the equality \(\sigma(mx^2)=2mx\) (and consequently \(n\) is not perfect); without those hypotheses, that equality is only being spoofed.\N\NGeneralizing further, by spoofing \(\sigma(mx^2)=\ell mx\) for integers \(2\leq \ell \leq 100\), the author found three odd solutions with \(m\leq 10^8\) and with \(x\) both prime and relatively prime to \(m\); they are\N\[\N(m,x,\ell)=(11115,7,16),(1521,61,97),(147537,61,98).\N\]\NOther solutions satisfying fewer restrictions were also found.
This page was built for publication: Odd spoof multiperfect numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941708)
