ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KrK_r denote a primary pseudoperfect number with rr prime factors. The claim concerns those KrK_r divisible by 66. Primary pseudoperfect congruence conjecture. For all r≥2r\ge2, if 6∣Kr6\mid K_r, then

Kr≡6+62(r−2)(mod62⋅8).K_r\equiv 6+6^2(r-2)\pmod{6^2\cdot 8}.

Equivalently, if Kr>2K_r>2, then KrK_r is a multiple of 66 and

Kr−662≡r−2(mod8).\frac{K_r-6}{6^2}\equiv r-2\pmod{8}.

The statement is proposed as a strengthening of a previously established congruence for all primary pseudoperfect numbers divisible by 66, including any with more than eight prime factors. No resolution is supplied in the source.

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.