Congruence progression conjecture for primary pseudoperfect numbers

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 r2r\ge2, if 6Kr6\mid K_r, then

Kr6+62(r2)(mod628).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

Kr662r2(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.

Sources & referencesView supporting material

Primary source

Jonathan Sondow and Kieren MacMillan, “Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation”, arXiv:1812.06566 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.