Skip to content

Erdős problem 313

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: pP1p=11m\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#313
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page