Skip to content

Erdős problem 313

Start work

Are there infinitely many pairs (m, P) where m ≥ 2 is an integer and P is a set of distinct primes such that the following equation holds: ∑p∈P1p=1−1m\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}?

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

313.lean

Retained formal statement1 of 5

Are there infinitely many pairs (m, P) where m ≥ 2 is an integer and P is a set of distinct primes such that the following equation holds: ∑p∈P1p=1−1m\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}?

FormalConjectures/ErdosProblems/313.leanErdos313.erdos_3131 lineExact file
sorry ↔ Erdos313.erdos313Solutions.Infinite
OpenStatement only, no proof