ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A weak primary pseudoperfect number is a positive integer nn satisfying

1n+∑p∣n1p∈N,\frac{1}{n}+\sum_{p\mid n}\frac{1}{p}\in\mathbb{N},

where the sum is over the prime divisors of nn. A strongly pseudoperfect number is understood in the sense defined in the paper. Weak primary pseudoperfect uniqueness conjecture. The only weak primary pseudoperfect number that is also strongly pseudoperfect is 66. The source notes that weak primary pseudoperfect numbers may be more numerous than primary pseudoperfect numbers and suggests that this conjecture would be substantially harder to prove.

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.