The nonsquare odd abundant numbers conjecture for {-1,1}-perfect numbers
Statement
Let be a positive odd integer. Call abundant if , and call it nonsquare if it is not a perfect square. Nonsquare odd abundant numbers conjecture. Every nonsquare odd abundant number is -perfect. The paper notes that this holds for every such number checked computationally, while Theorem 3 rules out odd square abundant numbers; the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.