Conjecture on the ninth primary pseudoperfect number
Statement
A primary pseudoperfect number is a positive integer with the defining property that, for every prime divisor of , one has equal to an integer. Let denote a primary pseudoperfect number with prime factors. The known values through suggest the following prediction. Ninth primary pseudoperfect number conjecture. There exists exactly one primary pseudoperfect number with nine prime factors, and
There are no further primary pseudoperfect numbers. This is explicitly presented as a prediction motivated by the observed remainder progression; its computational verification would require searching below a 106-digit upper bound for , and the existence of and the nonexistence of all later examples remain 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.