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: ∑p∈P1p=1−1m\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:78723369dd13c4710948bebf2a8767d2fdcafd6a26addfddec764597098e35ba
Metadata
sha256:9a0699e35114641f6a2d1943019e45380ce446633182d48f31fa109c64541bcf
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:3e48e4be326c61494dfc406884bbcc6e615785fff727288c6d77abd9338a569c
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page