Erdős Problem #313 — Prime reciprocal sums with squarefree denominators
For a positive integer , let be distinct primes and let be an integer. The question is whether there are infinitely many choices of satisfying
Because the primes are distinct, any such solution necessarily has . Thus the question is equivalently whether there are infinitely many squarefree integers such that
Erdős Problems #313 (ErGr80, p. 40)
Background
These integers are called primary pseudoperfect numbers. The identification follows by clearing denominators: the numerator of , when written over , is not divisible by any , so its reduced denominator still contains every . The original question is attributed to Erdős and Graham (1980, p. 40). The examples given with it are , from , and , from . Erdős Problems #313 (ErGr80, p. 40) Erdős Problems #313
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
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.