ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A primary pseudoperfect number is a positive integer KK with the defining property that, for every prime divisor pp of KK, one has 1/K+1/p1/K+1/p equal to an integer. Let KrK_r denote a primary pseudoperfect number with rr prime factors. The known values through K8K_8 suggest the following prediction. Ninth primary pseudoperfect number conjecture. There exists exactly one primary pseudoperfect number K9K_9 with nine prime factors, and

K9(mod62⋅8)=258.K_9\pmod{6^2\cdot 8}=258.

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 K9K_9, and the existence of K9K_9 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.