← All problems

Erdős Problem #313 — Prime reciprocal sums with squarefree denominators

46 years old · traced to

For a positive integer kk, let p1<⋯<pkp_1<\cdots<p_k be distinct primes and let m≥2m\ge 2 be an integer. The question is whether there are infinitely many choices of k,m,p1,…,pkk,m,p_1,\ldots,p_k satisfying

∑i=1k1pi=1−1m.\sum_{i=1}^{k}\frac{1}{p_i}=1-\frac{1}{m}.

Because the primes are distinct, any such solution necessarily has m=p1⋯pkm=p_1\cdots p_k. Thus the question is equivalently whether there are infinitely many squarefree integers m>1m>1 such that

1m+∑p∣m1p=1.\frac{1}{m}+\sum_{p\mid m}\frac{1}{p}=1.

Erdős Problems #313 (ErGr80, p. 40)

Background

These integers are called primary pseudoperfect numbers. The identification follows by clearing denominators: the numerator of 1−∑i1/pi1-\sum_i1/p_i, when written over p1⋯pkp_1\cdots p_k, is not divisible by any pip_i, so its reduced denominator still contains every pip_i. The original question is attributed to Erdős and Graham (1980, p. 40). The examples given with it are m=6m=6, from 1/2+1/3=1−1/61/2+1/3=1-1/6, and m=42m=42, from 1/2+1/3+1/7=1−1/421/2+1/3+1/7=1-1/42. Erdős Problems #313 (ErGr80, p. 40) Erdős Problems #313

References

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.